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/26.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:52:26,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:52:26,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:52:26,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:52:26,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:52:26,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:52:26,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:52:26,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:52:26,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:52:26,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:52:26,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:52:26,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:52:26,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:52:26,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:52:26,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:52:26,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:52:26,628 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:52:26,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:52:26,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:52:26,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:52:26,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:52:26,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:52:26,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:52:26,639 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:52:26,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:52:26,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:52:26,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:52:26,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:52:26,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:52:26,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:52:26,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:52:26,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:52:26,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:52:26,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:52:26,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:52:26,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:52:26,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:52:26,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:52:26,660 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:52:26,661 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:52:26,661 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:52:26,662 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:52:26,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:52:26,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:52:26,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:52:26,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:52:26,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:52:26,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:52:26,663 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:52:26,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:52:26,663 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:52:26,664 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:52:26,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:52:26,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:52:26,664 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:52:26,665 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:52:26,665 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:52:26,699 INFO ]: Repository-Root is: /tmp [2018-06-22 10:52:26,713 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:52:26,718 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:52:26,720 INFO ]: Initializing SmtParser... [2018-06-22 10:52:26,720 INFO ]: SmtParser initialized [2018-06-22 10:52:26,721 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/26.c.smt2 [2018-06-22 10:52:26,722 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 10:52:26,810 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/26.c.smt2 unknown [2018-06-22 10:52:27,486 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/26.c.smt2 [2018-06-22 10:52:27,490 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:52:27,501 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:52:27,502 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:52:27,502 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:52:27,502 INFO ]: ChcToBoogie initialized [2018-06-22 10:52:27,514 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,607 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27 Unit [2018-06-22 10:52:27,607 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:52:27,608 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:52:27,608 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:52:27,608 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:52:27,633 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,633 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,650 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,650 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,664 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,666 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,670 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... [2018-06-22 10:52:27,678 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:52:27,679 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:52:27,679 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:52:27,679 INFO ]: RCFGBuilder initialized [2018-06-22 10:52:27,680 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:52:27,691 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:52:27,691 INFO ]: Found specification of procedure False [2018-06-22 10:52:27,691 INFO ]: Found implementation of procedure False [2018-06-22 10:52:27,691 INFO ]: Specification and implementation of procedure h49 given in one single declaration [2018-06-22 10:52:27,691 INFO ]: Found specification of procedure h49 [2018-06-22 10:52:27,691 INFO ]: Found implementation of procedure h49 [2018-06-22 10:52:27,691 INFO ]: Specification and implementation of procedure h47 given in one single declaration [2018-06-22 10:52:27,691 INFO ]: Found specification of procedure h47 [2018-06-22 10:52:27,691 INFO ]: Found implementation of procedure h47 [2018-06-22 10:52:27,691 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:52:27,691 INFO ]: Found specification of procedure h14 [2018-06-22 10:52:27,691 INFO ]: Found implementation of procedure h14 [2018-06-22 10:52:27,691 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:52:27,691 INFO ]: Found specification of procedure h13 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h13 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h12 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h12 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h8 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h8 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h7 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h7 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h6 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h6 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h5 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h5 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h4 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h4 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h3 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h3 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h2 [2018-06-22 10:52:27,692 INFO ]: Found implementation of procedure h2 [2018-06-22 10:52:27,692 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:52:27,692 INFO ]: Found specification of procedure h1 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h1 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h46 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h46 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h46 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h45 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h45 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h45 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h44 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h44 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h44 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h40 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h40 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h40 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h39 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h39 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h39 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h38 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h38 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h37 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h37 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h42 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h42 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h42 [2018-06-22 10:52:27,693 INFO ]: Specification and implementation of procedure h43 given in one single declaration [2018-06-22 10:52:27,693 INFO ]: Found specification of procedure h43 [2018-06-22 10:52:27,693 INFO ]: Found implementation of procedure h43 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h41 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h41 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h41 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h36 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h36 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h35 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h35 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h35 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h25 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h25 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h24 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h24 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h23 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h23 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h19 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h19 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h18 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h18 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h17 [2018-06-22 10:52:27,694 INFO ]: Found implementation of procedure h17 [2018-06-22 10:52:27,694 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:52:27,694 INFO ]: Found specification of procedure h16 [2018-06-22 10:52:27,695 INFO ]: Found implementation of procedure h16 [2018-06-22 10:52:27,695 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:52:27,695 INFO ]: Found specification of procedure h32 [2018-06-22 10:52:27,695 INFO ]: Found implementation of procedure h32 [2018-06-22 10:52:27,696 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:52:27,696 INFO ]: Found specification of procedure h31 [2018-06-22 10:52:27,696 INFO ]: Found implementation of procedure h31 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h29 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h29 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h30 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h30 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h21 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h21 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h22 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h22 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h20 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h20 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h27 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h27 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h26 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h26 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h28 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h28 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h15 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h15 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:52:27,697 INFO ]: Found specification of procedure h10 [2018-06-22 10:52:27,697 INFO ]: Found implementation of procedure h10 [2018-06-22 10:52:27,697 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:52:27,698 INFO ]: Found specification of procedure h9 [2018-06-22 10:52:27,698 INFO ]: Found implementation of procedure h9 [2018-06-22 10:52:27,698 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:52:27,698 INFO ]: Found specification of procedure h11 [2018-06-22 10:52:27,698 INFO ]: Found implementation of procedure h11 [2018-06-22 10:52:27,698 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:52:27,698 INFO ]: Found specification of procedure h33 [2018-06-22 10:52:27,698 INFO ]: Found implementation of procedure h33 [2018-06-22 10:52:27,698 INFO ]: Specification and implementation of procedure h34 given in one single declaration [2018-06-22 10:52:27,698 INFO ]: Found specification of procedure h34 [2018-06-22 10:52:27,698 INFO ]: Found implementation of procedure h34 [2018-06-22 10:52:27,698 INFO ]: Specification and implementation of procedure h48 given in one single declaration [2018-06-22 10:52:27,698 INFO ]: Found specification of procedure h48 [2018-06-22 10:52:27,698 INFO ]: Found implementation of procedure h48 [2018-06-22 10:52:27,698 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:52:27,698 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:52:27,698 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:52:28,859 INFO ]: Using library mode [2018-06-22 10:52:28,860 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:52:28 BoogieIcfgContainer [2018-06-22 10:52:28,860 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:52:28,864 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:52:28,864 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:52:28,868 INFO ]: TraceAbstraction initialized [2018-06-22 10:52:28,869 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:52:27" (1/3) ... [2018-06-22 10:52:28,869 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7a3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:52:28, skipping insertion in model container [2018-06-22 10:52:28,870 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:27" (2/3) ... [2018-06-22 10:52:28,870 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7a3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:52:28, skipping insertion in model container [2018-06-22 10:52:28,870 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:52:28" (3/3) ... [2018-06-22 10:52:28,871 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:52:28,882 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:52:28,895 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:52:28,946 INFO ]: Using default assertion order modulation [2018-06-22 10:52:28,947 INFO ]: Interprodecural is true [2018-06-22 10:52:28,947 INFO ]: Hoare is false [2018-06-22 10:52:28,947 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:52:28,947 INFO ]: Backedges is TWOTRACK [2018-06-22 10:52:28,947 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:52:28,947 INFO ]: Difference is false [2018-06-22 10:52:28,947 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:52:28,947 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:52:28,982 INFO ]: Start isEmpty. Operand 215 states. [2018-06-22 10:52:29,009 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:52:29,009 INFO ]: Found error trace [2018-06-22 10:52:29,010 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:29,010 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:29,015 INFO ]: Analyzing trace with hash -565596343, now seen corresponding path program 1 times [2018-06-22 10:52:29,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:29,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:29,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:29,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:29,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:29,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:29,487 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-06-22 10:52:29,858 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:52:29,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:29,861 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:52:29,864 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:52:29,878 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:52:29,879 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:29,883 INFO ]: Start difference. First operand 215 states. Second operand 14 states. [2018-06-22 10:52:30,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:30,673 INFO ]: Finished difference Result 229 states and 252 transitions. [2018-06-22 10:52:30,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:52:30,674 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:52:30,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:30,689 INFO ]: With dead ends: 229 [2018-06-22 10:52:30,689 INFO ]: Without dead ends: 229 [2018-06-22 10:52:30,691 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:30,705 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-22 10:52:30,752 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-06-22 10:52:30,753 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-22 10:52:30,760 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 252 transitions. [2018-06-22 10:52:30,765 INFO ]: Start accepts. Automaton has 229 states and 252 transitions. Word has length 57 [2018-06-22 10:52:30,766 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:30,766 INFO ]: Abstraction has 229 states and 252 transitions. [2018-06-22 10:52:30,766 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:52:30,766 INFO ]: Start isEmpty. Operand 229 states and 252 transitions. [2018-06-22 10:52:30,773 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:52:30,773 INFO ]: Found error trace [2018-06-22 10:52:30,773 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:30,773 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:30,774 INFO ]: Analyzing trace with hash -1594748474, now seen corresponding path program 1 times [2018-06-22 10:52:30,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:30,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:30,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:30,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:30,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:30,825 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:31,038 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-06-22 10:52:31,585 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:52:31,585 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:31,585 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:52:31,587 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:52:31,587 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:52:31,587 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:31,587 INFO ]: Start difference. First operand 229 states and 252 transitions. Second operand 14 states. [2018-06-22 10:52:31,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:31,867 INFO ]: Finished difference Result 229 states and 251 transitions. [2018-06-22 10:52:31,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:52:31,868 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:52:31,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:31,873 INFO ]: With dead ends: 229 [2018-06-22 10:52:31,873 INFO ]: Without dead ends: 221 [2018-06-22 10:52:31,874 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:31,875 INFO ]: Start minimizeSevpa. Operand 221 states. [2018-06-22 10:52:31,892 INFO ]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-06-22 10:52:31,892 INFO ]: Start removeUnreachable. Operand 221 states. [2018-06-22 10:52:31,895 INFO ]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2018-06-22 10:52:31,896 INFO ]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 57 [2018-06-22 10:52:31,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:31,896 INFO ]: Abstraction has 221 states and 243 transitions. [2018-06-22 10:52:31,896 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:52:31,896 INFO ]: Start isEmpty. Operand 221 states and 243 transitions. [2018-06-22 10:52:31,902 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 10:52:31,902 INFO ]: Found error trace [2018-06-22 10:52:31,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:31,903 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:31,903 INFO ]: Analyzing trace with hash -1699639348, now seen corresponding path program 1 times [2018-06-22 10:52:31,903 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:31,903 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:31,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:31,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:31,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:31,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:32,397 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:32,397 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:32,397 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-06-22 10:52:32,398 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:52:32,398 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:52:32,398 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:52:32,398 INFO ]: Start difference. First operand 221 states and 243 transitions. Second operand 26 states. [2018-06-22 10:52:33,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:33,901 INFO ]: Finished difference Result 324 states and 383 transitions. [2018-06-22 10:52:33,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:52:33,902 INFO ]: Start accepts. Automaton has 26 states. Word has length 149 [2018-06-22 10:52:33,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:33,907 INFO ]: With dead ends: 324 [2018-06-22 10:52:33,907 INFO ]: Without dead ends: 324 [2018-06-22 10:52:33,907 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:52:33,908 INFO ]: Start minimizeSevpa. Operand 324 states. [2018-06-22 10:52:33,948 INFO ]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-06-22 10:52:33,949 INFO ]: Start removeUnreachable. Operand 322 states. [2018-06-22 10:52:33,957 INFO ]: Finished removeUnreachable. Reduced from 322 states to 322 states and 380 transitions. [2018-06-22 10:52:33,957 INFO ]: Start accepts. Automaton has 322 states and 380 transitions. Word has length 149 [2018-06-22 10:52:33,958 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:33,958 INFO ]: Abstraction has 322 states and 380 transitions. [2018-06-22 10:52:33,959 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:52:33,959 INFO ]: Start isEmpty. Operand 322 states and 380 transitions. [2018-06-22 10:52:33,968 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 10:52:33,968 INFO ]: Found error trace [2018-06-22 10:52:33,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:33,968 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:33,968 INFO ]: Analyzing trace with hash 759402121, now seen corresponding path program 1 times [2018-06-22 10:52:33,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:33,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:33,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:33,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:33,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:34,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:34,820 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:34,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:34,820 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-06-22 10:52:34,821 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:52:34,821 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:52:34,821 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:52:34,821 INFO ]: Start difference. First operand 322 states and 380 transitions. Second operand 26 states. [2018-06-22 10:52:36,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:36,241 INFO ]: Finished difference Result 465 states and 580 transitions. [2018-06-22 10:52:36,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:52:36,241 INFO ]: Start accepts. Automaton has 26 states. Word has length 149 [2018-06-22 10:52:36,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:36,247 INFO ]: With dead ends: 465 [2018-06-22 10:52:36,247 INFO ]: Without dead ends: 456 [2018-06-22 10:52:36,247 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:52:36,248 INFO ]: Start minimizeSevpa. Operand 456 states. [2018-06-22 10:52:36,282 INFO ]: Finished minimizeSevpa. Reduced states from 456 to 438. [2018-06-22 10:52:36,282 INFO ]: Start removeUnreachable. Operand 438 states. [2018-06-22 10:52:36,288 INFO ]: Finished removeUnreachable. Reduced from 438 states to 438 states and 537 transitions. [2018-06-22 10:52:36,288 INFO ]: Start accepts. Automaton has 438 states and 537 transitions. Word has length 149 [2018-06-22 10:52:36,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:36,289 INFO ]: Abstraction has 438 states and 537 transitions. [2018-06-22 10:52:36,289 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:52:36,289 INFO ]: Start isEmpty. Operand 438 states and 537 transitions. [2018-06-22 10:52:36,298 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 10:52:36,298 INFO ]: Found error trace [2018-06-22 10:52:36,298 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:36,298 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:36,298 INFO ]: Analyzing trace with hash 1546645079, now seen corresponding path program 1 times [2018-06-22 10:52:36,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:36,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:36,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:36,301 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:36,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:36,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:36,552 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:36,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:36,552 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 10:52:36,553 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:52:36,553 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:52:36,553 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:52:36,553 INFO ]: Start difference. First operand 438 states and 537 transitions. Second operand 9 states. [2018-06-22 10:52:36,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:36,640 INFO ]: Finished difference Result 477 states and 593 transitions. [2018-06-22 10:52:36,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:52:36,642 INFO ]: Start accepts. Automaton has 9 states. Word has length 173 [2018-06-22 10:52:36,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:36,647 INFO ]: With dead ends: 477 [2018-06-22 10:52:36,647 INFO ]: Without dead ends: 477 [2018-06-22 10:52:36,647 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:52:36,647 INFO ]: Start minimizeSevpa. Operand 477 states. [2018-06-22 10:52:36,674 INFO ]: Finished minimizeSevpa. Reduced states from 477 to 467. [2018-06-22 10:52:36,674 INFO ]: Start removeUnreachable. Operand 467 states. [2018-06-22 10:52:36,678 INFO ]: Finished removeUnreachable. Reduced from 467 states to 467 states and 574 transitions. [2018-06-22 10:52:36,679 INFO ]: Start accepts. Automaton has 467 states and 574 transitions. Word has length 173 [2018-06-22 10:52:36,679 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:36,679 INFO ]: Abstraction has 467 states and 574 transitions. [2018-06-22 10:52:36,679 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:52:36,679 INFO ]: Start isEmpty. Operand 467 states and 574 transitions. [2018-06-22 10:52:36,684 INFO ]: Finished isEmpty. Found accepting run of length 174 [2018-06-22 10:52:36,684 INFO ]: Found error trace [2018-06-22 10:52:36,684 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:36,684 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:36,684 INFO ]: Analyzing trace with hash 28825786, now seen corresponding path program 1 times [2018-06-22 10:52:36,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:36,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:36,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:36,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:36,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:36,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:36,866 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:36,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:36,866 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 10:52:36,867 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:52:36,867 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:52:36,867 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:52:36,867 INFO ]: Start difference. First operand 467 states and 574 transitions. Second operand 9 states. [2018-06-22 10:52:36,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:36,970 INFO ]: Finished difference Result 514 states and 639 transitions. [2018-06-22 10:52:36,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:52:36,970 INFO ]: Start accepts. Automaton has 9 states. Word has length 173 [2018-06-22 10:52:36,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:36,974 INFO ]: With dead ends: 514 [2018-06-22 10:52:36,974 INFO ]: Without dead ends: 422 [2018-06-22 10:52:36,974 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:52:36,974 INFO ]: Start minimizeSevpa. Operand 422 states. [2018-06-22 10:52:36,996 INFO ]: Finished minimizeSevpa. Reduced states from 422 to 422. [2018-06-22 10:52:36,996 INFO ]: Start removeUnreachable. Operand 422 states. [2018-06-22 10:52:36,999 INFO ]: Finished removeUnreachable. Reduced from 422 states to 422 states and 491 transitions. [2018-06-22 10:52:36,999 INFO ]: Start accepts. Automaton has 422 states and 491 transitions. Word has length 173 [2018-06-22 10:52:36,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:36,999 INFO ]: Abstraction has 422 states and 491 transitions. [2018-06-22 10:52:36,999 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:52:36,999 INFO ]: Start isEmpty. Operand 422 states and 491 transitions. [2018-06-22 10:52:37,003 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:37,003 INFO ]: Found error trace [2018-06-22 10:52:37,004 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:37,004 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:37,004 INFO ]: Analyzing trace with hash 925310211, now seen corresponding path program 1 times [2018-06-22 10:52:37,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:37,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:37,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:37,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:37,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:37,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:37,806 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:37,806 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:37,806 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:37,806 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:37,806 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:37,806 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:37,807 INFO ]: Start difference. First operand 422 states and 491 transitions. Second operand 12 states. [2018-06-22 10:52:38,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:38,451 INFO ]: Finished difference Result 477 states and 577 transitions. [2018-06-22 10:52:38,452 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:38,452 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:38,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:38,456 INFO ]: With dead ends: 477 [2018-06-22 10:52:38,456 INFO ]: Without dead ends: 477 [2018-06-22 10:52:38,456 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:38,456 INFO ]: Start minimizeSevpa. Operand 477 states. [2018-06-22 10:52:38,477 INFO ]: Finished minimizeSevpa. Reduced states from 477 to 467. [2018-06-22 10:52:38,477 INFO ]: Start removeUnreachable. Operand 467 states. [2018-06-22 10:52:38,484 INFO ]: Finished removeUnreachable. Reduced from 467 states to 467 states and 558 transitions. [2018-06-22 10:52:38,484 INFO ]: Start accepts. Automaton has 467 states and 558 transitions. Word has length 185 [2018-06-22 10:52:38,485 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:38,485 INFO ]: Abstraction has 467 states and 558 transitions. [2018-06-22 10:52:38,485 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:38,485 INFO ]: Start isEmpty. Operand 467 states and 558 transitions. [2018-06-22 10:52:38,492 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:38,492 INFO ]: Found error trace [2018-06-22 10:52:38,492 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:38,492 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:38,493 INFO ]: Analyzing trace with hash -791947263, now seen corresponding path program 1 times [2018-06-22 10:52:38,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:38,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:38,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:38,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:38,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:38,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:38,778 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:38,778 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:38,778 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:38,779 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:38,779 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:38,779 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:38,779 INFO ]: Start difference. First operand 467 states and 558 transitions. Second operand 12 states. [2018-06-22 10:52:39,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:39,591 INFO ]: Finished difference Result 534 states and 661 transitions. [2018-06-22 10:52:39,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:39,592 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:39,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:39,595 INFO ]: With dead ends: 534 [2018-06-22 10:52:39,595 INFO ]: Without dead ends: 533 [2018-06-22 10:52:39,596 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:52:39,596 INFO ]: Start minimizeSevpa. Operand 533 states. [2018-06-22 10:52:39,617 INFO ]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-06-22 10:52:39,617 INFO ]: Start removeUnreachable. Operand 507 states. [2018-06-22 10:52:39,620 INFO ]: Finished removeUnreachable. Reduced from 507 states to 507 states and 606 transitions. [2018-06-22 10:52:39,620 INFO ]: Start accepts. Automaton has 507 states and 606 transitions. Word has length 185 [2018-06-22 10:52:39,620 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:39,620 INFO ]: Abstraction has 507 states and 606 transitions. [2018-06-22 10:52:39,620 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:39,620 INFO ]: Start isEmpty. Operand 507 states and 606 transitions. [2018-06-22 10:52:39,623 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:39,623 INFO ]: Found error trace [2018-06-22 10:52:39,624 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:39,624 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:39,625 INFO ]: Analyzing trace with hash -372597026, now seen corresponding path program 1 times [2018-06-22 10:52:39,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:39,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:39,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:39,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:39,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:39,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:40,564 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:40,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:40,564 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:40,565 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:40,565 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:40,565 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:40,565 INFO ]: Start difference. First operand 507 states and 606 transitions. Second operand 12 states. [2018-06-22 10:52:41,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:41,342 INFO ]: Finished difference Result 573 states and 669 transitions. [2018-06-22 10:52:41,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:41,342 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:41,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:41,345 INFO ]: With dead ends: 573 [2018-06-22 10:52:41,345 INFO ]: Without dead ends: 547 [2018-06-22 10:52:41,346 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:41,346 INFO ]: Start minimizeSevpa. Operand 547 states. [2018-06-22 10:52:41,368 INFO ]: Finished minimizeSevpa. Reduced states from 547 to 509. [2018-06-22 10:52:41,368 INFO ]: Start removeUnreachable. Operand 509 states. [2018-06-22 10:52:41,371 INFO ]: Finished removeUnreachable. Reduced from 509 states to 509 states and 603 transitions. [2018-06-22 10:52:41,371 INFO ]: Start accepts. Automaton has 509 states and 603 transitions. Word has length 185 [2018-06-22 10:52:41,373 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:41,373 INFO ]: Abstraction has 509 states and 603 transitions. [2018-06-22 10:52:41,373 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:41,373 INFO ]: Start isEmpty. Operand 509 states and 603 transitions. [2018-06-22 10:52:41,376 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:41,376 INFO ]: Found error trace [2018-06-22 10:52:41,376 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:41,376 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:41,377 INFO ]: Analyzing trace with hash 1552991125, now seen corresponding path program 1 times [2018-06-22 10:52:41,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:41,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:41,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:41,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:41,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:41,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:41,614 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:41,614 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:41,614 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:41,615 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:41,615 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:41,615 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:41,615 INFO ]: Start difference. First operand 509 states and 603 transitions. Second operand 12 states. [2018-06-22 10:52:41,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:41,813 INFO ]: Finished difference Result 571 states and 676 transitions. [2018-06-22 10:52:41,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:41,814 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:41,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:41,817 INFO ]: With dead ends: 571 [2018-06-22 10:52:41,817 INFO ]: Without dead ends: 547 [2018-06-22 10:52:41,820 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:41,821 INFO ]: Start minimizeSevpa. Operand 547 states. [2018-06-22 10:52:41,844 INFO ]: Finished minimizeSevpa. Reduced states from 547 to 531. [2018-06-22 10:52:41,844 INFO ]: Start removeUnreachable. Operand 531 states. [2018-06-22 10:52:41,847 INFO ]: Finished removeUnreachable. Reduced from 531 states to 531 states and 635 transitions. [2018-06-22 10:52:41,847 INFO ]: Start accepts. Automaton has 531 states and 635 transitions. Word has length 185 [2018-06-22 10:52:41,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:41,847 INFO ]: Abstraction has 531 states and 635 transitions. [2018-06-22 10:52:41,847 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:41,847 INFO ]: Start isEmpty. Operand 531 states and 635 transitions. [2018-06-22 10:52:41,851 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:41,851 INFO ]: Found error trace [2018-06-22 10:52:41,851 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:41,852 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:41,852 INFO ]: Analyzing trace with hash -807143328, now seen corresponding path program 1 times [2018-06-22 10:52:41,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:41,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:41,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:41,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:41,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:41,877 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:42,442 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:42,442 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:42,442 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:42,443 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:42,443 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:42,443 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:42,443 INFO ]: Start difference. First operand 531 states and 635 transitions. Second operand 12 states. [2018-06-22 10:52:42,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:42,594 INFO ]: Finished difference Result 595 states and 713 transitions. [2018-06-22 10:52:42,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:42,594 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:42,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:42,599 INFO ]: With dead ends: 595 [2018-06-22 10:52:42,599 INFO ]: Without dead ends: 571 [2018-06-22 10:52:42,599 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:42,600 INFO ]: Start minimizeSevpa. Operand 571 states. [2018-06-22 10:52:42,628 INFO ]: Finished minimizeSevpa. Reduced states from 571 to 559. [2018-06-22 10:52:42,628 INFO ]: Start removeUnreachable. Operand 559 states. [2018-06-22 10:52:42,631 INFO ]: Finished removeUnreachable. Reduced from 559 states to 559 states and 674 transitions. [2018-06-22 10:52:42,631 INFO ]: Start accepts. Automaton has 559 states and 674 transitions. Word has length 185 [2018-06-22 10:52:42,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:42,631 INFO ]: Abstraction has 559 states and 674 transitions. [2018-06-22 10:52:42,631 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:42,631 INFO ]: Start isEmpty. Operand 559 states and 674 transitions. [2018-06-22 10:52:42,636 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:42,636 INFO ]: Found error trace [2018-06-22 10:52:42,637 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:42,637 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:42,637 INFO ]: Analyzing trace with hash -1798695488, now seen corresponding path program 1 times [2018-06-22 10:52:42,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:42,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:42,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:42,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:42,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:42,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:43,015 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:43,015 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:43,015 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:43,016 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:43,016 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:43,016 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:43,016 INFO ]: Start difference. First operand 559 states and 674 transitions. Second operand 12 states. [2018-06-22 10:52:43,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:43,176 INFO ]: Finished difference Result 615 states and 729 transitions. [2018-06-22 10:52:43,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:43,177 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:43,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:43,181 INFO ]: With dead ends: 615 [2018-06-22 10:52:43,181 INFO ]: Without dead ends: 589 [2018-06-22 10:52:43,181 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:52:43,181 INFO ]: Start minimizeSevpa. Operand 589 states. [2018-06-22 10:52:43,204 INFO ]: Finished minimizeSevpa. Reduced states from 589 to 561. [2018-06-22 10:52:43,204 INFO ]: Start removeUnreachable. Operand 561 states. [2018-06-22 10:52:43,206 INFO ]: Finished removeUnreachable. Reduced from 561 states to 561 states and 674 transitions. [2018-06-22 10:52:43,207 INFO ]: Start accepts. Automaton has 561 states and 674 transitions. Word has length 185 [2018-06-22 10:52:43,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:43,207 INFO ]: Abstraction has 561 states and 674 transitions. [2018-06-22 10:52:43,207 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:43,207 INFO ]: Start isEmpty. Operand 561 states and 674 transitions. [2018-06-22 10:52:43,210 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:43,210 INFO ]: Found error trace [2018-06-22 10:52:43,211 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:43,211 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:43,211 INFO ]: Analyzing trace with hash 1133640888, now seen corresponding path program 1 times [2018-06-22 10:52:43,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:43,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:43,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:43,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:43,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:43,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:43,470 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-22 10:52:43,665 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:43,665 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:43,665 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:43,665 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:43,666 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:43,666 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:43,666 INFO ]: Start difference. First operand 561 states and 674 transitions. Second operand 12 states. [2018-06-22 10:52:43,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:43,817 INFO ]: Finished difference Result 617 states and 730 transitions. [2018-06-22 10:52:43,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:43,818 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:43,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:43,821 INFO ]: With dead ends: 617 [2018-06-22 10:52:43,821 INFO ]: Without dead ends: 591 [2018-06-22 10:52:43,821 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:43,821 INFO ]: Start minimizeSevpa. Operand 591 states. [2018-06-22 10:52:43,843 INFO ]: Finished minimizeSevpa. Reduced states from 591 to 567. [2018-06-22 10:52:43,843 INFO ]: Start removeUnreachable. Operand 567 states. [2018-06-22 10:52:43,845 INFO ]: Finished removeUnreachable. Reduced from 567 states to 567 states and 679 transitions. [2018-06-22 10:52:43,845 INFO ]: Start accepts. Automaton has 567 states and 679 transitions. Word has length 185 [2018-06-22 10:52:43,846 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:43,846 INFO ]: Abstraction has 567 states and 679 transitions. [2018-06-22 10:52:43,846 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:43,846 INFO ]: Start isEmpty. Operand 567 states and 679 transitions. [2018-06-22 10:52:43,849 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 10:52:43,849 INFO ]: Found error trace [2018-06-22 10:52:43,849 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:43,849 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:43,849 INFO ]: Analyzing trace with hash 1562235817, now seen corresponding path program 1 times [2018-06-22 10:52:43,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:43,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:43,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:43,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:43,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:43,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:44,126 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:44,126 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:44,126 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:44,126 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:44,126 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:44,126 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:44,126 INFO ]: Start difference. First operand 567 states and 679 transitions. Second operand 12 states. [2018-06-22 10:52:44,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:44,449 INFO ]: Finished difference Result 621 states and 734 transitions. [2018-06-22 10:52:44,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:44,449 INFO ]: Start accepts. Automaton has 12 states. Word has length 185 [2018-06-22 10:52:44,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:44,452 INFO ]: With dead ends: 621 [2018-06-22 10:52:44,452 INFO ]: Without dead ends: 595 [2018-06-22 10:52:44,453 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:44,454 INFO ]: Start minimizeSevpa. Operand 595 states. [2018-06-22 10:52:44,472 INFO ]: Finished minimizeSevpa. Reduced states from 595 to 571. [2018-06-22 10:52:44,472 INFO ]: Start removeUnreachable. Operand 571 states. [2018-06-22 10:52:44,474 INFO ]: Finished removeUnreachable. Reduced from 571 states to 571 states and 683 transitions. [2018-06-22 10:52:44,474 INFO ]: Start accepts. Automaton has 571 states and 683 transitions. Word has length 185 [2018-06-22 10:52:44,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:44,475 INFO ]: Abstraction has 571 states and 683 transitions. [2018-06-22 10:52:44,475 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:44,475 INFO ]: Start isEmpty. Operand 571 states and 683 transitions. [2018-06-22 10:52:44,477 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:44,477 INFO ]: Found error trace [2018-06-22 10:52:44,478 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:44,478 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:44,478 INFO ]: Analyzing trace with hash 321582889, now seen corresponding path program 1 times [2018-06-22 10:52:44,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:44,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:44,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:44,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:44,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:44,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:44,800 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:52:45,452 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:45,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:45,452 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:45,452 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:45,452 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:45,452 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:45,452 INFO ]: Start difference. First operand 571 states and 683 transitions. Second operand 13 states. [2018-06-22 10:52:45,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:45,823 INFO ]: Finished difference Result 637 states and 761 transitions. [2018-06-22 10:52:45,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:45,823 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:45,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:45,826 INFO ]: With dead ends: 637 [2018-06-22 10:52:45,826 INFO ]: Without dead ends: 613 [2018-06-22 10:52:45,826 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:45,827 INFO ]: Start minimizeSevpa. Operand 613 states. [2018-06-22 10:52:45,846 INFO ]: Finished minimizeSevpa. Reduced states from 613 to 595. [2018-06-22 10:52:45,846 INFO ]: Start removeUnreachable. Operand 595 states. [2018-06-22 10:52:45,849 INFO ]: Finished removeUnreachable. Reduced from 595 states to 595 states and 718 transitions. [2018-06-22 10:52:45,849 INFO ]: Start accepts. Automaton has 595 states and 718 transitions. Word has length 189 [2018-06-22 10:52:45,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:45,849 INFO ]: Abstraction has 595 states and 718 transitions. [2018-06-22 10:52:45,849 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:45,849 INFO ]: Start isEmpty. Operand 595 states and 718 transitions. [2018-06-22 10:52:45,852 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:45,853 INFO ]: Found error trace [2018-06-22 10:52:45,853 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:45,853 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:45,853 INFO ]: Analyzing trace with hash -1137050546, now seen corresponding path program 1 times [2018-06-22 10:52:45,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:45,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:45,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:45,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:45,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:45,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:46,333 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:46,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:46,334 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:46,334 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:46,334 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:46,334 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:46,334 INFO ]: Start difference. First operand 595 states and 718 transitions. Second operand 13 states. [2018-06-22 10:52:46,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:46,926 INFO ]: Finished difference Result 657 states and 780 transitions. [2018-06-22 10:52:46,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:46,926 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:46,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:46,929 INFO ]: With dead ends: 657 [2018-06-22 10:52:46,929 INFO ]: Without dead ends: 633 [2018-06-22 10:52:46,929 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:52:46,930 INFO ]: Start minimizeSevpa. Operand 633 states. [2018-06-22 10:52:46,948 INFO ]: Finished minimizeSevpa. Reduced states from 633 to 607. [2018-06-22 10:52:46,948 INFO ]: Start removeUnreachable. Operand 607 states. [2018-06-22 10:52:46,950 INFO ]: Finished removeUnreachable. Reduced from 607 states to 607 states and 729 transitions. [2018-06-22 10:52:46,951 INFO ]: Start accepts. Automaton has 607 states and 729 transitions. Word has length 189 [2018-06-22 10:52:46,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:46,951 INFO ]: Abstraction has 607 states and 729 transitions. [2018-06-22 10:52:46,951 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:46,951 INFO ]: Start isEmpty. Operand 607 states and 729 transitions. [2018-06-22 10:52:46,954 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:46,954 INFO ]: Found error trace [2018-06-22 10:52:46,955 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:46,955 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:46,955 INFO ]: Analyzing trace with hash -1880409185, now seen corresponding path program 1 times [2018-06-22 10:52:46,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:46,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:46,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:46,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:46,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:46,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:47,227 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:47,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:47,227 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:47,227 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:47,227 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:47,227 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:47,227 INFO ]: Start difference. First operand 607 states and 729 transitions. Second operand 13 states. [2018-06-22 10:52:47,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:47,674 INFO ]: Finished difference Result 667 states and 799 transitions. [2018-06-22 10:52:47,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:47,674 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:47,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:47,676 INFO ]: With dead ends: 667 [2018-06-22 10:52:47,676 INFO ]: Without dead ends: 641 [2018-06-22 10:52:47,676 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:52:47,677 INFO ]: Start minimizeSevpa. Operand 641 states. [2018-06-22 10:52:47,695 INFO ]: Finished minimizeSevpa. Reduced states from 641 to 621. [2018-06-22 10:52:47,695 INFO ]: Start removeUnreachable. Operand 621 states. [2018-06-22 10:52:47,698 INFO ]: Finished removeUnreachable. Reduced from 621 states to 621 states and 752 transitions. [2018-06-22 10:52:47,698 INFO ]: Start accepts. Automaton has 621 states and 752 transitions. Word has length 189 [2018-06-22 10:52:47,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:47,698 INFO ]: Abstraction has 621 states and 752 transitions. [2018-06-22 10:52:47,698 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:47,698 INFO ]: Start isEmpty. Operand 621 states and 752 transitions. [2018-06-22 10:52:47,701 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:47,701 INFO ]: Found error trace [2018-06-22 10:52:47,702 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:47,702 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:47,702 INFO ]: Analyzing trace with hash -167484129, now seen corresponding path program 1 times [2018-06-22 10:52:47,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:47,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:47,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:47,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:47,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:47,726 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:48,019 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:48,019 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:48,019 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:48,019 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:48,019 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:48,019 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:48,019 INFO ]: Start difference. First operand 621 states and 752 transitions. Second operand 13 states. [2018-06-22 10:52:48,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:48,186 INFO ]: Finished difference Result 683 states and 817 transitions. [2018-06-22 10:52:48,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:48,189 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:48,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:48,192 INFO ]: With dead ends: 683 [2018-06-22 10:52:48,192 INFO ]: Without dead ends: 657 [2018-06-22 10:52:48,192 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:52:48,193 INFO ]: Start minimizeSevpa. Operand 657 states. [2018-06-22 10:52:48,210 INFO ]: Finished minimizeSevpa. Reduced states from 657 to 635. [2018-06-22 10:52:48,210 INFO ]: Start removeUnreachable. Operand 635 states. [2018-06-22 10:52:48,213 INFO ]: Finished removeUnreachable. Reduced from 635 states to 635 states and 768 transitions. [2018-06-22 10:52:48,213 INFO ]: Start accepts. Automaton has 635 states and 768 transitions. Word has length 189 [2018-06-22 10:52:48,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:48,213 INFO ]: Abstraction has 635 states and 768 transitions. [2018-06-22 10:52:48,213 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:48,213 INFO ]: Start isEmpty. Operand 635 states and 768 transitions. [2018-06-22 10:52:48,216 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:48,216 INFO ]: Found error trace [2018-06-22 10:52:48,216 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:48,216 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:48,216 INFO ]: Analyzing trace with hash -197407422, now seen corresponding path program 1 times [2018-06-22 10:52:48,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:48,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:48,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:48,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:48,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:48,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:48,405 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:48,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:48,405 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:48,406 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:48,406 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:48,406 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:48,406 INFO ]: Start difference. First operand 635 states and 768 transitions. Second operand 13 states. [2018-06-22 10:52:48,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:48,580 INFO ]: Finished difference Result 691 states and 825 transitions. [2018-06-22 10:52:48,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:48,580 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:48,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:48,582 INFO ]: With dead ends: 691 [2018-06-22 10:52:48,582 INFO ]: Without dead ends: 660 [2018-06-22 10:52:48,582 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:52:48,583 INFO ]: Start minimizeSevpa. Operand 660 states. [2018-06-22 10:52:48,601 INFO ]: Finished minimizeSevpa. Reduced states from 660 to 640. [2018-06-22 10:52:48,601 INFO ]: Start removeUnreachable. Operand 640 states. [2018-06-22 10:52:48,605 INFO ]: Finished removeUnreachable. Reduced from 640 states to 640 states and 770 transitions. [2018-06-22 10:52:48,605 INFO ]: Start accepts. Automaton has 640 states and 770 transitions. Word has length 189 [2018-06-22 10:52:48,605 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:48,605 INFO ]: Abstraction has 640 states and 770 transitions. [2018-06-22 10:52:48,605 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:48,605 INFO ]: Start isEmpty. Operand 640 states and 770 transitions. [2018-06-22 10:52:48,608 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:48,608 INFO ]: Found error trace [2018-06-22 10:52:48,608 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:48,608 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:48,609 INFO ]: Analyzing trace with hash 563863938, now seen corresponding path program 1 times [2018-06-22 10:52:48,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:48,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:48,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:48,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:48,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:48,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:48,798 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:48,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:48,798 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:48,798 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:48,798 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:48,798 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:48,798 INFO ]: Start difference. First operand 640 states and 770 transitions. Second operand 13 states. [2018-06-22 10:52:48,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:48,984 INFO ]: Finished difference Result 696 states and 827 transitions. [2018-06-22 10:52:48,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:48,984 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:48,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:48,986 INFO ]: With dead ends: 696 [2018-06-22 10:52:48,986 INFO ]: Without dead ends: 665 [2018-06-22 10:52:48,986 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:52:48,987 INFO ]: Start minimizeSevpa. Operand 665 states. [2018-06-22 10:52:49,006 INFO ]: Finished minimizeSevpa. Reduced states from 665 to 643. [2018-06-22 10:52:49,006 INFO ]: Start removeUnreachable. Operand 643 states. [2018-06-22 10:52:49,009 INFO ]: Finished removeUnreachable. Reduced from 643 states to 643 states and 770 transitions. [2018-06-22 10:52:49,009 INFO ]: Start accepts. Automaton has 643 states and 770 transitions. Word has length 189 [2018-06-22 10:52:49,009 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:49,009 INFO ]: Abstraction has 643 states and 770 transitions. [2018-06-22 10:52:49,009 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:49,009 INFO ]: Start isEmpty. Operand 643 states and 770 transitions. [2018-06-22 10:52:49,012 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:49,012 INFO ]: Found error trace [2018-06-22 10:52:49,012 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:49,012 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:49,013 INFO ]: Analyzing trace with hash 672122633, now seen corresponding path program 1 times [2018-06-22 10:52:49,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:49,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:49,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:49,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:49,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:49,035 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:49,328 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:49,328 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:49,328 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:49,328 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:49,328 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:49,328 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:49,329 INFO ]: Start difference. First operand 643 states and 770 transitions. Second operand 13 states. [2018-06-22 10:52:49,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:49,598 INFO ]: Finished difference Result 719 states and 857 transitions. [2018-06-22 10:52:49,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:49,601 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:49,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:49,604 INFO ]: With dead ends: 719 [2018-06-22 10:52:49,604 INFO ]: Without dead ends: 686 [2018-06-22 10:52:49,604 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:52:49,605 INFO ]: Start minimizeSevpa. Operand 686 states. [2018-06-22 10:52:49,624 INFO ]: Finished minimizeSevpa. Reduced states from 686 to 656. [2018-06-22 10:52:49,624 INFO ]: Start removeUnreachable. Operand 656 states. [2018-06-22 10:52:49,627 INFO ]: Finished removeUnreachable. Reduced from 656 states to 656 states and 786 transitions. [2018-06-22 10:52:49,627 INFO ]: Start accepts. Automaton has 656 states and 786 transitions. Word has length 189 [2018-06-22 10:52:49,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:49,627 INFO ]: Abstraction has 656 states and 786 transitions. [2018-06-22 10:52:49,627 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:49,627 INFO ]: Start isEmpty. Operand 656 states and 786 transitions. [2018-06-22 10:52:49,630 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 10:52:49,630 INFO ]: Found error trace [2018-06-22 10:52:49,630 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:49,631 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:49,631 INFO ]: Analyzing trace with hash -405702479, now seen corresponding path program 1 times [2018-06-22 10:52:49,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:49,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:49,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:49,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:49,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:49,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:49,876 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:49,876 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:49,876 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:52:49,877 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:52:49,877 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:52:49,877 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:52:49,877 INFO ]: Start difference. First operand 656 states and 786 transitions. Second operand 13 states. [2018-06-22 10:52:50,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:50,645 INFO ]: Finished difference Result 718 states and 850 transitions. [2018-06-22 10:52:50,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:52:50,647 INFO ]: Start accepts. Automaton has 13 states. Word has length 189 [2018-06-22 10:52:50,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:50,650 INFO ]: With dead ends: 718 [2018-06-22 10:52:50,650 INFO ]: Without dead ends: 685 [2018-06-22 10:52:50,650 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:52:50,651 INFO ]: Start minimizeSevpa. Operand 685 states. [2018-06-22 10:52:50,668 INFO ]: Finished minimizeSevpa. Reduced states from 685 to 661. [2018-06-22 10:52:50,668 INFO ]: Start removeUnreachable. Operand 661 states. [2018-06-22 10:52:50,670 INFO ]: Finished removeUnreachable. Reduced from 661 states to 661 states and 789 transitions. [2018-06-22 10:52:50,670 INFO ]: Start accepts. Automaton has 661 states and 789 transitions. Word has length 189 [2018-06-22 10:52:50,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:50,671 INFO ]: Abstraction has 661 states and 789 transitions. [2018-06-22 10:52:50,671 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:52:50,671 INFO ]: Start isEmpty. Operand 661 states and 789 transitions. [2018-06-22 10:52:50,674 INFO ]: Finished isEmpty. Found accepting run of length 194 [2018-06-22 10:52:50,674 INFO ]: Found error trace [2018-06-22 10:52:50,674 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:50,674 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:50,674 INFO ]: Analyzing trace with hash -2015230675, now seen corresponding path program 1 times [2018-06-22 10:52:50,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:50,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:50,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:50,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:50,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:50,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:51,274 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:51,274 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:51,274 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:52:51,274 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:52:51,274 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:52:51,274 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:51,274 INFO ]: Start difference. First operand 661 states and 789 transitions. Second operand 14 states. [2018-06-22 10:52:51,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:51,486 INFO ]: Finished difference Result 727 states and 858 transitions. [2018-06-22 10:52:51,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:52:51,489 INFO ]: Start accepts. Automaton has 14 states. Word has length 193 [2018-06-22 10:52:51,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:51,491 INFO ]: With dead ends: 727 [2018-06-22 10:52:51,491 INFO ]: Without dead ends: 697 [2018-06-22 10:52:51,492 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:51,492 INFO ]: Start minimizeSevpa. Operand 697 states. [2018-06-22 10:52:51,509 INFO ]: Finished minimizeSevpa. Reduced states from 697 to 673. [2018-06-22 10:52:51,509 INFO ]: Start removeUnreachable. Operand 673 states. [2018-06-22 10:52:51,512 INFO ]: Finished removeUnreachable. Reduced from 673 states to 673 states and 803 transitions. [2018-06-22 10:52:51,512 INFO ]: Start accepts. Automaton has 673 states and 803 transitions. Word has length 193 [2018-06-22 10:52:51,512 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:51,512 INFO ]: Abstraction has 673 states and 803 transitions. [2018-06-22 10:52:51,512 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:52:51,512 INFO ]: Start isEmpty. Operand 673 states and 803 transitions. [2018-06-22 10:52:51,515 INFO ]: Finished isEmpty. Found accepting run of length 194 [2018-06-22 10:52:51,515 INFO ]: Found error trace [2018-06-22 10:52:51,515 INFO ]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:51,515 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:51,516 INFO ]: Analyzing trace with hash 730592464, now seen corresponding path program 1 times [2018-06-22 10:52:51,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:51,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:51,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:51,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:51,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:51,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:51,739 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:52:51,739 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:51,739 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:52:51,739 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:52:51,739 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:52:51,739 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:51,739 INFO ]: Start difference. First operand 673 states and 803 transitions. Second operand 14 states. [2018-06-22 10:52:51,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:51,941 INFO ]: Finished difference Result 677 states and 808 transitions. [2018-06-22 10:52:51,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:52:51,942 INFO ]: Start accepts. Automaton has 14 states. Word has length 193 [2018-06-22 10:52:51,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:51,942 INFO ]: With dead ends: 677 [2018-06-22 10:52:51,942 INFO ]: Without dead ends: 0 [2018-06-22 10:52:51,942 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:52:51,942 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:52:51,942 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:52:51,942 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:52:51,942 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:52:51,942 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2018-06-22 10:52:51,942 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:51,942 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:52:51,942 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:52:51,942 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:52:51,942 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:52:51,946 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:52:51 BoogieIcfgContainer [2018-06-22 10:52:51,946 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:52:51,947 INFO ]: Toolchain (without parser) took 24456.07 ms. Allocated memory was 307.8 MB in the beginning and 590.3 MB in the end (delta: 282.6 MB). Free memory was 227.1 MB in the beginning and 346.2 MB in the end (delta: -119.1 MB). Peak memory consumption was 163.5 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:51,948 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:52:51,948 INFO ]: ChcToBoogie took 105.78 ms. Allocated memory is still 307.8 MB. Free memory was 226.1 MB in the beginning and 223.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:51,949 INFO ]: Boogie Preprocessor took 70.80 ms. Allocated memory is still 307.8 MB. Free memory was 223.1 MB in the beginning and 221.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:52:51,949 INFO ]: RCFGBuilder took 1180.80 ms. Allocated memory was 307.8 MB in the beginning and 324.0 MB in the end (delta: 16.3 MB). Free memory was 221.1 MB in the beginning and 276.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 40.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:51,950 INFO ]: TraceAbstraction took 23082.33 ms. Allocated memory was 324.0 MB in the beginning and 590.3 MB in the end (delta: 266.3 MB). Free memory was 276.6 MB in the beginning and 346.2 MB in the end (delta: -69.6 MB). Peak memory consumption was 196.7 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:51,952 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 105.78 ms. Allocated memory is still 307.8 MB. Free memory was 226.1 MB in the beginning and 223.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 70.80 ms. Allocated memory is still 307.8 MB. Free memory was 223.1 MB in the beginning and 221.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1180.80 ms. Allocated memory was 307.8 MB in the beginning and 324.0 MB in the end (delta: 16.3 MB). Free memory was 221.1 MB in the beginning and 276.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 40.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 23082.33 ms. Allocated memory was 324.0 MB in the beginning and 590.3 MB in the end (delta: 266.3 MB). Free memory was 276.6 MB in the beginning and 346.2 MB in the end (delta: -69.6 MB). Peak memory consumption was 196.7 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 51 procedures, 215 locations, 1 error locations. SAFE Result, 23.0s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6007 SDtfs, 358 SDslu, 69463 SDs, 0 SdLazy, 8413 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=23, 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.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 414 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 4136 NumberOfCodeBlocks, 4136 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1021232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 630/630 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/26.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-52-51-960.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/26.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-52-51-960.csv Received shutdown request...