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/07.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:47:48,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:47:48,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:47:48,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:47:48,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:47:48,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:47:48,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:47:48,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:47:48,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:47:48,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:47:48,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:47:48,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:47:48,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:47:48,855 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:47:48,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:47:48,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:47:48,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:47:48,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:47:48,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:47:48,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:47:48,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:47:48,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:47:48,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:47:48,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:47:48,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:47:48,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:47:48,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:47:48,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:47:48,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:47:48,883 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:47:48,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:47:48,884 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:47:48,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:47:48,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:47:48,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:47:48,889 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:47:48,908 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:47:48,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:47:48,908 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:47:48,909 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:47:48,910 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:47:48,913 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:47:48,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:47:48,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:47:48,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:47:48,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:47:48,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:47:48,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:47:48,915 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:47:48,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:47:48,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:47:48,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:47:48,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:47:48,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:47:48,916 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:47:48,918 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:47:48,919 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:47:48,963 INFO ]: Repository-Root is: /tmp [2018-06-22 10:47:48,977 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:47:48,981 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:47:48,982 INFO ]: Initializing SmtParser... [2018-06-22 10:47:48,983 INFO ]: SmtParser initialized [2018-06-22 10:47:48,983 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 [2018-06-22 10:47:48,985 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:47:49,077 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 unknown [2018-06-22 10:47:49,580 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/07.c.smt2 [2018-06-22 10:47:49,584 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:47:49,599 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:47:49,599 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:47:49,599 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:47:49,600 INFO ]: ChcToBoogie initialized [2018-06-22 10:47:49,603 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,664 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49 Unit [2018-06-22 10:47:49,664 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:47:49,665 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:47:49,665 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:47:49,665 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:47:49,687 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,687 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,701 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,701 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,716 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,718 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,725 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (1/1) ... [2018-06-22 10:47:49,729 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:47:49,729 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:47:49,729 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:47:49,729 INFO ]: RCFGBuilder initialized [2018-06-22 10:47:49,730 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (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:47:49,743 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure False [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure False [2018-06-22 10:47:49,743 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure h23 [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure h23 [2018-06-22 10:47:49,743 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure h22 [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure h22 [2018-06-22 10:47:49,743 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure h13 [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure h13 [2018-06-22 10:47:49,743 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure h12 [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure h12 [2018-06-22 10:47:49,743 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure h11 [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure h11 [2018-06-22 10:47:49,743 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:47:49,743 INFO ]: Found specification of procedure h8 [2018-06-22 10:47:49,743 INFO ]: Found implementation of procedure h8 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h7 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h7 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h6 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h6 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h5 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h5 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h4 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h4 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h3 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h3 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h2 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h2 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h1 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h1 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h21 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h21 [2018-06-22 10:47:49,744 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:47:49,744 INFO ]: Found specification of procedure h17 [2018-06-22 10:47:49,744 INFO ]: Found implementation of procedure h17 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h18 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h18 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h15 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h15 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h14 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h14 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h10 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h10 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h9 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h9 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h16 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h16 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h20 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h20 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h19 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h19 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure h24 [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure h24 [2018-06-22 10:47:49,745 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:47:49,745 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:47:49,745 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:47:50,477 INFO ]: Using library mode [2018-06-22 10:47:50,478 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:47:50 BoogieIcfgContainer [2018-06-22 10:47:50,478 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:47:50,479 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:47:50,479 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:47:50,482 INFO ]: TraceAbstraction initialized [2018-06-22 10:47:50,482 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:47:49" (1/3) ... [2018-06-22 10:47:50,483 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4583032e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:47:50, skipping insertion in model container [2018-06-22 10:47:50,483 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:47:49" (2/3) ... [2018-06-22 10:47:50,483 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4583032e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:47:50, skipping insertion in model container [2018-06-22 10:47:50,484 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:47:50" (3/3) ... [2018-06-22 10:47:50,485 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:47:50,500 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:47:50,509 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:47:50,545 INFO ]: Using default assertion order modulation [2018-06-22 10:47:50,546 INFO ]: Interprodecural is true [2018-06-22 10:47:50,546 INFO ]: Hoare is false [2018-06-22 10:47:50,546 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:47:50,546 INFO ]: Backedges is TWOTRACK [2018-06-22 10:47:50,546 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:47:50,546 INFO ]: Difference is false [2018-06-22 10:47:50,546 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:47:50,546 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:47:50,566 INFO ]: Start isEmpty. Operand 108 states. [2018-06-22 10:47:50,585 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:47:50,585 INFO ]: Found error trace [2018-06-22 10:47:50,586 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:47:50,586 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:50,590 INFO ]: Analyzing trace with hash -1666764073, now seen corresponding path program 1 times [2018-06-22 10:47:50,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:50,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:50,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:50,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:50,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:50,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:51,126 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-06-22 10:47:51,969 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:47:51,971 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:51,971 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:47:51,973 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:47:51,990 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:47:51,992 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:51,994 INFO ]: Start difference. First operand 108 states. Second operand 13 states. [2018-06-22 10:47:52,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:52,417 INFO ]: Finished difference Result 118 states and 126 transitions. [2018-06-22 10:47:52,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:47:52,419 INFO ]: Start accepts. Automaton has 13 states. Word has length 57 [2018-06-22 10:47:52,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:52,432 INFO ]: With dead ends: 118 [2018-06-22 10:47:52,433 INFO ]: Without dead ends: 118 [2018-06-22 10:47:52,435 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:47:52,452 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 10:47:52,498 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-06-22 10:47:52,499 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 10:47:52,505 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-06-22 10:47:52,506 INFO ]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 57 [2018-06-22 10:47:52,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:52,507 INFO ]: Abstraction has 118 states and 126 transitions. [2018-06-22 10:47:52,507 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:47:52,507 INFO ]: Start isEmpty. Operand 118 states and 126 transitions. [2018-06-22 10:47:52,510 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:47:52,510 INFO ]: Found error trace [2018-06-22 10:47:52,510 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:47:52,511 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:52,511 INFO ]: Analyzing trace with hash -877958156, now seen corresponding path program 1 times [2018-06-22 10:47:52,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:52,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:52,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:52,512 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:52,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:52,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:53,026 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:47:53,026 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:53,026 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:47:53,028 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:47:53,028 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:47:53,028 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:47:53,028 INFO ]: Start difference. First operand 118 states and 126 transitions. Second operand 14 states. [2018-06-22 10:47:53,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:53,565 INFO ]: Finished difference Result 118 states and 125 transitions. [2018-06-22 10:47:53,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:47:53,569 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:47:53,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:53,571 INFO ]: With dead ends: 118 [2018-06-22 10:47:53,571 INFO ]: Without dead ends: 110 [2018-06-22 10:47:53,572 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:47:53,572 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 10:47:53,606 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-06-22 10:47:53,606 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 10:47:53,609 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-06-22 10:47:53,609 INFO ]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 57 [2018-06-22 10:47:53,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:53,609 INFO ]: Abstraction has 110 states and 117 transitions. [2018-06-22 10:47:53,609 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:47:53,609 INFO ]: Start isEmpty. Operand 110 states and 117 transitions. [2018-06-22 10:47:53,612 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:47:53,613 INFO ]: Found error trace [2018-06-22 10:47:53,613 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:53,613 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:53,613 INFO ]: Analyzing trace with hash -1391092510, now seen corresponding path program 1 times [2018-06-22 10:47:53,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:53,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:53,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:53,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:53,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:53,663 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:54,507 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:47:54,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:54,507 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:47:54,508 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:47:54,508 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:47:54,508 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:47:54,508 INFO ]: Start difference. First operand 110 states and 117 transitions. Second operand 22 states. [2018-06-22 10:47:55,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:55,218 INFO ]: Finished difference Result 136 states and 146 transitions. [2018-06-22 10:47:55,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:47:55,222 INFO ]: Start accepts. Automaton has 22 states. Word has length 93 [2018-06-22 10:47:55,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:55,225 INFO ]: With dead ends: 136 [2018-06-22 10:47:55,225 INFO ]: Without dead ends: 136 [2018-06-22 10:47:55,225 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:47:55,226 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 10:47:55,238 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-22 10:47:55,238 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 10:47:55,240 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-06-22 10:47:55,240 INFO ]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 93 [2018-06-22 10:47:55,241 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:55,241 INFO ]: Abstraction has 136 states and 146 transitions. [2018-06-22 10:47:55,241 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:47:55,241 INFO ]: Start isEmpty. Operand 136 states and 146 transitions. [2018-06-22 10:47:55,243 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:47:55,243 INFO ]: Found error trace [2018-06-22 10:47:55,243 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:55,244 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:55,244 INFO ]: Analyzing trace with hash 835414911, now seen corresponding path program 1 times [2018-06-22 10:47:55,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:55,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:55,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:55,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:55,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:55,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:55,638 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:55,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:47:55,638 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:47:55,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:55,767 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:55,784 INFO ]: Computing forward predicates... [2018-06-22 10:47:57,233 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:47:57,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:47:57,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-06-22 10:47:57,262 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:47:57,263 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:47:57,263 INFO ]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:47:57,264 INFO ]: Start difference. First operand 136 states and 146 transitions. Second operand 42 states. [2018-06-22 10:47:58,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:58,249 INFO ]: Finished difference Result 162 states and 174 transitions. [2018-06-22 10:47:58,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:47:58,250 INFO ]: Start accepts. Automaton has 42 states. Word has length 93 [2018-06-22 10:47:58,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:58,253 INFO ]: With dead ends: 162 [2018-06-22 10:47:58,253 INFO ]: Without dead ends: 154 [2018-06-22 10:47:58,254 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=1781, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:47:58,254 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 10:47:58,270 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-06-22 10:47:58,270 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 10:47:58,276 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-06-22 10:47:58,276 INFO ]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 93 [2018-06-22 10:47:58,277 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:58,277 INFO ]: Abstraction has 154 states and 166 transitions. [2018-06-22 10:47:58,277 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:47:58,277 INFO ]: Start isEmpty. Operand 154 states and 166 transitions. [2018-06-22 10:47:58,278 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:47:58,278 INFO ]: Found error trace [2018-06-22 10:47:58,284 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:58,284 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:58,284 INFO ]: Analyzing trace with hash 1783061798, now seen corresponding path program 1 times [2018-06-22 10:47:58,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:58,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:58,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:58,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:58,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:58,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:47:58,787 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:47:58,787 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:47:58,787 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:47:58,787 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:47:58,787 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:47:58,788 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:47:58,788 INFO ]: Start difference. First operand 154 states and 166 transitions. Second operand 22 states. [2018-06-22 10:47:59,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:47:59,254 INFO ]: Finished difference Result 180 states and 195 transitions. [2018-06-22 10:47:59,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:47:59,255 INFO ]: Start accepts. Automaton has 22 states. Word has length 93 [2018-06-22 10:47:59,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:47:59,257 INFO ]: With dead ends: 180 [2018-06-22 10:47:59,258 INFO ]: Without dead ends: 180 [2018-06-22 10:47:59,258 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:47:59,258 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 10:47:59,274 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 172. [2018-06-22 10:47:59,274 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 10:47:59,276 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-06-22 10:47:59,276 INFO ]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 93 [2018-06-22 10:47:59,277 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:47:59,277 INFO ]: Abstraction has 172 states and 187 transitions. [2018-06-22 10:47:59,277 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:47:59,277 INFO ]: Start isEmpty. Operand 172 states and 187 transitions. [2018-06-22 10:47:59,279 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:47:59,279 INFO ]: Found error trace [2018-06-22 10:47:59,279 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:47:59,279 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:47:59,279 INFO ]: Analyzing trace with hash 252635401, now seen corresponding path program 1 times [2018-06-22 10:47:59,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:47:59,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:47:59,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:59,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:47:59,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:47:59,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:00,717 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:48:00,717 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:00,717 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:48:00,718 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:48:00,718 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:48:00,718 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:48:00,718 INFO ]: Start difference. First operand 172 states and 187 transitions. Second operand 22 states. [2018-06-22 10:48:01,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:01,153 INFO ]: Finished difference Result 198 states and 216 transitions. [2018-06-22 10:48:01,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:48:01,249 INFO ]: Start accepts. Automaton has 22 states. Word has length 93 [2018-06-22 10:48:01,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:01,251 INFO ]: With dead ends: 198 [2018-06-22 10:48:01,251 INFO ]: Without dead ends: 198 [2018-06-22 10:48:01,251 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:48:01,251 INFO ]: Start minimizeSevpa. Operand 198 states. [2018-06-22 10:48:01,270 INFO ]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-06-22 10:48:01,271 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-22 10:48:01,272 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 208 transitions. [2018-06-22 10:48:01,272 INFO ]: Start accepts. Automaton has 190 states and 208 transitions. Word has length 93 [2018-06-22 10:48:01,273 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:01,273 INFO ]: Abstraction has 190 states and 208 transitions. [2018-06-22 10:48:01,273 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:48:01,273 INFO ]: Start isEmpty. Operand 190 states and 208 transitions. [2018-06-22 10:48:01,275 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:48:01,275 INFO ]: Found error trace [2018-06-22 10:48:01,275 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:01,275 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:01,275 INFO ]: Analyzing trace with hash -1815824474, now seen corresponding path program 1 times [2018-06-22 10:48:01,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:01,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:01,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:01,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:01,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:01,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:01,793 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:48:01,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:48:01,794 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:48:01,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:01,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:01,932 INFO ]: Computing forward predicates... [2018-06-22 10:48:02,828 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:48:02,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:48:02,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-06-22 10:48:02,848 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:48:02,848 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:48:02,849 INFO ]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:48:02,849 INFO ]: Start difference. First operand 190 states and 208 transitions. Second operand 42 states. [2018-06-22 10:48:03,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:03,778 INFO ]: Finished difference Result 208 states and 226 transitions. [2018-06-22 10:48:03,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:48:03,778 INFO ]: Start accepts. Automaton has 42 states. Word has length 93 [2018-06-22 10:48:03,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:03,780 INFO ]: With dead ends: 208 [2018-06-22 10:48:03,780 INFO ]: Without dead ends: 200 [2018-06-22 10:48:03,781 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=1781, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:48:03,781 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-22 10:48:03,798 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-06-22 10:48:03,798 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 10:48:03,800 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2018-06-22 10:48:03,800 INFO ]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 93 [2018-06-22 10:48:03,800 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:03,800 INFO ]: Abstraction has 200 states and 218 transitions. [2018-06-22 10:48:03,800 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:48:03,800 INFO ]: Start isEmpty. Operand 200 states and 218 transitions. [2018-06-22 10:48:03,803 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:48:03,803 INFO ]: Found error trace [2018-06-22 10:48:03,803 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:03,803 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:03,803 INFO ]: Analyzing trace with hash -285398077, now seen corresponding path program 1 times [2018-06-22 10:48:03,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:03,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:03,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:03,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:03,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:03,824 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:04,351 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:48:04,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:48:04,351 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:48:04,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:04,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:04,477 INFO ]: Computing forward predicates... [2018-06-22 10:48:05,253 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:48:05,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:48:05,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-06-22 10:48:05,282 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:48:05,282 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:48:05,282 INFO ]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:48:05,283 INFO ]: Start difference. First operand 200 states and 218 transitions. Second operand 42 states. [2018-06-22 10:48:05,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:05,797 INFO ]: Finished difference Result 218 states and 236 transitions. [2018-06-22 10:48:05,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:48:05,798 INFO ]: Start accepts. Automaton has 42 states. Word has length 93 [2018-06-22 10:48:05,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:05,800 INFO ]: With dead ends: 218 [2018-06-22 10:48:05,800 INFO ]: Without dead ends: 210 [2018-06-22 10:48:05,801 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=1781, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:48:05,801 INFO ]: Start minimizeSevpa. Operand 210 states. [2018-06-22 10:48:05,812 INFO ]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-06-22 10:48:05,813 INFO ]: Start removeUnreachable. Operand 210 states. [2018-06-22 10:48:05,814 INFO ]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2018-06-22 10:48:05,815 INFO ]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 93 [2018-06-22 10:48:05,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:05,815 INFO ]: Abstraction has 210 states and 228 transitions. [2018-06-22 10:48:05,815 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:48:05,815 INFO ]: Start isEmpty. Operand 210 states and 228 transitions. [2018-06-22 10:48:05,817 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:05,817 INFO ]: Found error trace [2018-06-22 10:48:05,818 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:05,818 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:05,818 INFO ]: Analyzing trace with hash -251914792, now seen corresponding path program 2 times [2018-06-22 10:48:05,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:05,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:05,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:05,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:05,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:05,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:06,467 INFO ]: Checked inductivity of 50 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:48:06,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:48:06,467 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:48:06,474 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:48:06,595 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:48:06,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:06,608 INFO ]: Computing forward predicates... [2018-06-22 10:48:07,790 INFO ]: Checked inductivity of 50 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:48:07,810 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:48:07,810 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 59 [2018-06-22 10:48:07,811 INFO ]: Interpolant automaton has 59 states [2018-06-22 10:48:07,811 INFO ]: Constructing interpolant automaton starting with 59 interpolants. [2018-06-22 10:48:07,812 INFO ]: CoverageRelationStatistics Valid=143, Invalid=3279, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 10:48:07,812 INFO ]: Start difference. First operand 210 states and 228 transitions. Second operand 59 states. [2018-06-22 10:48:09,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:09,663 INFO ]: Finished difference Result 244 states and 263 transitions. [2018-06-22 10:48:09,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 10:48:09,664 INFO ]: Start accepts. Automaton has 59 states. Word has length 129 [2018-06-22 10:48:09,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:09,665 INFO ]: With dead ends: 244 [2018-06-22 10:48:09,665 INFO ]: Without dead ends: 228 [2018-06-22 10:48:09,667 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=299, Invalid=7011, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 10:48:09,668 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-22 10:48:09,684 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 200. [2018-06-22 10:48:09,684 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 10:48:09,686 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2018-06-22 10:48:09,686 INFO ]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 129 [2018-06-22 10:48:09,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:09,686 INFO ]: Abstraction has 200 states and 217 transitions. [2018-06-22 10:48:09,686 INFO ]: Interpolant automaton has 59 states. [2018-06-22 10:48:09,686 INFO ]: Start isEmpty. Operand 200 states and 217 transitions. [2018-06-22 10:48:09,688 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:09,688 INFO ]: Found error trace [2018-06-22 10:48:09,688 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:09,688 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:09,689 INFO ]: Analyzing trace with hash 1358627274, now seen corresponding path program 2 times [2018-06-22 10:48:09,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:09,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:09,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:09,689 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:48:09,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:09,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:10,375 INFO ]: Checked inductivity of 50 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:48:10,375 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:48:10,375 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:48:10,382 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:48:10,548 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:48:10,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:10,561 INFO ]: Computing forward predicates... [2018-06-22 10:48:11,997 INFO ]: Checked inductivity of 50 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:48:12,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:48:12,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 59 [2018-06-22 10:48:12,018 INFO ]: Interpolant automaton has 59 states [2018-06-22 10:48:12,018 INFO ]: Constructing interpolant automaton starting with 59 interpolants. [2018-06-22 10:48:12,019 INFO ]: CoverageRelationStatistics Valid=143, Invalid=3279, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 10:48:12,019 INFO ]: Start difference. First operand 200 states and 217 transitions. Second operand 59 states. [2018-06-22 10:48:12,396 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 10:48:13,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:13,732 INFO ]: Finished difference Result 234 states and 252 transitions. [2018-06-22 10:48:13,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 10:48:13,732 INFO ]: Start accepts. Automaton has 59 states. Word has length 129 [2018-06-22 10:48:13,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:13,734 INFO ]: With dead ends: 234 [2018-06-22 10:48:13,734 INFO ]: Without dead ends: 218 [2018-06-22 10:48:13,736 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=299, Invalid=7011, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 10:48:13,736 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-22 10:48:13,748 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 190. [2018-06-22 10:48:13,748 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-22 10:48:13,750 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2018-06-22 10:48:13,750 INFO ]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 129 [2018-06-22 10:48:13,750 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:13,750 INFO ]: Abstraction has 190 states and 206 transitions. [2018-06-22 10:48:13,750 INFO ]: Interpolant automaton has 59 states. [2018-06-22 10:48:13,750 INFO ]: Start isEmpty. Operand 190 states and 206 transitions. [2018-06-22 10:48:13,752 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:13,752 INFO ]: Found error trace [2018-06-22 10:48:13,752 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,752 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:13,753 INFO ]: Analyzing trace with hash 1489210900, now seen corresponding path program 1 times [2018-06-22 10:48:13,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:13,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:13,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:13,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:48:13,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:13,778 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:13,928 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:48:13,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:13,928 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:13,928 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:13,929 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:13,929 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:13,929 INFO ]: Start difference. First operand 190 states and 206 transitions. Second operand 12 states. [2018-06-22 10:48:14,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:14,104 INFO ]: Finished difference Result 276 states and 314 transitions. [2018-06-22 10:48:14,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:14,105 INFO ]: Start accepts. Automaton has 12 states. Word has length 129 [2018-06-22 10:48:14,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:14,107 INFO ]: With dead ends: 276 [2018-06-22 10:48:14,107 INFO ]: Without dead ends: 276 [2018-06-22 10:48:14,107 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:14,108 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-22 10:48:14,123 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 252. [2018-06-22 10:48:14,123 INFO ]: Start removeUnreachable. Operand 252 states. [2018-06-22 10:48:14,126 INFO ]: Finished removeUnreachable. Reduced from 252 states to 252 states and 288 transitions. [2018-06-22 10:48:14,126 INFO ]: Start accepts. Automaton has 252 states and 288 transitions. Word has length 129 [2018-06-22 10:48:14,127 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:14,127 INFO ]: Abstraction has 252 states and 288 transitions. [2018-06-22 10:48:14,127 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:14,127 INFO ]: Start isEmpty. Operand 252 states and 288 transitions. [2018-06-22 10:48:14,129 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:14,129 INFO ]: Found error trace [2018-06-22 10:48:14,129 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:14,129 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:14,129 INFO ]: Analyzing trace with hash -812093352, now seen corresponding path program 1 times [2018-06-22 10:48:14,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:14,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:14,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:14,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:14,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:14,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:14,375 INFO ]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 10:48:14,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:14,376 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:14,376 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:14,376 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:14,376 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:14,376 INFO ]: Start difference. First operand 252 states and 288 transitions. Second operand 12 states. [2018-06-22 10:48:14,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:14,510 INFO ]: Finished difference Result 252 states and 285 transitions. [2018-06-22 10:48:14,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:14,511 INFO ]: Start accepts. Automaton has 12 states. Word has length 129 [2018-06-22 10:48:14,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:14,512 INFO ]: With dead ends: 252 [2018-06-22 10:48:14,512 INFO ]: Without dead ends: 220 [2018-06-22 10:48:14,512 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:14,512 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-22 10:48:14,524 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 210. [2018-06-22 10:48:14,524 INFO ]: Start removeUnreachable. Operand 210 states. [2018-06-22 10:48:14,525 INFO ]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-06-22 10:48:14,525 INFO ]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 129 [2018-06-22 10:48:14,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:14,526 INFO ]: Abstraction has 210 states and 227 transitions. [2018-06-22 10:48:14,526 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:14,526 INFO ]: Start isEmpty. Operand 210 states and 227 transitions. [2018-06-22 10:48:14,527 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:14,527 INFO ]: Found error trace [2018-06-22 10:48:14,527 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,527 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:14,527 INFO ]: Analyzing trace with hash -1185005228, now seen corresponding path program 2 times [2018-06-22 10:48:14,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:14,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:14,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:14,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:14,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:14,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:14,702 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:48:14,702 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:14,703 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:14,703 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:14,703 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:14,703 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:14,703 INFO ]: Start difference. First operand 210 states and 227 transitions. Second operand 12 states. [2018-06-22 10:48:15,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:15,242 INFO ]: Finished difference Result 271 states and 304 transitions. [2018-06-22 10:48:15,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:15,242 INFO ]: Start accepts. Automaton has 12 states. Word has length 129 [2018-06-22 10:48:15,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:15,243 INFO ]: With dead ends: 271 [2018-06-22 10:48:15,243 INFO ]: Without dead ends: 232 [2018-06-22 10:48:15,243 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 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:15,243 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-22 10:48:15,254 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 222. [2018-06-22 10:48:15,254 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-22 10:48:15,256 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 248 transitions. [2018-06-22 10:48:15,256 INFO ]: Start accepts. Automaton has 222 states and 248 transitions. Word has length 129 [2018-06-22 10:48:15,256 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:15,256 INFO ]: Abstraction has 222 states and 248 transitions. [2018-06-22 10:48:15,256 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:15,256 INFO ]: Start isEmpty. Operand 222 states and 248 transitions. [2018-06-22 10:48:15,257 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:15,257 INFO ]: Found error trace [2018-06-22 10:48:15,257 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:48:15,258 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:15,258 INFO ]: Analyzing trace with hash 1699978066, now seen corresponding path program 2 times [2018-06-22 10:48:15,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:15,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:15,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:15,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:48:15,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:15,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:16,014 INFO ]: Checked inductivity of 50 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:48:16,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:48:16,014 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:48:16,020 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:48:16,162 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:48:16,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:16,172 INFO ]: Computing forward predicates... [2018-06-22 10:48:17,898 INFO ]: Checked inductivity of 50 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:48:17,918 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:48:17,918 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 59 [2018-06-22 10:48:17,919 INFO ]: Interpolant automaton has 59 states [2018-06-22 10:48:17,920 INFO ]: Constructing interpolant automaton starting with 59 interpolants. [2018-06-22 10:48:17,920 INFO ]: CoverageRelationStatistics Valid=143, Invalid=3279, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 10:48:17,920 INFO ]: Start difference. First operand 222 states and 248 transitions. Second operand 59 states. [2018-06-22 10:48:19,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:19,355 INFO ]: Finished difference Result 268 states and 294 transitions. [2018-06-22 10:48:19,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 10:48:19,355 INFO ]: Start accepts. Automaton has 59 states. Word has length 129 [2018-06-22 10:48:19,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:19,356 INFO ]: With dead ends: 268 [2018-06-22 10:48:19,356 INFO ]: Without dead ends: 252 [2018-06-22 10:48:19,358 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=299, Invalid=7011, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 10:48:19,358 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-22 10:48:19,368 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 192. [2018-06-22 10:48:19,368 INFO ]: Start removeUnreachable. Operand 192 states. [2018-06-22 10:48:19,369 INFO ]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2018-06-22 10:48:19,370 INFO ]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 129 [2018-06-22 10:48:19,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:19,370 INFO ]: Abstraction has 192 states and 216 transitions. [2018-06-22 10:48:19,370 INFO ]: Interpolant automaton has 59 states. [2018-06-22 10:48:19,370 INFO ]: Start isEmpty. Operand 192 states and 216 transitions. [2018-06-22 10:48:19,373 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:19,373 INFO ]: Found error trace [2018-06-22 10:48:19,373 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,373 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:19,373 INFO ]: Analyzing trace with hash -293684978, now seen corresponding path program 1 times [2018-06-22 10:48:19,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:19,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:19,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:19,377 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:48:19,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:19,396 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:20,680 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:48:20,680 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:20,680 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:20,681 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:20,681 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:20,681 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:20,681 INFO ]: Start difference. First operand 192 states and 216 transitions. Second operand 12 states. [2018-06-22 10:48:21,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:21,049 INFO ]: Finished difference Result 217 states and 237 transitions. [2018-06-22 10:48:21,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:21,050 INFO ]: Start accepts. Automaton has 12 states. Word has length 129 [2018-06-22 10:48:21,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:21,052 INFO ]: With dead ends: 217 [2018-06-22 10:48:21,052 INFO ]: Without dead ends: 164 [2018-06-22 10:48:21,052 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:21,052 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 10:48:21,060 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 140. [2018-06-22 10:48:21,060 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 10:48:21,061 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-06-22 10:48:21,061 INFO ]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 129 [2018-06-22 10:48:21,062 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:21,062 INFO ]: Abstraction has 140 states and 148 transitions. [2018-06-22 10:48:21,062 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:21,062 INFO ]: Start isEmpty. Operand 140 states and 148 transitions. [2018-06-22 10:48:21,063 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:48:21,063 INFO ]: Found error trace [2018-06-22 10:48:21,063 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,063 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:48:21,063 INFO ]: Analyzing trace with hash -1343930383, now seen corresponding path program 1 times [2018-06-22 10:48:21,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:48:21,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:48:21,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:21,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:48:21,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:48:21,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:48:21,283 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:48:22,046 INFO ]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:48:22,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:48:22,127 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:48:22,127 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:48:22,127 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:48:22,127 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:22,128 INFO ]: Start difference. First operand 140 states and 148 transitions. Second operand 12 states. [2018-06-22 10:48:22,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:48:22,261 INFO ]: Finished difference Result 118 states and 124 transitions. [2018-06-22 10:48:22,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:48:22,262 INFO ]: Start accepts. Automaton has 12 states. Word has length 129 [2018-06-22 10:48:22,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:48:22,262 INFO ]: With dead ends: 118 [2018-06-22 10:48:22,262 INFO ]: Without dead ends: 0 [2018-06-22 10:48:22,262 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:48:22,262 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:48:22,262 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:48:22,262 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:48:22,262 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:48:22,263 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2018-06-22 10:48:22,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:48:22,263 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:48:22,263 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:48:22,263 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:48:22,263 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:48:22,266 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:22 BoogieIcfgContainer [2018-06-22 10:48:22,267 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:48:22,267 INFO ]: Toolchain (without parser) took 32682.49 ms. Allocated memory was 306.7 MB in the beginning and 680.5 MB in the end (delta: 373.8 MB). Free memory was 240.1 MB in the beginning and 218.8 MB in the end (delta: 21.3 MB). Peak memory consumption was 395.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:22,268 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:48:22,268 INFO ]: ChcToBoogie took 65.38 ms. Allocated memory is still 306.7 MB. Free memory was 240.1 MB in the beginning and 238.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:22,269 INFO ]: Boogie Preprocessor took 63.75 ms. Allocated memory is still 306.7 MB. Free memory was 238.1 MB in the beginning and 236.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:22,269 INFO ]: RCFGBuilder took 748.41 ms. Allocated memory is still 306.7 MB. Free memory was 236.1 MB in the beginning and 207.0 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:22,269 INFO ]: TraceAbstraction took 31787.56 ms. Allocated memory was 306.7 MB in the beginning and 680.5 MB in the end (delta: 373.8 MB). Free memory was 206.0 MB in the beginning and 218.8 MB in the end (delta: -12.8 MB). Peak memory consumption was 361.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:48:22,272 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.38 ms. Allocated memory is still 306.7 MB. Free memory was 240.1 MB in the beginning and 238.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 63.75 ms. Allocated memory is still 306.7 MB. Free memory was 238.1 MB in the beginning and 236.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 748.41 ms. Allocated memory is still 306.7 MB. Free memory was 236.1 MB in the beginning and 207.0 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 31787.56 ms. Allocated memory was 306.7 MB in the beginning and 680.5 MB in the end (delta: 373.8 MB). Free memory was 206.0 MB in the beginning and 218.8 MB in the end (delta: -12.8 MB). Peak memory consumption was 361.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 108 locations, 1 error locations. SAFE Result, 31.7s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1751 SDtfs, 119 SDslu, 35970 SDs, 0 SdLazy, 9023 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 566 SyntacticMatches, 4 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4901 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=11, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 200 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 2370 NumberOfCodeBlocks, 2370 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2348 ConstructedInterpolants, 0 QuantifiedInterpolants, 897936 SizeOfPredicates, 45 NumberOfNonLiveVariables, 6096 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 398/572 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/07.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-48-22-394.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/07.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-48-22-394.csv Received shutdown request...