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/10.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:48:25,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:48:25,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:48:25,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:48:25,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:48:25,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:48:25,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:48:25,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:48:25,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:48:25,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:48:25,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:48:25,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:48:25,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:48:25,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:48:25,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:48:25,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:48:25,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:48:25,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:48:25,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:48:25,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:48:25,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:48:25,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:48:25,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:48:25,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:48:25,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:48:25,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:48:25,157 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:48:25,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:48:25,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:48:25,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:48:25,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:48:25,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:48:25,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:48:25,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:48:25,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:48:25,162 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:48:25,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:48:25,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:48:25,179 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:48:25,179 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:48:25,180 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:48:25,181 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:48:25,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:48:25,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:48:25,181 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:48:25,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:48:25,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:48:25,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:48:25,182 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:48:25,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:48:25,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:48:25,183 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:48:25,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:48:25,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:48:25,183 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:48:25,185 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:48:25,185 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:48:25,238 INFO ]: Repository-Root is: /tmp [2018-06-22 10:48:25,256 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:48:25,260 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:48:25,261 INFO ]: Initializing SmtParser... [2018-06-22 10:48:25,262 INFO ]: SmtParser initialized [2018-06-22 10:48:25,262 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/10.c.smt2 [2018-06-22 10:48:25,263 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:48:25,351 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/10.c.smt2 unknown [2018-06-22 10:48:25,746 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/10.c.smt2 [2018-06-22 10:48:25,751 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:48:25,764 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:48:25,765 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:48:25,765 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:48:25,765 INFO ]: ChcToBoogie initialized [2018-06-22 10:48:25,778 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,869 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25 Unit [2018-06-22 10:48:25,869 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:48:25,870 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:48:25,870 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:48:25,870 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:48:25,913 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,913 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,930 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,930 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,947 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,950 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,961 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (1/1) ... [2018-06-22 10:48:25,965 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:48:25,965 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:48:25,965 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:48:25,965 INFO ]: RCFGBuilder initialized [2018-06-22 10:48:25,966 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48: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:48:25,986 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:48:25,986 INFO ]: Found specification of procedure False [2018-06-22 10:48:25,986 INFO ]: Found implementation of procedure False [2018-06-22 10:48:25,986 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:48:25,986 INFO ]: Found specification of procedure h26 [2018-06-22 10:48:25,986 INFO ]: Found implementation of procedure h26 [2018-06-22 10:48:25,986 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:48:25,986 INFO ]: Found specification of procedure h24 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h24 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h14 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h14 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h13 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h13 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h12 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h12 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h8 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h8 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h7 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h7 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h6 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h6 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h5 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h5 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h21 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h21 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h20 [2018-06-22 10:48:25,987 INFO ]: Found implementation of procedure h20 [2018-06-22 10:48:25,987 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:48:25,987 INFO ]: Found specification of procedure h19 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h19 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h16 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h16 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h17 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h17 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h10 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h10 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h9 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h9 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h11 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h11 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h15 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h15 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h18 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h18 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h23 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h23 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h4 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h4 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h3 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h3 [2018-06-22 10:48:25,988 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:48:25,988 INFO ]: Found specification of procedure h2 [2018-06-22 10:48:25,988 INFO ]: Found implementation of procedure h2 [2018-06-22 10:48:25,989 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:48:25,989 INFO ]: Found specification of procedure h1 [2018-06-22 10:48:25,989 INFO ]: Found implementation of procedure h1 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:48:25,989 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:48:25,992 INFO ]: Found specification of procedure h22 [2018-06-22 10:48:25,992 INFO ]: Found implementation of procedure h22 [2018-06-22 10:48:25,992 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:48:25,992 INFO ]: Found specification of procedure h25 [2018-06-22 10:48:25,992 INFO ]: Found implementation of procedure h25 [2018-06-22 10:48:25,993 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:48:25,993 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:48:25,993 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:48:26,701 INFO ]: Using library mode [2018-06-22 10:48:26,701 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:26 BoogieIcfgContainer [2018-06-22 10:48:26,701 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:48:26,707 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:48:26,707 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:48:26,713 INFO ]: TraceAbstraction initialized [2018-06-22 10:48:26,713 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:48:25" (1/3) ... [2018-06-22 10:48:26,714 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8be2598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:48:26, skipping insertion in model container [2018-06-22 10:48:26,714 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:48:25" (2/3) ... [2018-06-22 10:48:26,715 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8be2598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:26, skipping insertion in model container [2018-06-22 10:48:26,715 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:26" (3/3) ... [2018-06-22 10:48:26,718 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:48:26,726 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:48:26,733 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:48:26,780 INFO ]: Using default assertion order modulation [2018-06-22 10:48:26,781 INFO ]: Interprodecural is true [2018-06-22 10:48:26,781 INFO ]: Hoare is false [2018-06-22 10:48:26,781 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:48:26,781 INFO ]: Backedges is TWOTRACK [2018-06-22 10:48:26,781 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:48:26,781 INFO ]: Difference is false [2018-06-22 10:48:26,781 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:48:26,781 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:48:26,805 INFO ]: Start isEmpty. Operand 125 states. [2018-06-22 10:48:26,824 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:48:26,824 INFO ]: Found error trace [2018-06-22 10:48:26,825 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:48:26,825 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:26,829 INFO ]: Analyzing trace with hash -274989716, now seen corresponding path program 1 times [2018-06-22 10:48:26,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:26,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:26,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:26,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:26,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:26,946 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:27,228 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-06-22 10:48:27,959 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:48:27,961 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:27,961 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:27,963 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:27,978 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:27,979 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:27,981 INFO ]: Start difference. First operand 125 states. Second operand 14 states. [2018-06-22 10:48:28,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:28,410 INFO ]: Finished difference Result 139 states and 166 transitions. [2018-06-22 10:48:28,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:28,412 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:48:28,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:28,423 INFO ]: With dead ends: 139 [2018-06-22 10:48:28,423 INFO ]: Without dead ends: 139 [2018-06-22 10:48:28,425 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:28,437 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 10:48:28,475 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-06-22 10:48:28,476 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-22 10:48:28,479 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-06-22 10:48:28,480 INFO ]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 57 [2018-06-22 10:48:28,483 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:28,483 INFO ]: Abstraction has 139 states and 166 transitions. [2018-06-22 10:48:28,483 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:28,483 INFO ]: Start isEmpty. Operand 139 states and 166 transitions. [2018-06-22 10:48:28,487 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:48:28,487 INFO ]: Found error trace [2018-06-22 10:48:28,487 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:48:28,487 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:28,488 INFO ]: Analyzing trace with hash 1831918601, now seen corresponding path program 1 times [2018-06-22 10:48:28,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:28,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:28,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:28,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:28,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:28,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:28,929 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:48:28,929 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:28,929 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:28,931 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:28,931 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:28,931 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:28,931 INFO ]: Start difference. First operand 139 states and 166 transitions. Second operand 14 states. [2018-06-22 10:48:29,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:29,370 INFO ]: Finished difference Result 139 states and 165 transitions. [2018-06-22 10:48:29,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:29,371 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:48:29,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:29,374 INFO ]: With dead ends: 139 [2018-06-22 10:48:29,374 INFO ]: Without dead ends: 131 [2018-06-22 10:48:29,374 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:48:29,375 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-22 10:48:29,389 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-06-22 10:48:29,389 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 10:48:29,392 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2018-06-22 10:48:29,392 INFO ]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 57 [2018-06-22 10:48:29,392 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:29,392 INFO ]: Abstraction has 131 states and 157 transitions. [2018-06-22 10:48:29,392 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:29,392 INFO ]: Start isEmpty. Operand 131 states and 157 transitions. [2018-06-22 10:48:29,396 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:48:29,396 INFO ]: Found error trace [2018-06-22 10:48:29,396 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:29,396 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:29,396 INFO ]: Analyzing trace with hash 1557610587, now seen corresponding path program 1 times [2018-06-22 10:48:29,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:29,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:29,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:29,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:29,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:29,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:29,605 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:29,605 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:29,605 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:29,606 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:29,606 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:29,606 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:29,606 INFO ]: Start difference. First operand 131 states and 157 transitions. Second operand 12 states. [2018-06-22 10:48:30,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:30,012 INFO ]: Finished difference Result 177 states and 224 transitions. [2018-06-22 10:48:30,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:30,012 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:48:30,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:30,015 INFO ]: With dead ends: 177 [2018-06-22 10:48:30,016 INFO ]: Without dead ends: 177 [2018-06-22 10:48:30,016 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:30,016 INFO ]: Start minimizeSevpa. Operand 177 states. [2018-06-22 10:48:30,037 INFO ]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-06-22 10:48:30,037 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-22 10:48:30,040 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2018-06-22 10:48:30,040 INFO ]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 93 [2018-06-22 10:48:30,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:30,040 INFO ]: Abstraction has 175 states and 221 transitions. [2018-06-22 10:48:30,041 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:30,041 INFO ]: Start isEmpty. Operand 175 states and 221 transitions. [2018-06-22 10:48:30,044 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:48:30,044 INFO ]: Found error trace [2018-06-22 10:48:30,044 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:30,045 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:30,045 INFO ]: Analyzing trace with hash 296853088, now seen corresponding path program 1 times [2018-06-22 10:48:30,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:30,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:30,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:30,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:30,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:30,062 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:30,257 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:30,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:30,257 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:30,258 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:30,258 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:30,258 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:30,258 INFO ]: Start difference. First operand 175 states and 221 transitions. Second operand 12 states. [2018-06-22 10:48:30,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:30,547 INFO ]: Finished difference Result 231 states and 303 transitions. [2018-06-22 10:48:30,547 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:30,547 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:48:30,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:30,551 INFO ]: With dead ends: 231 [2018-06-22 10:48:30,552 INFO ]: Without dead ends: 222 [2018-06-22 10:48:30,552 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:30,555 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 10:48:30,580 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 204. [2018-06-22 10:48:30,581 INFO ]: Start removeUnreachable. Operand 204 states. [2018-06-22 10:48:30,583 INFO ]: Finished removeUnreachable. Reduced from 204 states to 204 states and 266 transitions. [2018-06-22 10:48:30,583 INFO ]: Start accepts. Automaton has 204 states and 266 transitions. Word has length 93 [2018-06-22 10:48:30,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:30,585 INFO ]: Abstraction has 204 states and 266 transitions. [2018-06-22 10:48:30,585 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:30,585 INFO ]: Start isEmpty. Operand 204 states and 266 transitions. [2018-06-22 10:48:30,587 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:48:30,587 INFO ]: Found error trace [2018-06-22 10:48:30,587 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:30,587 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:30,588 INFO ]: Analyzing trace with hash 792298051, now seen corresponding path program 1 times [2018-06-22 10:48:30,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:30,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:30,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:30,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:30,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:30,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:30,908 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:30,909 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:30,909 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:30,909 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:30,909 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:30,909 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:30,909 INFO ]: Start difference. First operand 204 states and 266 transitions. Second operand 12 states. [2018-06-22 10:48:31,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:31,139 INFO ]: Finished difference Result 259 states and 321 transitions. [2018-06-22 10:48:31,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:31,140 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:48:31,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:31,143 INFO ]: With dead ends: 259 [2018-06-22 10:48:31,143 INFO ]: Without dead ends: 251 [2018-06-22 10:48:31,143 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:31,143 INFO ]: Start minimizeSevpa. Operand 251 states. [2018-06-22 10:48:31,164 INFO ]: Finished minimizeSevpa. Reduced states from 251 to 223. [2018-06-22 10:48:31,164 INFO ]: Start removeUnreachable. Operand 223 states. [2018-06-22 10:48:31,166 INFO ]: Finished removeUnreachable. Reduced from 223 states to 223 states and 282 transitions. [2018-06-22 10:48:31,167 INFO ]: Start accepts. Automaton has 223 states and 282 transitions. Word has length 93 [2018-06-22 10:48:31,167 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:31,167 INFO ]: Abstraction has 223 states and 282 transitions. [2018-06-22 10:48:31,167 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:31,167 INFO ]: Start isEmpty. Operand 223 states and 282 transitions. [2018-06-22 10:48:31,169 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:48:31,169 INFO ]: Found error trace [2018-06-22 10:48:31,170 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:31,170 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:31,170 INFO ]: Analyzing trace with hash 1062165624, now seen corresponding path program 1 times [2018-06-22 10:48:31,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:31,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:31,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:31,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:31,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:31,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:31,331 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:31,332 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:31,332 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:31,332 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:31,332 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:31,332 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:31,332 INFO ]: Start difference. First operand 223 states and 282 transitions. Second operand 12 states. [2018-06-22 10:48:31,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:31,616 INFO ]: Finished difference Result 266 states and 332 transitions. [2018-06-22 10:48:31,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:31,616 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:48:31,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:31,619 INFO ]: With dead ends: 266 [2018-06-22 10:48:31,619 INFO ]: Without dead ends: 258 [2018-06-22 10:48:31,620 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:31,620 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-22 10:48:31,638 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 248. [2018-06-22 10:48:31,638 INFO ]: Start removeUnreachable. Operand 248 states. [2018-06-22 10:48:31,640 INFO ]: Finished removeUnreachable. Reduced from 248 states to 248 states and 311 transitions. [2018-06-22 10:48:31,640 INFO ]: Start accepts. Automaton has 248 states and 311 transitions. Word has length 93 [2018-06-22 10:48:31,641 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:31,641 INFO ]: Abstraction has 248 states and 311 transitions. [2018-06-22 10:48:31,641 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:31,641 INFO ]: Start isEmpty. Operand 248 states and 311 transitions. [2018-06-22 10:48:31,643 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:31,643 INFO ]: Found error trace [2018-06-22 10:48:31,643 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:31,643 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:31,643 INFO ]: Analyzing trace with hash 50447933, now seen corresponding path program 1 times [2018-06-22 10:48:31,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:31,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:31,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:31,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:31,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:31,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:31,810 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:31,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:31,810 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:48:31,811 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:48:31,811 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:48:31,811 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:31,811 INFO ]: Start difference. First operand 248 states and 311 transitions. Second operand 4 states. [2018-06-22 10:48:31,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:31,992 INFO ]: Finished difference Result 250 states and 316 transitions. [2018-06-22 10:48:31,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:48:31,992 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 10:48:31,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:31,995 INFO ]: With dead ends: 250 [2018-06-22 10:48:31,995 INFO ]: Without dead ends: 249 [2018-06-22 10:48:31,995 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:31,996 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 10:48:32,011 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-06-22 10:48:32,011 INFO ]: Start removeUnreachable. Operand 247 states. [2018-06-22 10:48:32,014 INFO ]: Finished removeUnreachable. Reduced from 247 states to 247 states and 308 transitions. [2018-06-22 10:48:32,014 INFO ]: Start accepts. Automaton has 247 states and 308 transitions. Word has length 97 [2018-06-22 10:48:32,014 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:32,014 INFO ]: Abstraction has 247 states and 308 transitions. [2018-06-22 10:48:32,014 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:48:32,014 INFO ]: Start isEmpty. Operand 247 states and 308 transitions. [2018-06-22 10:48:32,017 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:32,017 INFO ]: Found error trace [2018-06-22 10:48:32,017 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:32,017 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:32,017 INFO ]: Analyzing trace with hash 1214819917, now seen corresponding path program 1 times [2018-06-22 10:48:32,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:32,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:32,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:32,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:32,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:32,044 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:32,367 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:48:32,455 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:32,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:32,455 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:32,455 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:32,456 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:32,456 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:32,456 INFO ]: Start difference. First operand 247 states and 308 transitions. Second operand 13 states. [2018-06-22 10:48:32,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:32,888 INFO ]: Finished difference Result 297 states and 374 transitions. [2018-06-22 10:48:32,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:32,888 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:32,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:32,891 INFO ]: With dead ends: 297 [2018-06-22 10:48:32,891 INFO ]: Without dead ends: 287 [2018-06-22 10:48:32,891 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:32,891 INFO ]: Start minimizeSevpa. Operand 287 states. [2018-06-22 10:48:32,906 INFO ]: Finished minimizeSevpa. Reduced states from 287 to 259. [2018-06-22 10:48:32,906 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-22 10:48:32,909 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 335 transitions. [2018-06-22 10:48:32,909 INFO ]: Start accepts. Automaton has 259 states and 335 transitions. Word has length 97 [2018-06-22 10:48:32,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:32,909 INFO ]: Abstraction has 259 states and 335 transitions. [2018-06-22 10:48:32,909 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:32,909 INFO ]: Start isEmpty. Operand 259 states and 335 transitions. [2018-06-22 10:48:32,912 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:32,912 INFO ]: Found error trace [2018-06-22 10:48:32,912 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:32,912 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:32,912 INFO ]: Analyzing trace with hash 756734122, now seen corresponding path program 1 times [2018-06-22 10:48:32,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:32,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:32,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:32,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:32,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:32,928 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:33,070 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:33,070 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:33,070 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:48:33,070 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:48:33,070 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:48:33,070 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:33,070 INFO ]: Start difference. First operand 259 states and 335 transitions. Second operand 4 states. [2018-06-22 10:48:33,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:33,120 INFO ]: Finished difference Result 259 states and 334 transitions. [2018-06-22 10:48:33,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:48:33,125 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 10:48:33,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:33,128 INFO ]: With dead ends: 259 [2018-06-22 10:48:33,128 INFO ]: Without dead ends: 258 [2018-06-22 10:48:33,128 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:33,129 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-22 10:48:33,142 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-06-22 10:48:33,142 INFO ]: Start removeUnreachable. Operand 258 states. [2018-06-22 10:48:33,144 INFO ]: Finished removeUnreachable. Reduced from 258 states to 258 states and 332 transitions. [2018-06-22 10:48:33,144 INFO ]: Start accepts. Automaton has 258 states and 332 transitions. Word has length 97 [2018-06-22 10:48:33,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:33,144 INFO ]: Abstraction has 258 states and 332 transitions. [2018-06-22 10:48:33,144 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:48:33,144 INFO ]: Start isEmpty. Operand 258 states and 332 transitions. [2018-06-22 10:48:33,146 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:33,146 INFO ]: Found error trace [2018-06-22 10:48:33,146 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:33,146 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:33,147 INFO ]: Analyzing trace with hash -2092465521, now seen corresponding path program 1 times [2018-06-22 10:48:33,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:33,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:33,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:33,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:33,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:33,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:33,304 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:33,304 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:33,304 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:48:33,304 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:48:33,304 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:48:33,304 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:33,304 INFO ]: Start difference. First operand 258 states and 332 transitions. Second operand 4 states. [2018-06-22 10:48:33,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:33,316 INFO ]: Finished difference Result 258 states and 331 transitions. [2018-06-22 10:48:33,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:48:33,319 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 10:48:33,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:33,321 INFO ]: With dead ends: 258 [2018-06-22 10:48:33,321 INFO ]: Without dead ends: 257 [2018-06-22 10:48:33,322 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:33,322 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-22 10:48:33,334 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-06-22 10:48:33,334 INFO ]: Start removeUnreachable. Operand 257 states. [2018-06-22 10:48:33,336 INFO ]: Finished removeUnreachable. Reduced from 257 states to 257 states and 329 transitions. [2018-06-22 10:48:33,336 INFO ]: Start accepts. Automaton has 257 states and 329 transitions. Word has length 97 [2018-06-22 10:48:33,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:33,336 INFO ]: Abstraction has 257 states and 329 transitions. [2018-06-22 10:48:33,336 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:48:33,336 INFO ]: Start isEmpty. Operand 257 states and 329 transitions. [2018-06-22 10:48:33,338 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:33,338 INFO ]: Found error trace [2018-06-22 10:48:33,338 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:33,338 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:33,338 INFO ]: Analyzing trace with hash 1590916533, now seen corresponding path program 1 times [2018-06-22 10:48:33,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:33,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:33,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:33,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:33,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:33,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:33,632 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:48:33,879 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:33,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:33,879 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:33,879 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:33,879 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:33,879 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:33,879 INFO ]: Start difference. First operand 257 states and 329 transitions. Second operand 13 states. [2018-06-22 10:48:34,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:34,723 INFO ]: Finished difference Result 309 states and 392 transitions. [2018-06-22 10:48:34,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:34,723 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:34,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:34,725 INFO ]: With dead ends: 309 [2018-06-22 10:48:34,725 INFO ]: Without dead ends: 299 [2018-06-22 10:48:34,725 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:34,726 INFO ]: Start minimizeSevpa. Operand 299 states. [2018-06-22 10:48:34,739 INFO ]: Finished minimizeSevpa. Reduced states from 299 to 269. [2018-06-22 10:48:34,739 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-22 10:48:34,741 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 351 transitions. [2018-06-22 10:48:34,741 INFO ]: Start accepts. Automaton has 269 states and 351 transitions. Word has length 97 [2018-06-22 10:48:34,742 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:34,742 INFO ]: Abstraction has 269 states and 351 transitions. [2018-06-22 10:48:34,742 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:34,742 INFO ]: Start isEmpty. Operand 269 states and 351 transitions. [2018-06-22 10:48:34,743 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:34,743 INFO ]: Found error trace [2018-06-22 10:48:34,743 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:34,744 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:34,744 INFO ]: Analyzing trace with hash 197118359, now seen corresponding path program 1 times [2018-06-22 10:48:34,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:34,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:34,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:34,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:34,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:34,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:34,821 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:34,821 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:34,821 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:48:34,821 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:48:34,822 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:48:34,822 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:34,822 INFO ]: Start difference. First operand 269 states and 351 transitions. Second operand 4 states. [2018-06-22 10:48:34,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:34,837 INFO ]: Finished difference Result 277 states and 362 transitions. [2018-06-22 10:48:34,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:48:34,837 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 10:48:34,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:34,839 INFO ]: With dead ends: 277 [2018-06-22 10:48:34,839 INFO ]: Without dead ends: 274 [2018-06-22 10:48:34,839 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:34,840 INFO ]: Start minimizeSevpa. Operand 274 states. [2018-06-22 10:48:34,852 INFO ]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-06-22 10:48:34,852 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-22 10:48:34,854 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 342 transitions. [2018-06-22 10:48:34,854 INFO ]: Start accepts. Automaton has 266 states and 342 transitions. Word has length 97 [2018-06-22 10:48:34,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:34,854 INFO ]: Abstraction has 266 states and 342 transitions. [2018-06-22 10:48:34,854 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:48:34,854 INFO ]: Start isEmpty. Operand 266 states and 342 transitions. [2018-06-22 10:48:34,856 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:34,856 INFO ]: Found error trace [2018-06-22 10:48:34,856 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:34,856 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:34,856 INFO ]: Analyzing trace with hash 1678790671, now seen corresponding path program 1 times [2018-06-22 10:48:34,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:34,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:34,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:34,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:34,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:34,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:35,207 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:48:35,546 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:35,546 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:35,546 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:35,546 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:35,546 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:35,546 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:35,547 INFO ]: Start difference. First operand 266 states and 342 transitions. Second operand 13 states. [2018-06-22 10:48:36,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:36,637 INFO ]: Finished difference Result 319 states and 413 transitions. [2018-06-22 10:48:36,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:36,637 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:36,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:36,639 INFO ]: With dead ends: 319 [2018-06-22 10:48:36,639 INFO ]: Without dead ends: 309 [2018-06-22 10:48:36,639 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:36,639 INFO ]: Start minimizeSevpa. Operand 309 states. [2018-06-22 10:48:36,652 INFO ]: Finished minimizeSevpa. Reduced states from 309 to 285. [2018-06-22 10:48:36,652 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-22 10:48:36,654 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 378 transitions. [2018-06-22 10:48:36,654 INFO ]: Start accepts. Automaton has 285 states and 378 transitions. Word has length 97 [2018-06-22 10:48:36,654 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:36,654 INFO ]: Abstraction has 285 states and 378 transitions. [2018-06-22 10:48:36,654 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:36,654 INFO ]: Start isEmpty. Operand 285 states and 378 transitions. [2018-06-22 10:48:36,656 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:36,656 INFO ]: Found error trace [2018-06-22 10:48:36,656 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:36,656 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:36,656 INFO ]: Analyzing trace with hash -646201341, now seen corresponding path program 1 times [2018-06-22 10:48:36,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:36,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:36,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:36,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:36,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:36,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:36,799 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:36,799 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:36,799 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:48:36,800 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:48:36,800 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:48:36,800 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:36,800 INFO ]: Start difference. First operand 285 states and 378 transitions. Second operand 4 states. [2018-06-22 10:48:36,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:36,831 INFO ]: Finished difference Result 297 states and 387 transitions. [2018-06-22 10:48:36,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:48:36,831 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 10:48:36,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:36,833 INFO ]: With dead ends: 297 [2018-06-22 10:48:36,833 INFO ]: Without dead ends: 293 [2018-06-22 10:48:36,834 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:48:36,834 INFO ]: Start minimizeSevpa. Operand 293 states. [2018-06-22 10:48:36,844 INFO ]: Finished minimizeSevpa. Reduced states from 293 to 281. [2018-06-22 10:48:36,845 INFO ]: Start removeUnreachable. Operand 281 states. [2018-06-22 10:48:36,846 INFO ]: Finished removeUnreachable. Reduced from 281 states to 281 states and 363 transitions. [2018-06-22 10:48:36,846 INFO ]: Start accepts. Automaton has 281 states and 363 transitions. Word has length 97 [2018-06-22 10:48:36,846 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:36,846 INFO ]: Abstraction has 281 states and 363 transitions. [2018-06-22 10:48:36,846 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:48:36,846 INFO ]: Start isEmpty. Operand 281 states and 363 transitions. [2018-06-22 10:48:36,849 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:36,849 INFO ]: Found error trace [2018-06-22 10:48:36,849 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:36,849 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:36,849 INFO ]: Analyzing trace with hash -586962326, now seen corresponding path program 1 times [2018-06-22 10:48:36,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:36,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:36,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:36,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:36,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:36,861 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:37,173 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:37,173 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:37,173 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:37,174 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:37,175 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:37,175 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:37,175 INFO ]: Start difference. First operand 281 states and 363 transitions. Second operand 13 states. [2018-06-22 10:48:37,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:37,844 INFO ]: Finished difference Result 334 states and 427 transitions. [2018-06-22 10:48:37,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:37,844 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:37,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:37,846 INFO ]: With dead ends: 334 [2018-06-22 10:48:37,846 INFO ]: Without dead ends: 326 [2018-06-22 10:48:37,846 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:37,847 INFO ]: Start minimizeSevpa. Operand 326 states. [2018-06-22 10:48:37,864 INFO ]: Finished minimizeSevpa. Reduced states from 326 to 304. [2018-06-22 10:48:37,864 INFO ]: Start removeUnreachable. Operand 304 states. [2018-06-22 10:48:37,865 INFO ]: Finished removeUnreachable. Reduced from 304 states to 304 states and 396 transitions. [2018-06-22 10:48:37,865 INFO ]: Start accepts. Automaton has 304 states and 396 transitions. Word has length 97 [2018-06-22 10:48:37,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:37,866 INFO ]: Abstraction has 304 states and 396 transitions. [2018-06-22 10:48:37,866 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:37,866 INFO ]: Start isEmpty. Operand 304 states and 396 transitions. [2018-06-22 10:48:37,869 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:37,869 INFO ]: Found error trace [2018-06-22 10:48:37,869 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:37,869 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:37,869 INFO ]: Analyzing trace with hash 1060030258, now seen corresponding path program 1 times [2018-06-22 10:48:37,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:37,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:37,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:37,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:37,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:37,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:38,171 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:38,171 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:38,171 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:38,172 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:38,172 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:38,172 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:38,172 INFO ]: Start difference. First operand 304 states and 396 transitions. Second operand 13 states. [2018-06-22 10:48:38,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:38,362 INFO ]: Finished difference Result 352 states and 450 transitions. [2018-06-22 10:48:38,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:38,362 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:38,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:38,364 INFO ]: With dead ends: 352 [2018-06-22 10:48:38,364 INFO ]: Without dead ends: 342 [2018-06-22 10:48:38,364 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:38,365 INFO ]: Start minimizeSevpa. Operand 342 states. [2018-06-22 10:48:38,377 INFO ]: Finished minimizeSevpa. Reduced states from 342 to 314. [2018-06-22 10:48:38,377 INFO ]: Start removeUnreachable. Operand 314 states. [2018-06-22 10:48:38,380 INFO ]: Finished removeUnreachable. Reduced from 314 states to 314 states and 410 transitions. [2018-06-22 10:48:38,380 INFO ]: Start accepts. Automaton has 314 states and 410 transitions. Word has length 97 [2018-06-22 10:48:38,380 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:38,380 INFO ]: Abstraction has 314 states and 410 transitions. [2018-06-22 10:48:38,380 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:38,380 INFO ]: Start isEmpty. Operand 314 states and 410 transitions. [2018-06-22 10:48:38,382 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:38,382 INFO ]: Found error trace [2018-06-22 10:48:38,382 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:38,383 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:38,383 INFO ]: Analyzing trace with hash 1436126874, now seen corresponding path program 1 times [2018-06-22 10:48:38,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:38,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:38,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:38,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:38,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:38,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:38,686 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:48:38,762 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:38,762 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:38,762 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:38,762 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:38,762 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:38,762 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:38,763 INFO ]: Start difference. First operand 314 states and 410 transitions. Second operand 13 states. [2018-06-22 10:48:39,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:39,031 INFO ]: Finished difference Result 362 states and 459 transitions. [2018-06-22 10:48:39,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:39,031 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:39,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:39,033 INFO ]: With dead ends: 362 [2018-06-22 10:48:39,033 INFO ]: Without dead ends: 352 [2018-06-22 10:48:39,033 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:39,034 INFO ]: Start minimizeSevpa. Operand 352 states. [2018-06-22 10:48:39,045 INFO ]: Finished minimizeSevpa. Reduced states from 352 to 324. [2018-06-22 10:48:39,045 INFO ]: Start removeUnreachable. Operand 324 states. [2018-06-22 10:48:39,047 INFO ]: Finished removeUnreachable. Reduced from 324 states to 324 states and 420 transitions. [2018-06-22 10:48:39,047 INFO ]: Start accepts. Automaton has 324 states and 420 transitions. Word has length 97 [2018-06-22 10:48:39,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:39,047 INFO ]: Abstraction has 324 states and 420 transitions. [2018-06-22 10:48:39,047 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:39,047 INFO ]: Start isEmpty. Operand 324 states and 420 transitions. [2018-06-22 10:48:39,049 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:39,049 INFO ]: Found error trace [2018-06-22 10:48:39,049 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:39,049 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:39,049 INFO ]: Analyzing trace with hash 1833580330, now seen corresponding path program 1 times [2018-06-22 10:48:39,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:39,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:39,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:39,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:39,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:39,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:39,188 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:39,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:39,188 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:39,188 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:39,189 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:39,189 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:39,189 INFO ]: Start difference. First operand 324 states and 420 transitions. Second operand 13 states. [2018-06-22 10:48:39,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:39,436 INFO ]: Finished difference Result 366 states and 463 transitions. [2018-06-22 10:48:39,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:39,436 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:39,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:39,438 INFO ]: With dead ends: 366 [2018-06-22 10:48:39,438 INFO ]: Without dead ends: 353 [2018-06-22 10:48:39,438 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:39,438 INFO ]: Start minimizeSevpa. Operand 353 states. [2018-06-22 10:48:39,454 INFO ]: Finished minimizeSevpa. Reduced states from 353 to 323. [2018-06-22 10:48:39,454 INFO ]: Start removeUnreachable. Operand 323 states. [2018-06-22 10:48:39,455 INFO ]: Finished removeUnreachable. Reduced from 323 states to 323 states and 415 transitions. [2018-06-22 10:48:39,455 INFO ]: Start accepts. Automaton has 323 states and 415 transitions. Word has length 97 [2018-06-22 10:48:39,455 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:39,455 INFO ]: Abstraction has 323 states and 415 transitions. [2018-06-22 10:48:39,455 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:39,455 INFO ]: Start isEmpty. Operand 323 states and 415 transitions. [2018-06-22 10:48:39,457 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:39,457 INFO ]: Found error trace [2018-06-22 10:48:39,457 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:39,457 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:39,458 INFO ]: Analyzing trace with hash 2054887287, now seen corresponding path program 1 times [2018-06-22 10:48:39,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:39,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:39,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:39,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:39,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:39,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:39,761 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:39,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:39,761 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:39,761 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:39,761 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:39,761 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:39,761 INFO ]: Start difference. First operand 323 states and 415 transitions. Second operand 13 states. [2018-06-22 10:48:39,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:39,930 INFO ]: Finished difference Result 381 states and 482 transitions. [2018-06-22 10:48:39,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:39,930 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:39,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:39,932 INFO ]: With dead ends: 381 [2018-06-22 10:48:39,932 INFO ]: Without dead ends: 371 [2018-06-22 10:48:39,932 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:39,932 INFO ]: Start minimizeSevpa. Operand 371 states. [2018-06-22 10:48:39,944 INFO ]: Finished minimizeSevpa. Reduced states from 371 to 337. [2018-06-22 10:48:39,944 INFO ]: Start removeUnreachable. Operand 337 states. [2018-06-22 10:48:39,945 INFO ]: Finished removeUnreachable. Reduced from 337 states to 337 states and 437 transitions. [2018-06-22 10:48:39,945 INFO ]: Start accepts. Automaton has 337 states and 437 transitions. Word has length 97 [2018-06-22 10:48:39,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:39,945 INFO ]: Abstraction has 337 states and 437 transitions. [2018-06-22 10:48:39,945 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:39,946 INFO ]: Start isEmpty. Operand 337 states and 437 transitions. [2018-06-22 10:48:39,947 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:39,947 INFO ]: Found error trace [2018-06-22 10:48:39,947 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:39,947 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:39,948 INFO ]: Analyzing trace with hash 31798087, now seen corresponding path program 1 times [2018-06-22 10:48:39,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:39,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:39,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:39,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:39,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:39,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:40,081 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:40,081 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:40,081 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:40,081 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:40,082 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:40,082 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:40,082 INFO ]: Start difference. First operand 337 states and 437 transitions. Second operand 13 states. [2018-06-22 10:48:40,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:40,250 INFO ]: Finished difference Result 394 states and 506 transitions. [2018-06-22 10:48:40,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:40,250 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:40,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:40,252 INFO ]: With dead ends: 394 [2018-06-22 10:48:40,252 INFO ]: Without dead ends: 383 [2018-06-22 10:48:40,252 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:40,253 INFO ]: Start minimizeSevpa. Operand 383 states. [2018-06-22 10:48:40,265 INFO ]: Finished minimizeSevpa. Reduced states from 383 to 359. [2018-06-22 10:48:40,265 INFO ]: Start removeUnreachable. Operand 359 states. [2018-06-22 10:48:40,267 INFO ]: Finished removeUnreachable. Reduced from 359 states to 359 states and 459 transitions. [2018-06-22 10:48:40,267 INFO ]: Start accepts. Automaton has 359 states and 459 transitions. Word has length 97 [2018-06-22 10:48:40,267 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:40,267 INFO ]: Abstraction has 359 states and 459 transitions. [2018-06-22 10:48:40,267 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:40,267 INFO ]: Start isEmpty. Operand 359 states and 459 transitions. [2018-06-22 10:48:40,269 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:48:40,269 INFO ]: Found error trace [2018-06-22 10:48:40,269 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:40,269 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:40,270 INFO ]: Analyzing trace with hash -110024657, now seen corresponding path program 1 times [2018-06-22 10:48:40,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:40,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:40,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:40,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:40,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:40,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:40,482 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:40,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:40,483 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:48:40,483 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:48:40,483 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:48:40,483 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:40,483 INFO ]: Start difference. First operand 359 states and 459 transitions. Second operand 13 states. [2018-06-22 10:48:40,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:40,658 INFO ]: Finished difference Result 405 states and 506 transitions. [2018-06-22 10:48:40,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:48:40,658 INFO ]: Start accepts. Automaton has 13 states. Word has length 97 [2018-06-22 10:48:40,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:40,660 INFO ]: With dead ends: 405 [2018-06-22 10:48:40,660 INFO ]: Without dead ends: 392 [2018-06-22 10:48:40,661 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:48:40,661 INFO ]: Start minimizeSevpa. Operand 392 states. [2018-06-22 10:48:40,672 INFO ]: Finished minimizeSevpa. Reduced states from 392 to 356. [2018-06-22 10:48:40,673 INFO ]: Start removeUnreachable. Operand 356 states. [2018-06-22 10:48:40,674 INFO ]: Finished removeUnreachable. Reduced from 356 states to 356 states and 451 transitions. [2018-06-22 10:48:40,674 INFO ]: Start accepts. Automaton has 356 states and 451 transitions. Word has length 97 [2018-06-22 10:48:40,674 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:40,674 INFO ]: Abstraction has 356 states and 451 transitions. [2018-06-22 10:48:40,674 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:48:40,674 INFO ]: Start isEmpty. Operand 356 states and 451 transitions. [2018-06-22 10:48:40,676 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:48:40,676 INFO ]: Found error trace [2018-06-22 10:48:40,676 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:40,676 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:40,676 INFO ]: Analyzing trace with hash -750962084, now seen corresponding path program 1 times [2018-06-22 10:48:40,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:40,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:40,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:40,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:40,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:40,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:40,999 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:41,000 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:41,000 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:41,000 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:41,000 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:41,000 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:41,000 INFO ]: Start difference. First operand 356 states and 451 transitions. Second operand 14 states. [2018-06-22 10:48:41,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:41,217 INFO ]: Finished difference Result 420 states and 524 transitions. [2018-06-22 10:48:41,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:41,218 INFO ]: Start accepts. Automaton has 14 states. Word has length 101 [2018-06-22 10:48:41,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:41,220 INFO ]: With dead ends: 420 [2018-06-22 10:48:41,220 INFO ]: Without dead ends: 406 [2018-06-22 10:48:41,220 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 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:48:41,220 INFO ]: Start minimizeSevpa. Operand 406 states. [2018-06-22 10:48:41,233 INFO ]: Finished minimizeSevpa. Reduced states from 406 to 362. [2018-06-22 10:48:41,233 INFO ]: Start removeUnreachable. Operand 362 states. [2018-06-22 10:48:41,235 INFO ]: Finished removeUnreachable. Reduced from 362 states to 362 states and 465 transitions. [2018-06-22 10:48:41,235 INFO ]: Start accepts. Automaton has 362 states and 465 transitions. Word has length 101 [2018-06-22 10:48:41,235 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:41,235 INFO ]: Abstraction has 362 states and 465 transitions. [2018-06-22 10:48:41,235 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:41,235 INFO ]: Start isEmpty. Operand 362 states and 465 transitions. [2018-06-22 10:48:41,237 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:48:41,237 INFO ]: Found error trace [2018-06-22 10:48:41,237 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:41,237 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:41,237 INFO ]: Analyzing trace with hash 1172307961, now seen corresponding path program 1 times [2018-06-22 10:48:41,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:41,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:41,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:41,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:41,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:41,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:41,395 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:41,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:41,396 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:41,396 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:41,396 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:41,396 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:41,396 INFO ]: Start difference. First operand 362 states and 465 transitions. Second operand 14 states. [2018-06-22 10:48:41,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:41,723 INFO ]: Finished difference Result 424 states and 537 transitions. [2018-06-22 10:48:41,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:41,723 INFO ]: Start accepts. Automaton has 14 states. Word has length 101 [2018-06-22 10:48:41,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:41,724 INFO ]: With dead ends: 424 [2018-06-22 10:48:41,724 INFO ]: Without dead ends: 406 [2018-06-22 10:48:41,725 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:41,725 INFO ]: Start minimizeSevpa. Operand 406 states. [2018-06-22 10:48:41,737 INFO ]: Finished minimizeSevpa. Reduced states from 406 to 374. [2018-06-22 10:48:41,737 INFO ]: Start removeUnreachable. Operand 374 states. [2018-06-22 10:48:41,739 INFO ]: Finished removeUnreachable. Reduced from 374 states to 374 states and 478 transitions. [2018-06-22 10:48:41,739 INFO ]: Start accepts. Automaton has 374 states and 478 transitions. Word has length 101 [2018-06-22 10:48:41,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:41,739 INFO ]: Abstraction has 374 states and 478 transitions. [2018-06-22 10:48:41,739 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:41,739 INFO ]: Start isEmpty. Operand 374 states and 478 transitions. [2018-06-22 10:48:41,741 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:48:41,741 INFO ]: Found error trace [2018-06-22 10:48:41,741 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:41,741 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:41,741 INFO ]: Analyzing trace with hash 820030977, now seen corresponding path program 1 times [2018-06-22 10:48:41,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:41,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:41,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:41,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:41,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:41,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:41,877 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:41,877 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:41,877 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:41,877 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:41,877 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:41,877 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:41,877 INFO ]: Start difference. First operand 374 states and 478 transitions. Second operand 14 states. [2018-06-22 10:48:42,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:42,078 INFO ]: Finished difference Result 434 states and 539 transitions. [2018-06-22 10:48:42,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:42,078 INFO ]: Start accepts. Automaton has 14 states. Word has length 101 [2018-06-22 10:48:42,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:42,080 INFO ]: With dead ends: 434 [2018-06-22 10:48:42,080 INFO ]: Without dead ends: 418 [2018-06-22 10:48:42,080 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:42,080 INFO ]: Start minimizeSevpa. Operand 418 states. [2018-06-22 10:48:42,093 INFO ]: Finished minimizeSevpa. Reduced states from 418 to 380. [2018-06-22 10:48:42,093 INFO ]: Start removeUnreachable. Operand 380 states. [2018-06-22 10:48:42,094 INFO ]: Finished removeUnreachable. Reduced from 380 states to 380 states and 484 transitions. [2018-06-22 10:48:42,094 INFO ]: Start accepts. Automaton has 380 states and 484 transitions. Word has length 101 [2018-06-22 10:48:42,094 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:42,094 INFO ]: Abstraction has 380 states and 484 transitions. [2018-06-22 10:48:42,095 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:42,095 INFO ]: Start isEmpty. Operand 380 states and 484 transitions. [2018-06-22 10:48:42,096 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:48:42,096 INFO ]: Found error trace [2018-06-22 10:48:42,096 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:42,097 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:42,097 INFO ]: Analyzing trace with hash -1551666274, now seen corresponding path program 1 times [2018-06-22 10:48:42,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:42,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:42,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:42,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:42,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:42,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:42,217 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:42,217 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:42,217 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:48:42,217 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:48:42,217 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:48:42,217 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:42,217 INFO ]: Start difference. First operand 380 states and 484 transitions. Second operand 14 states. [2018-06-22 10:48:43,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:43,114 INFO ]: Finished difference Result 406 states and 512 transitions. [2018-06-22 10:48:43,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:48:43,116 INFO ]: Start accepts. Automaton has 14 states. Word has length 101 [2018-06-22 10:48:43,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:43,116 INFO ]: With dead ends: 406 [2018-06-22 10:48:43,116 INFO ]: Without dead ends: 0 [2018-06-22 10:48:43,116 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:48:43,116 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:48:43,116 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:48:43,116 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:48:43,116 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:48:43,116 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-06-22 10:48:43,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:43,116 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:48:43,116 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:48:43,116 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:48:43,116 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:48:43,121 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:43 BoogieIcfgContainer [2018-06-22 10:48:43,121 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:48:43,121 INFO ]: Toolchain (without parser) took 17369.74 ms. Allocated memory was 305.1 MB in the beginning and 505.9 MB in the end (delta: 200.8 MB). Free memory was 245.5 MB in the beginning and 444.8 MB in the end (delta: -199.3 MB). Peak memory consumption was 1.5 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:43,122 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:48:43,122 INFO ]: ChcToBoogie took 104.19 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 241.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:43,122 INFO ]: Boogie Preprocessor took 95.16 ms. Allocated memory is still 305.1 MB. Free memory is still 241.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:48:43,122 INFO ]: RCFGBuilder took 736.27 ms. Allocated memory is still 305.1 MB. Free memory was 241.5 MB in the beginning and 213.5 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:43,123 INFO ]: TraceAbstraction took 16414.04 ms. Allocated memory was 305.1 MB in the beginning and 505.9 MB in the end (delta: 200.8 MB). Free memory was 213.5 MB in the beginning and 444.8 MB in the end (delta: -231.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:48:43,124 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 104.19 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 241.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 95.16 ms. Allocated memory is still 305.1 MB. Free memory is still 241.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 736.27 ms. Allocated memory is still 305.1 MB. Free memory was 241.5 MB in the beginning and 213.5 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16414.04 ms. Allocated memory was 305.1 MB in the beginning and 505.9 MB in the end (delta: 200.8 MB). Free memory was 213.5 MB in the beginning and 444.8 MB in the end (delta: -231.2 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 125 locations, 1 error locations. SAFE Result, 16.3s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4065 SDtfs, 303 SDslu, 37569 SDs, 0 SdLazy, 6122 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=24, 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.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 478 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2345 NumberOfCodeBlocks, 2345 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 352320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 345/345 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/10.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-48-43-133.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/10.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-48-43-133.csv Received shutdown request...