java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:54:18,820 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:54:18,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:54:18,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:54:18,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:54:18,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:54:18,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:54:18,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:54:18,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:54:18,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:54:18,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:54:18,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:54:18,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:54:18,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:54:18,852 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:54:18,853 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:54:18,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:54:18,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:54:18,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:54:18,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:54:18,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:54:18,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:54:18,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:54:18,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:54:18,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:54:18,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:54:18,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:54:18,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:54:18,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:54:18,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:54:18,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:54:18,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:54:18,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:54:18,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:54:18,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:54:18,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:54:18,888 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:54:18,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:54:18,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:54:18,912 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:54:18,912 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:54:18,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:54:18,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:54:18,916 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:54:18,917 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:54:18,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:54:18,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:54:18,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:54:18,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:54:18,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:54:18,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:54:18,918 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:54:18,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:54:18,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:54:18,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:54:18,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:54:18,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:54:18,919 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:54:18,922 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:54:18,922 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:54:18,961 INFO ]: Repository-Root is: /tmp [2018-06-26 17:54:18,977 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:54:18,982 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:54:18,984 INFO ]: Initializing SmtParser... [2018-06-26 17:54:18,984 INFO ]: SmtParser initialized [2018-06-26 17:54:18,984 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-26 17:54:18,985 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:54:19,070 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 unknown [2018-06-26 17:54:19,242 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-26 17:54:19,247 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:54:19,257 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:54:19,258 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:54:19,258 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:54:19,258 INFO ]: ChcToBoogie initialized [2018-06-26 17:54:19,262 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,315 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19 Unit [2018-06-26 17:54:19,315 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:54:19,316 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:54:19,316 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:54:19,316 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:54:19,335 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,335 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,343 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,343 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,346 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,348 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,349 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,351 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:54:19,352 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:54:19,352 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:54:19,352 INFO ]: RCFGBuilder initialized [2018-06-26 17:54:19,353 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:54:19,366 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:54:19,366 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:54:19,366 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:54:19,366 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:54:19,366 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:54:19,366 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:54:19,617 INFO ]: Using library mode [2018-06-26 17:54:19,618 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:19 BoogieIcfgContainer [2018-06-26 17:54:19,618 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:54:19,618 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:54:19,618 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:54:19,619 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:54:19,619 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:19" (1/1) ... [2018-06-26 17:54:19,630 INFO ]: Initial Icfg 14 locations, 16 edges [2018-06-26 17:54:19,632 INFO ]: Using Remove infeasible edges [2018-06-26 17:54:19,632 INFO ]: Using Maximize final states [2018-06-26 17:54:19,632 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:54:19,633 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:54:19,634 INFO ]: Using Remove sink states [2018-06-26 17:54:19,635 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:54:19,635 INFO ]: Using Use SBE [2018-06-26 17:54:19,641 INFO ]: SBE split 0 edges [2018-06-26 17:54:19,645 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:54:19,647 INFO ]: 0 new accepting states [2018-06-26 17:54:19,691 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-26 17:54:19,692 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:54:19,698 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:54:19,698 INFO ]: 0 new accepting states [2018-06-26 17:54:19,698 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:54:19,699 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:54:19,702 INFO ]: Encoded RCFG 8 locations, 10 edges [2018-06-26 17:54:19,702 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:54:19 BasicIcfg [2018-06-26 17:54:19,702 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:54:19,703 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:54:19,703 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:54:19,707 INFO ]: TraceAbstraction initialized [2018-06-26 17:54:19,707 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:54:19" (1/4) ... [2018-06-26 17:54:19,708 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:54:19, skipping insertion in model container [2018-06-26 17:54:19,708 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:19" (2/4) ... [2018-06-26 17:54:19,708 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:54:19, skipping insertion in model container [2018-06-26 17:54:19,708 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:19" (3/4) ... [2018-06-26 17:54:19,709 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:54:19, skipping insertion in model container [2018-06-26 17:54:19,709 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:54:19" (4/4) ... [2018-06-26 17:54:19,711 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:54:19,719 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:54:19,724 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:54:19,754 INFO ]: Using default assertion order modulation [2018-06-26 17:54:19,754 INFO ]: Interprodecural is true [2018-06-26 17:54:19,754 INFO ]: Hoare is false [2018-06-26 17:54:19,755 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:54:19,755 INFO ]: Backedges is TWOTRACK [2018-06-26 17:54:19,755 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:54:19,755 INFO ]: Difference is false [2018-06-26 17:54:19,755 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:54:19,755 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:54:19,765 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 17:54:19,773 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:54:19,773 INFO ]: Found error trace [2018-06-26 17:54:19,774 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:19,774 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:19,778 INFO ]: Analyzing trace with hash -1173083044, now seen corresponding path program 1 times [2018-06-26 17:54:19,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:19,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:19,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:19,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:19,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:19,856 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:19,929 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:19,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:19,931 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:54:19,933 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:54:19,945 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:54:19,945 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:54:19,948 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-26 17:54:20,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:20,016 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-26 17:54:20,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:54:20,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:54:20,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:20,026 INFO ]: With dead ends: 13 [2018-06-26 17:54:20,026 INFO ]: Without dead ends: 13 [2018-06-26 17:54:20,028 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:20,040 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:54:20,057 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:54:20,058 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:54:20,059 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-26 17:54:20,061 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-06-26 17:54:20,061 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:20,061 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-26 17:54:20,061 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:54:20,061 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-26 17:54:20,061 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:54:20,061 INFO ]: Found error trace [2018-06-26 17:54:20,061 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:20,061 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:20,062 INFO ]: Analyzing trace with hash -2007083269, now seen corresponding path program 1 times [2018-06-26 17:54:20,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:20,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:20,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:20,063 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:20,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:20,087 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:20,203 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:20,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:20,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:54:20,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:20,262 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:20,272 INFO ]: Computing forward predicates... [2018-06-26 17:54:20,577 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:20,597 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:54:20,597 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-26 17:54:20,597 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:54:20,598 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:54:20,598 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:54:20,598 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 9 states. [2018-06-26 17:54:20,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:20,772 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-26 17:54:20,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:54:20,773 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-26 17:54:20,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:20,773 INFO ]: With dead ends: 12 [2018-06-26 17:54:20,773 INFO ]: Without dead ends: 9 [2018-06-26 17:54:20,774 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:54:20,774 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:54:20,775 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:54:20,775 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:54:20,776 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-26 17:54:20,776 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-26 17:54:20,776 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:20,776 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-26 17:54:20,776 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:54:20,776 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-26 17:54:20,776 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:54:20,776 INFO ]: Found error trace [2018-06-26 17:54:20,776 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:20,776 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:20,776 INFO ]: Analyzing trace with hash -1980301160, now seen corresponding path program 1 times [2018-06-26 17:54:20,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:20,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:20,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:20,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:20,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:20,788 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:20,869 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:20,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:20,870 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:54:20,870 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:54:20,870 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:54:20,870 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:20,870 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-26 17:54:20,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:20,983 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-26 17:54:20,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:54:20,983 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 17:54:20,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:20,984 INFO ]: With dead ends: 11 [2018-06-26 17:54:20,984 INFO ]: Without dead ends: 10 [2018-06-26 17:54:20,984 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:54:20,984 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:54:20,985 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:54:20,986 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:54:20,986 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-26 17:54:20,986 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-26 17:54:20,986 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:20,986 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-26 17:54:20,986 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:54:20,986 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-26 17:54:20,986 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:54:20,986 INFO ]: Found error trace [2018-06-26 17:54:20,987 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:20,987 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:20,987 INFO ]: Analyzing trace with hash -1261041089, now seen corresponding path program 1 times [2018-06-26 17:54:20,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:20,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:20,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:20,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:20,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:21,001 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:21,070 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:21,070 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:21,070 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:54:21,070 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:54:21,070 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:54:21,070 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:21,070 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-26 17:54:21,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:21,168 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-26 17:54:21,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:54:21,169 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:54:21,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:21,169 INFO ]: With dead ends: 11 [2018-06-26 17:54:21,169 INFO ]: Without dead ends: 11 [2018-06-26 17:54:21,170 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:54:21,170 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:54:21,171 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:54:21,171 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:54:21,171 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-26 17:54:21,171 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-26 17:54:21,172 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:21,172 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-26 17:54:21,172 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:54:21,172 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-26 17:54:21,172 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:54:21,172 INFO ]: Found error trace [2018-06-26 17:54:21,172 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:21,172 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:21,172 INFO ]: Analyzing trace with hash -437802474, now seen corresponding path program 1 times [2018-06-26 17:54:21,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:21,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:21,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:21,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:21,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:21,196 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:21,434 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:21,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:21,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:54:21,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:21,499 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:21,502 INFO ]: Computing forward predicates... [2018-06-26 17:54:21,860 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:21,880 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:21,880 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-26 17:54:21,880 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:54:21,880 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:54:21,880 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:54:21,880 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-26 17:54:22,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:22,064 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-26 17:54:22,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:54:22,064 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-26 17:54:22,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:22,064 INFO ]: With dead ends: 18 [2018-06-26 17:54:22,064 INFO ]: Without dead ends: 18 [2018-06-26 17:54:22,065 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:54:22,065 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:54:22,066 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-26 17:54:22,066 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:54:22,067 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-26 17:54:22,067 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-26 17:54:22,067 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:22,067 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-26 17:54:22,067 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:54:22,067 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-26 17:54:22,067 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:54:22,067 INFO ]: Found error trace [2018-06-26 17:54:22,067 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:22,068 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:22,068 INFO ]: Analyzing trace with hash -718608899, now seen corresponding path program 2 times [2018-06-26 17:54:22,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:22,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:22,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:22,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:22,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:22,083 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:22,242 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:22,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:22,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:22,257 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:22,277 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:22,278 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:22,279 INFO ]: Computing forward predicates... [2018-06-26 17:54:22,354 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:22,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:22,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-26 17:54:22,373 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:54:22,373 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:54:22,373 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:54:22,374 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2018-06-26 17:54:23,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:23,066 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-26 17:54:23,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:54:23,067 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-26 17:54:23,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:23,067 INFO ]: With dead ends: 23 [2018-06-26 17:54:23,067 INFO ]: Without dead ends: 17 [2018-06-26 17:54:23,068 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:54:23,068 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:54:23,069 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-26 17:54:23,069 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:54:23,070 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-26 17:54:23,070 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-26 17:54:23,070 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:23,070 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-26 17:54:23,070 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:54:23,070 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-26 17:54:23,070 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:54:23,070 INFO ]: Found error trace [2018-06-26 17:54:23,070 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:23,070 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:23,070 INFO ]: Analyzing trace with hash -750805926, now seen corresponding path program 3 times [2018-06-26 17:54:23,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:23,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:23,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:23,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:23,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:23,083 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,141 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:23,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:23,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:23,157 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:23,183 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 17:54:23,183 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,185 INFO ]: Computing forward predicates... [2018-06-26 17:54:23,230 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:23,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:23,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-26 17:54:23,253 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:54:23,253 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:54:23,253 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:54:23,254 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2018-06-26 17:54:23,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:23,299 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-26 17:54:23,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:54:23,300 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 17:54:23,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:23,300 INFO ]: With dead ends: 16 [2018-06-26 17:54:23,300 INFO ]: Without dead ends: 16 [2018-06-26 17:54:23,301 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:54:23,301 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:54:23,302 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-26 17:54:23,302 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:54:23,302 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-26 17:54:23,302 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-26 17:54:23,302 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:23,302 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-26 17:54:23,302 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:54:23,302 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-26 17:54:23,303 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:54:23,303 INFO ]: Found error trace [2018-06-26 17:54:23,303 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:23,303 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:23,303 INFO ]: Analyzing trace with hash -1800381605, now seen corresponding path program 4 times [2018-06-26 17:54:23,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:23,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:23,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:23,304 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:23,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:23,330 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,408 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:23,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:23,408 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:23,414 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:23,434 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:23,434 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,436 INFO ]: Computing forward predicates... [2018-06-26 17:54:23,475 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:23,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:23,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-26 17:54:23,495 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:54:23,495 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:54:23,495 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:54:23,496 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 11 states. [2018-06-26 17:54:23,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:23,548 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-26 17:54:23,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:54:23,549 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 17:54:23,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:23,550 INFO ]: With dead ends: 17 [2018-06-26 17:54:23,550 INFO ]: Without dead ends: 14 [2018-06-26 17:54:23,550 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:54:23,550 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:54:23,552 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:54:23,552 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:54:23,552 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-26 17:54:23,552 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-26 17:54:23,552 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:23,552 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-26 17:54:23,552 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:54:23,552 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-26 17:54:23,552 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:54:23,552 INFO ]: Found error trace [2018-06-26 17:54:23,553 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:23,553 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:23,553 INFO ]: Analyzing trace with hash -950880420, now seen corresponding path program 5 times [2018-06-26 17:54:23,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:23,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:23,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:23,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:23,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:23,570 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,680 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:23,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:23,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:23,689 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:23,735 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:23,735 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,738 INFO ]: Computing forward predicates... [2018-06-26 17:54:24,328 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:24,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:24,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-26 17:54:24,360 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:54:24,360 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:54:24,360 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:54:24,360 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 15 states. [2018-06-26 17:54:24,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:24,652 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-26 17:54:24,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:54:24,652 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-26 17:54:24,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:24,653 INFO ]: With dead ends: 23 [2018-06-26 17:54:24,653 INFO ]: Without dead ends: 23 [2018-06-26 17:54:24,653 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:54:24,653 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:54:24,655 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-26 17:54:24,655 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:54:24,655 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-26 17:54:24,655 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2018-06-26 17:54:24,655 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:24,655 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-26 17:54:24,655 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:54:24,655 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-26 17:54:24,656 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:54:24,656 INFO ]: Found error trace [2018-06-26 17:54:24,656 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:24,656 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:24,656 INFO ]: Analyzing trace with hash -386147461, now seen corresponding path program 6 times [2018-06-26 17:54:24,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:24,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:24,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:24,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:24,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:24,668 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:24,877 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:24,877 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:24,877 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:24,885 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:24,913 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 17:54:24,913 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:24,915 INFO ]: Computing forward predicates... [2018-06-26 17:54:25,177 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:25,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:25,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-26 17:54:25,197 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:54:25,197 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:54:25,197 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:54:25,197 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. [2018-06-26 17:54:25,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:25,652 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-26 17:54:25,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:54:25,652 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-26 17:54:25,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:25,653 INFO ]: With dead ends: 29 [2018-06-26 17:54:25,653 INFO ]: Without dead ends: 21 [2018-06-26 17:54:25,653 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:54:25,653 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:54:25,655 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 17:54:25,655 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:54:25,655 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-26 17:54:25,656 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-26 17:54:25,656 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:25,656 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-26 17:54:25,656 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:54:25,656 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-26 17:54:25,656 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:54:25,656 INFO ]: Found error trace [2018-06-26 17:54:25,656 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:25,656 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:25,656 INFO ]: Analyzing trace with hash -1262719336, now seen corresponding path program 7 times [2018-06-26 17:54:25,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:25,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:25,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:25,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:25,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:25,668 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:25,744 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:25,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:25,744 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:25,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:25,788 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:25,790 INFO ]: Computing forward predicates... [2018-06-26 17:54:25,882 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:25,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:25,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-26 17:54:25,901 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:54:25,901 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:54:25,901 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:54:25,902 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 13 states. [2018-06-26 17:54:25,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:25,957 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-26 17:54:25,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:54:25,958 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 17:54:25,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:25,958 INFO ]: With dead ends: 20 [2018-06-26 17:54:25,958 INFO ]: Without dead ends: 20 [2018-06-26 17:54:25,959 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:54:25,959 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:54:25,960 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-26 17:54:25,960 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:54:25,961 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-26 17:54:25,961 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-06-26 17:54:25,961 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:25,961 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-26 17:54:25,961 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:54:25,961 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-26 17:54:25,961 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:54:25,961 INFO ]: Found error trace [2018-06-26 17:54:25,961 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:25,961 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:25,961 INFO ]: Analyzing trace with hash -489828131, now seen corresponding path program 8 times [2018-06-26 17:54:25,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:25,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:25,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:25,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:25,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:25,973 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:26,054 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:26,054 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:26,054 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:26,061 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:26,082 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:26,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:26,084 INFO ]: Computing forward predicates... [2018-06-26 17:54:26,186 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:26,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:26,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 17:54:26,206 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:54:26,206 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:54:26,206 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:54:26,206 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2018-06-26 17:54:26,488 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-26 17:54:26,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:26,494 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-26 17:54:26,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:54:26,494 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-26 17:54:26,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:26,494 INFO ]: With dead ends: 21 [2018-06-26 17:54:26,494 INFO ]: Without dead ends: 17 [2018-06-26 17:54:26,495 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:54:26,495 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:54:26,496 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:54:26,496 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:54:26,496 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-26 17:54:26,497 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-26 17:54:26,497 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:26,497 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-26 17:54:26,497 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:54:26,497 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-26 17:54:26,497 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:54:26,497 INFO ]: Found error trace [2018-06-26 17:54:26,497 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:26,497 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:26,497 INFO ]: Analyzing trace with hash 1884608662, now seen corresponding path program 9 times [2018-06-26 17:54:26,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:26,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:26,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:26,498 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:26,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:26,516 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:26,639 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:26,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:26,639 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:26,647 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:26,689 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:54:26,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:26,693 INFO ]: Computing forward predicates... [2018-06-26 17:54:26,969 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:26,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:26,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-26 17:54:26,988 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:54:26,988 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:54:26,988 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:54:26,988 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 19 states. [2018-06-26 17:54:27,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:27,223 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-26 17:54:27,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:54:27,224 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-26 17:54:27,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:27,224 INFO ]: With dead ends: 28 [2018-06-26 17:54:27,224 INFO ]: Without dead ends: 28 [2018-06-26 17:54:27,224 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:54:27,225 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:54:27,226 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-26 17:54:27,226 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:54:27,227 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-26 17:54:27,227 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-26 17:54:27,227 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:27,227 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-26 17:54:27,227 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:54:27,227 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-26 17:54:27,227 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:54:27,227 INFO ]: Found error trace [2018-06-26 17:54:27,227 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:27,227 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:27,228 INFO ]: Analyzing trace with hash -1817262083, now seen corresponding path program 10 times [2018-06-26 17:54:27,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:27,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:27,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:27,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:27,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:27,239 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:27,410 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:27,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:27,410 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:27,418 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:27,440 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:27,440 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:27,442 INFO ]: Computing forward predicates... [2018-06-26 17:54:27,525 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:27,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:27,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-26 17:54:27,556 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:54:27,556 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:54:27,557 INFO ]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:54:27,557 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 19 states. [2018-06-26 17:54:27,987 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:27,988 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-26 17:54:27,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:54:27,988 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-26 17:54:27,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:27,988 INFO ]: With dead ends: 27 [2018-06-26 17:54:27,988 INFO ]: Without dead ends: 18 [2018-06-26 17:54:27,989 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:54:27,989 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:54:27,990 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:54:27,990 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:54:27,990 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-26 17:54:27,990 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2018-06-26 17:54:27,990 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:27,990 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-26 17:54:27,990 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:54:27,990 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-26 17:54:27,991 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:54:27,991 INFO ]: Found error trace [2018-06-26 17:54:27,991 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:27,991 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:27,991 INFO ]: Analyzing trace with hash 1905723354, now seen corresponding path program 11 times [2018-06-26 17:54:27,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:27,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:27,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:27,992 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:27,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:28,002 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:28,097 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:28,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:28,097 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:28,123 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:28,152 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 17:54:28,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:28,154 INFO ]: Computing forward predicates... [2018-06-26 17:54:28,204 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:28,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:28,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-26 17:54:28,224 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:54:28,224 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:54:28,224 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:54:28,224 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-26 17:54:28,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:28,323 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-26 17:54:28,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:54:28,324 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-26 17:54:28,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:28,324 INFO ]: With dead ends: 19 [2018-06-26 17:54:28,324 INFO ]: Without dead ends: 19 [2018-06-26 17:54:28,324 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:54:28,325 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:54:28,326 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:54:28,326 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:54:28,326 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-26 17:54:28,326 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2018-06-26 17:54:28,326 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:28,326 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-26 17:54:28,326 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:54:28,326 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-26 17:54:28,327 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:54:28,327 INFO ]: Found error trace [2018-06-26 17:54:28,327 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:28,327 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:28,327 INFO ]: Analyzing trace with hash -1052352549, now seen corresponding path program 12 times [2018-06-26 17:54:28,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:28,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:28,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:28,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:28,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:28,338 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:29,200 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:29,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:29,200 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:29,205 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:29,228 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 17:54:29,229 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:29,230 INFO ]: Computing forward predicates... [2018-06-26 17:54:29,361 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:29,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:29,396 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-26 17:54:29,396 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:54:29,396 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:54:29,396 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:54:29,396 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 20 states. [2018-06-26 17:54:29,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:29,590 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-26 17:54:29,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:54:29,591 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-26 17:54:29,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:29,591 INFO ]: With dead ends: 25 [2018-06-26 17:54:29,591 INFO ]: Without dead ends: 20 [2018-06-26 17:54:29,592 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:54:29,592 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:54:29,593 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:54:29,593 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:54:29,593 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-26 17:54:29,593 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-06-26 17:54:29,594 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:29,594 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-26 17:54:29,594 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:54:29,594 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-26 17:54:29,594 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:54:29,594 INFO ]: Found error trace [2018-06-26 17:54:29,594 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:29,594 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:29,594 INFO ]: Analyzing trace with hash -1684401572, now seen corresponding path program 13 times [2018-06-26 17:54:29,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:29,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:29,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:29,595 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:29,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:29,614 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:30,058 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:30,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:30,058 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:30,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:30,089 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:30,093 INFO ]: Computing forward predicates... [2018-06-26 17:54:30,359 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:30,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:30,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-26 17:54:30,379 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:54:30,379 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:54:30,379 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:54:30,380 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-26 17:54:30,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:30,613 INFO ]: Finished difference Result 33 states and 38 transitions. [2018-06-26 17:54:30,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:54:30,613 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-26 17:54:30,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:30,614 INFO ]: With dead ends: 33 [2018-06-26 17:54:30,614 INFO ]: Without dead ends: 33 [2018-06-26 17:54:30,614 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:54:30,614 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:54:30,616 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-26 17:54:30,616 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:54:30,616 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-26 17:54:30,616 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2018-06-26 17:54:30,616 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:30,616 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-26 17:54:30,616 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:54:30,617 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-26 17:54:30,617 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:54:30,617 INFO ]: Found error trace [2018-06-26 17:54:30,617 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:30,617 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:30,617 INFO ]: Analyzing trace with hash 196915195, now seen corresponding path program 14 times [2018-06-26 17:54:30,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:30,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:30,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:30,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:30,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:30,630 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:30,772 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:30,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:30,773 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:54:30,787 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:30,817 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:30,817 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:30,819 INFO ]: Computing forward predicates... [2018-06-26 17:54:30,969 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:30,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:30,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-26 17:54:30,990 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:54:30,990 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:54:30,990 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:54:30,990 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 24 states. [2018-06-26 17:54:31,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:31,657 INFO ]: Finished difference Result 41 states and 47 transitions. [2018-06-26 17:54:31,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:54:31,658 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-26 17:54:31,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:31,658 INFO ]: With dead ends: 41 [2018-06-26 17:54:31,658 INFO ]: Without dead ends: 29 [2018-06-26 17:54:31,659 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:31,659 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:54:31,660 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-26 17:54:31,660 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:54:31,660 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-26 17:54:31,660 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-26 17:54:31,660 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:31,660 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-26 17:54:31,660 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:54:31,660 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-26 17:54:31,661 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:54:31,661 INFO ]: Found error trace [2018-06-26 17:54:31,661 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:31,661 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:31,661 INFO ]: Analyzing trace with hash 278162584, now seen corresponding path program 15 times [2018-06-26 17:54:31,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:31,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:31,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:31,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:31,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:31,671 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:32,285 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:32,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:32,286 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:32,291 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:32,317 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:54:32,317 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:32,320 INFO ]: Computing forward predicates... [2018-06-26 17:54:32,399 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:32,430 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:32,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-26 17:54:32,431 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:54:32,431 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:54:32,431 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:54:32,431 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2018-06-26 17:54:32,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:32,794 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-26 17:54:32,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:54:32,794 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-26 17:54:32,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:32,794 INFO ]: With dead ends: 29 [2018-06-26 17:54:32,794 INFO ]: Without dead ends: 23 [2018-06-26 17:54:32,794 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:54:32,794 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:54:32,795 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:54:32,795 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:54:32,796 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-26 17:54:32,796 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-26 17:54:32,796 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:32,796 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-26 17:54:32,796 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:54:32,796 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-26 17:54:32,796 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:54:32,796 INFO ]: Found error trace [2018-06-26 17:54:32,796 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:32,796 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:32,796 INFO ]: Analyzing trace with hash -1952286954, now seen corresponding path program 16 times [2018-06-26 17:54:32,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:32,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:32,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:32,797 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:32,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:32,818 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:33,122 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:33,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:33,122 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:33,127 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:33,165 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:33,165 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:33,169 INFO ]: Computing forward predicates... [2018-06-26 17:54:33,722 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:33,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:33,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-06-26 17:54:33,741 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:54:33,741 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:54:33,741 INFO ]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:54:33,741 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 27 states. [2018-06-26 17:54:34,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:34,464 INFO ]: Finished difference Result 38 states and 43 transitions. [2018-06-26 17:54:34,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:54:34,465 INFO ]: Start accepts. Automaton has 27 states. Word has length 22 [2018-06-26 17:54:34,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:34,466 INFO ]: With dead ends: 38 [2018-06-26 17:54:34,466 INFO ]: Without dead ends: 38 [2018-06-26 17:54:34,466 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:54:34,466 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:54:34,468 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 25. [2018-06-26 17:54:34,468 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:54:34,468 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-06-26 17:54:34,468 INFO ]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2018-06-26 17:54:34,468 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:34,468 INFO ]: Abstraction has 25 states and 28 transitions. [2018-06-26 17:54:34,468 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:54:34,468 INFO ]: Start isEmpty. Operand 25 states and 28 transitions. [2018-06-26 17:54:34,469 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:54:34,469 INFO ]: Found error trace [2018-06-26 17:54:34,469 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:34,469 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:34,469 INFO ]: Analyzing trace with hash 932321789, now seen corresponding path program 17 times [2018-06-26 17:54:34,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:34,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:34,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:34,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:34,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:34,485 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:34,633 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:34,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:34,633 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:34,639 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:34,670 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:54:34,670 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:34,673 INFO ]: Computing forward predicates... [2018-06-26 17:54:34,826 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:34,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:34,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-26 17:54:34,846 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:54:34,846 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:54:34,846 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:54:34,846 INFO ]: Start difference. First operand 25 states and 28 transitions. Second operand 25 states. [2018-06-26 17:54:34,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:34,980 INFO ]: Finished difference Result 37 states and 41 transitions. [2018-06-26 17:54:34,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:34,981 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-26 17:54:34,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:34,981 INFO ]: With dead ends: 37 [2018-06-26 17:54:34,981 INFO ]: Without dead ends: 24 [2018-06-26 17:54:34,982 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:54:34,982 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:54:34,983 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:54:34,983 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:54:34,984 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-26 17:54:34,984 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2018-06-26 17:54:34,984 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:34,984 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-26 17:54:34,984 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:54:34,984 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-26 17:54:34,984 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:54:34,984 INFO ]: Found error trace [2018-06-26 17:54:34,984 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:34,984 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:34,984 INFO ]: Analyzing trace with hash 1701651290, now seen corresponding path program 18 times [2018-06-26 17:54:34,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:34,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:34,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:34,985 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:34,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:34,996 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:35,271 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:35,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:35,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:35,277 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:35,309 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:54:35,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:35,311 INFO ]: Computing forward predicates... [2018-06-26 17:54:35,412 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:35,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:35,431 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-26 17:54:35,431 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:54:35,432 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:54:35,432 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:54:35,432 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2018-06-26 17:54:35,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:35,787 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-26 17:54:35,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:54:35,788 INFO ]: Start accepts. Automaton has 23 states. Word has length 23 [2018-06-26 17:54:35,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:35,788 INFO ]: With dead ends: 33 [2018-06-26 17:54:35,788 INFO ]: Without dead ends: 26 [2018-06-26 17:54:35,789 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:35,789 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:54:35,790 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:54:35,790 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:54:35,791 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-26 17:54:35,791 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-26 17:54:35,791 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:35,791 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-26 17:54:35,791 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:54:35,791 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-26 17:54:35,791 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:54:35,791 INFO ]: Found error trace [2018-06-26 17:54:35,791 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:35,791 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:35,791 INFO ]: Analyzing trace with hash 1283341660, now seen corresponding path program 19 times [2018-06-26 17:54:35,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:35,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:35,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:35,792 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:35,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:35,812 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:36,165 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:36,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:36,165 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:36,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:36,205 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:36,209 INFO ]: Computing forward predicates... [2018-06-26 17:54:36,644 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:36,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:36,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-06-26 17:54:36,664 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:54:36,664 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:54:36,664 INFO ]: CoverageRelationStatistics Valid=66, Invalid=864, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:54:36,664 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 31 states. [2018-06-26 17:54:37,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:37,108 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-26 17:54:37,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:54:37,108 INFO ]: Start accepts. Automaton has 31 states. Word has length 25 [2018-06-26 17:54:37,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:37,109 INFO ]: With dead ends: 43 [2018-06-26 17:54:37,109 INFO ]: Without dead ends: 43 [2018-06-26 17:54:37,109 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:54:37,109 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:54:37,110 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-06-26 17:54:37,110 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:54:37,111 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-26 17:54:37,111 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2018-06-26 17:54:37,111 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:37,111 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-26 17:54:37,111 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:54:37,111 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-26 17:54:37,111 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:54:37,111 INFO ]: Found error trace [2018-06-26 17:54:37,111 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:37,111 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:37,111 INFO ]: Analyzing trace with hash -779824005, now seen corresponding path program 20 times [2018-06-26 17:54:37,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:37,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:37,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:37,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:37,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:37,124 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:37,704 INFO ]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:37,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:37,704 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:37,710 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:37,745 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:37,745 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:37,747 INFO ]: Computing forward predicates... [2018-06-26 17:54:37,948 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:37,967 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:37,967 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-26 17:54:37,967 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:54:37,967 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:54:37,967 INFO ]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:54:37,967 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 32 states. [2018-06-26 17:54:38,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:38,675 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-26 17:54:38,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-26 17:54:38,675 INFO ]: Start accepts. Automaton has 32 states. Word has length 26 [2018-06-26 17:54:38,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:38,675 INFO ]: With dead ends: 53 [2018-06-26 17:54:38,675 INFO ]: Without dead ends: 37 [2018-06-26 17:54:38,676 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=772, Invalid=2420, Unknown=0, NotChecked=0, Total=3192 [2018-06-26 17:54:38,676 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:54:38,678 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-26 17:54:38,678 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:54:38,678 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-26 17:54:38,678 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-26 17:54:38,678 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:38,678 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-26 17:54:38,678 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:54:38,678 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-26 17:54:38,679 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:54:38,679 INFO ]: Found error trace [2018-06-26 17:54:38,679 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:38,679 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:38,679 INFO ]: Analyzing trace with hash -188548456, now seen corresponding path program 21 times [2018-06-26 17:54:38,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:38,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:38,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:38,680 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:38,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:38,694 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:39,592 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:39,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:39,592 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:39,600 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:39,636 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:54:39,636 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:39,639 INFO ]: Computing forward predicates... [2018-06-26 17:54:40,258 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:40,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:40,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-26 17:54:40,278 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:54:40,278 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:54:40,278 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:54:40,278 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 25 states. [2018-06-26 17:54:40,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:40,479 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-26 17:54:40,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:40,480 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-26 17:54:40,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:40,480 INFO ]: With dead ends: 36 [2018-06-26 17:54:40,480 INFO ]: Without dead ends: 36 [2018-06-26 17:54:40,480 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:54:40,480 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:54:40,482 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-26 17:54:40,482 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:54:40,482 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-26 17:54:40,482 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-06-26 17:54:40,482 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:40,482 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-26 17:54:40,483 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:54:40,483 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-26 17:54:40,483 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:54:40,483 INFO ]: Found error trace [2018-06-26 17:54:40,483 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:40,483 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:40,483 INFO ]: Analyzing trace with hash -1550269219, now seen corresponding path program 22 times [2018-06-26 17:54:40,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:40,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:40,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:40,486 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:40,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:40,497 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,002 INFO ]: Checked inductivity of 77 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:41,002 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:41,002 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:41,008 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:41,042 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:41,042 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,044 INFO ]: Computing forward predicates... [2018-06-26 17:54:41,181 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:41,201 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:41,201 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-26 17:54:41,201 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:54:41,201 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:54:41,201 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:54:41,202 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-26 17:54:41,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:41,327 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-26 17:54:41,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:41,327 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 17:54:41,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:41,328 INFO ]: With dead ends: 37 [2018-06-26 17:54:41,328 INFO ]: Without dead ends: 29 [2018-06-26 17:54:41,328 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:54:41,328 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:54:41,330 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:54:41,330 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:54:41,330 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:54:41,330 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-26 17:54:41,330 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:41,330 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:54:41,330 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:54:41,330 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:54:41,331 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:54:41,331 INFO ]: Found error trace [2018-06-26 17:54:41,331 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:41,331 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:41,331 INFO ]: Analyzing trace with hash 152864150, now seen corresponding path program 23 times [2018-06-26 17:54:41,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:41,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:41,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,332 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:41,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,349 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,754 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:41,754 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:41,754 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:41,760 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:41,805 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 17:54:41,805 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,810 INFO ]: Computing forward predicates... [2018-06-26 17:54:42,756 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:42,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:42,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-06-26 17:54:42,775 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:54:42,775 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:54:42,775 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1115, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:54:42,776 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 35 states. [2018-06-26 17:54:43,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:43,264 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-26 17:54:43,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:54:43,264 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-26 17:54:43,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:43,265 INFO ]: With dead ends: 48 [2018-06-26 17:54:43,265 INFO ]: Without dead ends: 48 [2018-06-26 17:54:43,265 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:43,265 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 17:54:43,267 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-06-26 17:54:43,267 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:54:43,268 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-06-26 17:54:43,268 INFO ]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2018-06-26 17:54:43,268 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:43,268 INFO ]: Abstraction has 31 states and 34 transitions. [2018-06-26 17:54:43,268 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:54:43,268 INFO ]: Start isEmpty. Operand 31 states and 34 transitions. [2018-06-26 17:54:43,269 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:54:43,269 INFO ]: Found error trace [2018-06-26 17:54:43,269 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:43,269 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:43,269 INFO ]: Analyzing trace with hash 1410391037, now seen corresponding path program 24 times [2018-06-26 17:54:43,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:43,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:43,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:43,270 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:43,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:43,283 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:43,915 INFO ]: Checked inductivity of 92 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:43,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:43,915 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:43,921 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:43,959 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 17:54:43,959 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:43,962 INFO ]: Computing forward predicates... [2018-06-26 17:54:44,193 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:44,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:44,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-26 17:54:44,212 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:54:44,212 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:54:44,213 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:54:44,213 INFO ]: Start difference. First operand 31 states and 34 transitions. Second operand 36 states. [2018-06-26 17:54:44,911 WARN ]: Spent 388.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-26 17:54:45,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:45,463 INFO ]: Finished difference Result 59 states and 65 transitions. [2018-06-26 17:54:45,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 17:54:45,463 INFO ]: Start accepts. Automaton has 36 states. Word has length 29 [2018-06-26 17:54:45,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:45,463 INFO ]: With dead ends: 59 [2018-06-26 17:54:45,463 INFO ]: Without dead ends: 41 [2018-06-26 17:54:45,464 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-06-26 17:54:45,464 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:54:45,466 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-26 17:54:45,466 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:54:45,466 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-26 17:54:45,466 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-26 17:54:45,466 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:45,466 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-26 17:54:45,466 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:54:45,466 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-26 17:54:45,467 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:54:45,467 INFO ]: Found error trace [2018-06-26 17:54:45,467 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:45,467 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:45,467 INFO ]: Analyzing trace with hash -1604456742, now seen corresponding path program 25 times [2018-06-26 17:54:45,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:45,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:45,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:45,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:45,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:45,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:45,703 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:45,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:45,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:45,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:45,752 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:45,754 INFO ]: Computing forward predicates... [2018-06-26 17:54:46,212 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:46,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:46,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-26 17:54:46,232 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:54:46,232 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:54:46,232 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:54:46,232 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 28 states. [2018-06-26 17:54:46,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:46,384 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-26 17:54:46,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:54:46,387 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-26 17:54:46,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:46,387 INFO ]: With dead ends: 40 [2018-06-26 17:54:46,387 INFO ]: Without dead ends: 40 [2018-06-26 17:54:46,388 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:54:46,388 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:54:46,390 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-06-26 17:54:46,390 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:54:46,390 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-26 17:54:46,390 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2018-06-26 17:54:46,390 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:46,390 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-26 17:54:46,390 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:54:46,390 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-26 17:54:46,391 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:54:46,391 INFO ]: Found error trace [2018-06-26 17:54:46,391 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:46,391 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:46,391 INFO ]: Analyzing trace with hash 1801214171, now seen corresponding path program 26 times [2018-06-26 17:54:46,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:46,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:46,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:46,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:46,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:46,404 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:46,706 INFO ]: Checked inductivity of 100 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:46,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:46,706 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:46,713 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:46,749 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:46,749 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:46,752 INFO ]: Computing forward predicates... [2018-06-26 17:54:47,144 INFO ]: Checked inductivity of 100 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:47,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:47,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-26 17:54:47,163 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:54:47,163 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:54:47,164 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:54:47,164 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 36 states. [2018-06-26 17:54:47,815 WARN ]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-26 17:54:48,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:48,026 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-26 17:54:48,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:54:48,027 INFO ]: Start accepts. Automaton has 36 states. Word has length 30 [2018-06-26 17:54:48,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:48,027 INFO ]: With dead ends: 41 [2018-06-26 17:54:48,027 INFO ]: Without dead ends: 32 [2018-06-26 17:54:48,028 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 17:54:48,028 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:54:48,029 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:54:48,029 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:54:48,029 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-26 17:54:48,029 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-26 17:54:48,029 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:48,029 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-26 17:54:48,029 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:54:48,029 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-26 17:54:48,029 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:54:48,029 INFO ]: Found error trace [2018-06-26 17:54:48,029 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:48,029 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:48,029 INFO ]: Analyzing trace with hash -91015076, now seen corresponding path program 27 times [2018-06-26 17:54:48,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:48,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:48,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:48,030 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:48,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:48,052 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:48,593 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:48,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:48,594 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:48,599 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:48,642 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:54:48,642 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:48,649 INFO ]: Computing forward predicates... [2018-06-26 17:54:49,756 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:49,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:49,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 48 [2018-06-26 17:54:49,856 INFO ]: Interpolant automaton has 48 states [2018-06-26 17:54:49,856 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-26 17:54:49,857 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2154, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 17:54:49,857 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 48 states. [2018-06-26 17:54:51,137 WARN ]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-06-26 17:54:52,084 WARN ]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-06-26 17:54:52,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:52,857 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-26 17:54:52,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:54:52,858 INFO ]: Start accepts. Automaton has 48 states. Word has length 31 [2018-06-26 17:54:52,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:52,858 INFO ]: With dead ends: 63 [2018-06-26 17:54:52,858 INFO ]: Without dead ends: 53 [2018-06-26 17:54:52,859 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=471, Invalid=4221, Unknown=0, NotChecked=0, Total=4692 [2018-06-26 17:54:52,859 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 17:54:52,861 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-06-26 17:54:52,861 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:54:52,861 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-26 17:54:52,861 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2018-06-26 17:54:52,861 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:52,861 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-26 17:54:52,861 INFO ]: Interpolant automaton has 48 states. [2018-06-26 17:54:52,862 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-26 17:54:52,871 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:54:52,871 INFO ]: Found error trace [2018-06-26 17:54:52,871 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:52,871 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:52,871 INFO ]: Analyzing trace with hash 1379420411, now seen corresponding path program 28 times [2018-06-26 17:54:52,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:52,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:52,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:52,872 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:52,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:52,886 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:53,385 INFO ]: Checked inductivity of 117 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:53,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:53,385 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:53,390 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:53,431 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:53,431 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:53,434 INFO ]: Computing forward predicates... [2018-06-26 17:54:53,691 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:53,712 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:53,712 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-26 17:54:53,712 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:54:53,712 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:54:53,712 INFO ]: CoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:54:53,712 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 34 states. [2018-06-26 17:54:53,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:53,893 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-26 17:54:53,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:54:53,893 INFO ]: Start accepts. Automaton has 34 states. Word has length 32 [2018-06-26 17:54:53,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:53,893 INFO ]: With dead ends: 52 [2018-06-26 17:54:53,893 INFO ]: Without dead ends: 33 [2018-06-26 17:54:53,894 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=470, Invalid=1510, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:54:53,894 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:54:53,896 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:54:53,896 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:54:53,896 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-26 17:54:53,896 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 32 [2018-06-26 17:54:53,896 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:53,896 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-26 17:54:53,896 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:54:53,896 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-26 17:54:53,896 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:54:53,896 INFO ]: Found error trace [2018-06-26 17:54:53,896 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:53,897 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:53,897 INFO ]: Analyzing trace with hash -1081337704, now seen corresponding path program 29 times [2018-06-26 17:54:53,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:53,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:53,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:53,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:53,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:53,908 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:54,227 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:54,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:54,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:54,233 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:54,276 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 17:54:54,276 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:54,280 INFO ]: Computing forward predicates... [2018-06-26 17:54:54,424 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:54:54,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:54,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-26 17:54:54,443 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:54:54,444 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:54:54,444 INFO ]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:54:54,444 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 31 states. [2018-06-26 17:54:54,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:54,642 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-26 17:54:54,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:54:54,643 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-26 17:54:54,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:54,643 INFO ]: With dead ends: 34 [2018-06-26 17:54:54,643 INFO ]: Without dead ends: 34 [2018-06-26 17:54:54,644 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:54:54,644 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:54:54,645 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:54:54,645 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:54:54,645 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-26 17:54:54,645 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2018-06-26 17:54:54,645 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:54,645 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-26 17:54:54,645 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:54:54,645 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-26 17:54:54,645 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:54:54,645 INFO ]: Found error trace [2018-06-26 17:54:54,645 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:54,645 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:54,646 INFO ]: Analyzing trace with hash 838035165, now seen corresponding path program 30 times [2018-06-26 17:54:54,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:54,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:54,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:54,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:54,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:54,655 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:54,845 INFO ]: Checked inductivity of 126 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:54:54,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:54,863 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:54,877 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:54,920 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 17:54:54,921 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:54,923 INFO ]: Computing forward predicates... [2018-06-26 17:54:55,201 INFO ]: Checked inductivity of 126 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:54:55,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:55,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-26 17:54:55,220 INFO ]: Interpolant automaton has 40 states [2018-06-26 17:54:55,220 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 17:54:55,221 INFO ]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:54:55,221 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 40 states. [2018-06-26 17:54:55,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:55,804 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-26 17:54:55,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:54:55,804 INFO ]: Start accepts. Automaton has 40 states. Word has length 33 [2018-06-26 17:54:55,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:55,805 INFO ]: With dead ends: 45 [2018-06-26 17:54:55,805 INFO ]: Without dead ends: 35 [2018-06-26 17:54:55,805 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=807, Invalid=2733, Unknown=0, NotChecked=0, Total=3540 [2018-06-26 17:54:55,805 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:54:55,806 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:54:55,806 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:54:55,807 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-26 17:54:55,807 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-26 17:54:55,807 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:55,807 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-26 17:54:55,807 INFO ]: Interpolant automaton has 40 states. [2018-06-26 17:54:55,807 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-26 17:54:55,808 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:54:55,808 INFO ]: Found error trace [2018-06-26 17:54:55,808 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:55,808 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:55,808 INFO ]: Analyzing trace with hash 1594819606, now seen corresponding path program 31 times [2018-06-26 17:54:55,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:55,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:55,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:55,809 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:55,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:55,826 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:56,399 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:54:56,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:56,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:56,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:56,447 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:56,452 INFO ]: Computing forward predicates... [2018-06-26 17:54:57,177 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:54:57,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:57,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-06-26 17:54:57,196 INFO ]: Interpolant automaton has 43 states [2018-06-26 17:54:57,196 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 17:54:57,196 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1713, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:57,197 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 43 states. [2018-06-26 17:54:57,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:57,955 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-26 17:54:57,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:54:57,955 INFO ]: Start accepts. Automaton has 43 states. Word has length 34 [2018-06-26 17:54:57,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:57,955 INFO ]: With dead ends: 58 [2018-06-26 17:54:57,955 INFO ]: Without dead ends: 58 [2018-06-26 17:54:57,956 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 17:54:57,956 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 17:54:57,957 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-06-26 17:54:57,957 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:54:57,957 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-26 17:54:57,958 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-06-26 17:54:57,958 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:57,958 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-26 17:54:57,958 INFO ]: Interpolant automaton has 43 states. [2018-06-26 17:54:57,958 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-26 17:54:57,958 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:54:57,958 INFO ]: Found error trace [2018-06-26 17:54:57,958 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:57,958 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:57,958 INFO ]: Analyzing trace with hash -714666499, now seen corresponding path program 32 times [2018-06-26 17:54:57,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:57,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:57,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:57,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:57,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:57,973 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:58,307 INFO ]: Checked inductivity of 145 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:54:58,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:58,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:58,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:58,354 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:58,354 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:58,357 INFO ]: Computing forward predicates... [2018-06-26 17:54:58,747 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:54:58,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:58,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-06-26 17:54:58,766 INFO ]: Interpolant automaton has 44 states [2018-06-26 17:54:58,766 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-26 17:54:58,766 INFO ]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:54:58,766 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 44 states. [2018-06-26 17:55:00,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:00,125 INFO ]: Finished difference Result 71 states and 77 transitions. [2018-06-26 17:55:00,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-26 17:55:00,151 INFO ]: Start accepts. Automaton has 44 states. Word has length 35 [2018-06-26 17:55:00,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:00,151 INFO ]: With dead ends: 71 [2018-06-26 17:55:00,151 INFO ]: Without dead ends: 49 [2018-06-26 17:55:00,152 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1423, Invalid=4583, Unknown=0, NotChecked=0, Total=6006 [2018-06-26 17:55:00,152 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 17:55:00,153 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-06-26 17:55:00,153 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:55:00,154 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-26 17:55:00,154 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-26 17:55:00,154 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:00,154 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-26 17:55:00,154 INFO ]: Interpolant automaton has 44 states. [2018-06-26 17:55:00,154 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-26 17:55:00,154 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:55:00,154 INFO ]: Found error trace [2018-06-26 17:55:00,154 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:00,154 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:00,154 INFO ]: Analyzing trace with hash 1023765082, now seen corresponding path program 33 times [2018-06-26 17:55:00,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:00,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:00,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:00,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:00,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:00,167 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:00,757 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:00,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:00,757 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:00,762 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:00,810 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:55:00,810 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:00,813 INFO ]: Computing forward predicates... [2018-06-26 17:55:01,002 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:01,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:01,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-26 17:55:01,030 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:55:01,030 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:55:01,030 INFO ]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:55:01,030 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 35 states. [2018-06-26 17:55:01,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:01,722 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-26 17:55:01,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-26 17:55:01,722 INFO ]: Start accepts. Automaton has 35 states. Word has length 35 [2018-06-26 17:55:01,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:01,722 INFO ]: With dead ends: 49 [2018-06-26 17:55:01,722 INFO ]: Without dead ends: 38 [2018-06-26 17:55:01,723 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1278, Invalid=3144, Unknown=0, NotChecked=0, Total=4422 [2018-06-26 17:55:01,723 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:55:01,724 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:55:01,724 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:55:01,724 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-26 17:55:01,724 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-26 17:55:01,724 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:01,724 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-26 17:55:01,724 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:55:01,724 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-26 17:55:01,724 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:55:01,724 INFO ]: Found error trace [2018-06-26 17:55:01,724 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:01,724 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:01,725 INFO ]: Analyzing trace with hash 292356956, now seen corresponding path program 34 times [2018-06-26 17:55:01,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:01,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:01,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:01,725 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:01,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:01,744 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:02,353 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:02,353 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:02,353 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:02,359 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:02,408 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:02,408 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:02,417 INFO ]: Computing forward predicates... [2018-06-26 17:55:03,332 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:03,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:03,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-06-26 17:55:03,351 INFO ]: Interpolant automaton has 47 states [2018-06-26 17:55:03,351 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-26 17:55:03,351 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2060, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:55:03,352 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 47 states. [2018-06-26 17:55:04,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:04,255 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-26 17:55:04,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:55:04,255 INFO ]: Start accepts. Automaton has 47 states. Word has length 37 [2018-06-26 17:55:04,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:04,255 INFO ]: With dead ends: 63 [2018-06-26 17:55:04,255 INFO ]: Without dead ends: 63 [2018-06-26 17:55:04,255 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 17:55:04,255 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-26 17:55:04,256 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 40. [2018-06-26 17:55:04,256 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:55:04,256 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-26 17:55:04,256 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2018-06-26 17:55:04,256 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:04,256 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-26 17:55:04,256 INFO ]: Interpolant automaton has 47 states. [2018-06-26 17:55:04,256 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-26 17:55:04,257 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:55:04,257 INFO ]: Found error trace [2018-06-26 17:55:04,257 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:04,257 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:04,257 INFO ]: Analyzing trace with hash 482020731, now seen corresponding path program 35 times [2018-06-26 17:55:04,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:04,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:04,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:04,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:04,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:04,269 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:04,554 INFO ]: Checked inductivity of 176 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:04,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:04,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:04,560 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:04,622 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:55:04,623 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:04,628 INFO ]: Computing forward predicates... [2018-06-26 17:55:05,032 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:05,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:05,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-26 17:55:05,052 INFO ]: Interpolant automaton has 48 states [2018-06-26 17:55:05,052 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-26 17:55:05,053 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 17:55:05,053 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 48 states. [2018-06-26 17:55:06,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:06,385 INFO ]: Finished difference Result 77 states and 83 transitions. [2018-06-26 17:55:06,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-26 17:55:06,386 INFO ]: Start accepts. Automaton has 48 states. Word has length 38 [2018-06-26 17:55:06,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:06,386 INFO ]: With dead ends: 77 [2018-06-26 17:55:06,386 INFO ]: Without dead ends: 53 [2018-06-26 17:55:06,387 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1684, Invalid=5456, Unknown=0, NotChecked=0, Total=7140 [2018-06-26 17:55:06,387 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 17:55:06,388 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-26 17:55:06,388 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:55:06,388 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-26 17:55:06,388 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-26 17:55:06,388 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:06,388 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-26 17:55:06,388 INFO ]: Interpolant automaton has 48 states. [2018-06-26 17:55:06,388 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-26 17:55:06,388 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:55:06,388 INFO ]: Found error trace [2018-06-26 17:55:06,388 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:06,388 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:06,388 INFO ]: Analyzing trace with hash 372491928, now seen corresponding path program 36 times [2018-06-26 17:55:06,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:06,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:06,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:06,389 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:06,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:06,402 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:06,721 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:06,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:06,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:06,727 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:06,781 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:55:06,781 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:06,785 INFO ]: Computing forward predicates... [2018-06-26 17:55:07,016 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:07,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:07,036 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-26 17:55:07,036 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:55:07,036 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:55:07,037 INFO ]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:55:07,037 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 38 states. [2018-06-26 17:55:07,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:07,763 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-26 17:55:07,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 17:55:07,763 INFO ]: Start accepts. Automaton has 38 states. Word has length 38 [2018-06-26 17:55:07,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:07,763 INFO ]: With dead ends: 53 [2018-06-26 17:55:07,763 INFO ]: Without dead ends: 41 [2018-06-26 17:55:07,764 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1514, Invalid=3742, Unknown=0, NotChecked=0, Total=5256 [2018-06-26 17:55:07,764 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:55:07,765 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:55:07,765 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:55:07,765 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-26 17:55:07,765 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-26 17:55:07,765 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:07,765 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-26 17:55:07,765 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:55:07,765 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-26 17:55:07,765 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:55:07,765 INFO ]: Found error trace [2018-06-26 17:55:07,765 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:07,765 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:07,766 INFO ]: Analyzing trace with hash 1757803158, now seen corresponding path program 37 times [2018-06-26 17:55:07,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:07,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:07,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:07,766 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:07,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:07,785 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:08,755 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:08,755 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:08,755 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:08,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:08,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:08,823 INFO ]: Computing forward predicates... [2018-06-26 17:55:09,791 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:09,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:09,810 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-06-26 17:55:09,810 INFO ]: Interpolant automaton has 51 states [2018-06-26 17:55:09,810 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-26 17:55:09,810 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2439, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:55:09,810 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 51 states. [2018-06-26 17:55:10,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:10,758 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-26 17:55:10,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:55:10,758 INFO ]: Start accepts. Automaton has 51 states. Word has length 40 [2018-06-26 17:55:10,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:10,759 INFO ]: With dead ends: 68 [2018-06-26 17:55:10,759 INFO ]: Without dead ends: 68 [2018-06-26 17:55:10,759 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-06-26 17:55:10,759 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 17:55:10,760 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 43. [2018-06-26 17:55:10,760 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 17:55:10,760 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-06-26 17:55:10,760 INFO ]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-06-26 17:55:10,760 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:10,760 INFO ]: Abstraction has 43 states and 46 transitions. [2018-06-26 17:55:10,760 INFO ]: Interpolant automaton has 51 states. [2018-06-26 17:55:10,760 INFO ]: Start isEmpty. Operand 43 states and 46 transitions. [2018-06-26 17:55:10,761 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 17:55:10,761 INFO ]: Found error trace [2018-06-26 17:55:10,761 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:10,761 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:10,761 INFO ]: Analyzing trace with hash -1060065283, now seen corresponding path program 38 times [2018-06-26 17:55:10,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:10,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:10,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:10,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:10,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:10,775 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:11,080 INFO ]: Checked inductivity of 210 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:11,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:11,080 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:11,085 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:11,151 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:11,151 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:11,154 INFO ]: Computing forward predicates... [2018-06-26 17:55:11,699 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:11,718 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:11,718 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-06-26 17:55:11,718 INFO ]: Interpolant automaton has 52 states [2018-06-26 17:55:11,718 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-26 17:55:11,718 INFO ]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 17:55:11,718 INFO ]: Start difference. First operand 43 states and 46 transitions. Second operand 52 states. [2018-06-26 17:55:13,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:13,223 INFO ]: Finished difference Result 83 states and 89 transitions. [2018-06-26 17:55:13,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-26 17:55:13,224 INFO ]: Start accepts. Automaton has 52 states. Word has length 41 [2018-06-26 17:55:13,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:13,224 INFO ]: With dead ends: 83 [2018-06-26 17:55:13,224 INFO ]: Without dead ends: 57 [2018-06-26 17:55:13,224 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1967, Invalid=6405, Unknown=0, NotChecked=0, Total=8372 [2018-06-26 17:55:13,224 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 17:55:13,225 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-26 17:55:13,225 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 17:55:13,225 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-26 17:55:13,225 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-26 17:55:13,225 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:13,226 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-26 17:55:13,226 INFO ]: Interpolant automaton has 52 states. [2018-06-26 17:55:13,226 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-26 17:55:13,226 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 17:55:13,226 INFO ]: Found error trace [2018-06-26 17:55:13,226 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:13,226 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:13,226 INFO ]: Analyzing trace with hash 1056937434, now seen corresponding path program 39 times [2018-06-26 17:55:13,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:13,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:13,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:13,227 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:13,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:13,241 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:14,034 INFO ]: Checked inductivity of 210 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:14,034 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:14,034 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:14,039 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:14,096 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:55:14,096 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:14,101 INFO ]: Computing forward predicates... [2018-06-26 17:55:14,355 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:14,374 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:14,374 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-26 17:55:14,374 INFO ]: Interpolant automaton has 41 states [2018-06-26 17:55:14,374 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 17:55:14,374 INFO ]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:55:14,374 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 41 states. [2018-06-26 17:55:15,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:15,194 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-26 17:55:15,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-26 17:55:15,194 INFO ]: Start accepts. Automaton has 41 states. Word has length 41 [2018-06-26 17:55:15,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:15,194 INFO ]: With dead ends: 57 [2018-06-26 17:55:15,194 INFO ]: Without dead ends: 44 [2018-06-26 17:55:15,195 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=4392, Unknown=0, NotChecked=0, Total=6162 [2018-06-26 17:55:15,195 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 17:55:15,196 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-26 17:55:15,196 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 17:55:15,196 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-26 17:55:15,196 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-26 17:55:15,196 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:15,196 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-26 17:55:15,196 INFO ]: Interpolant automaton has 41 states. [2018-06-26 17:55:15,196 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-26 17:55:15,197 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 17:55:15,197 INFO ]: Found error trace [2018-06-26 17:55:15,197 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:15,197 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:15,197 INFO ]: Analyzing trace with hash -2019582372, now seen corresponding path program 40 times [2018-06-26 17:55:15,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:15,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:15,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:15,197 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:15,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:15,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:15,904 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-26 17:55:15,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:15,997 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:16,003 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:16,059 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:16,059 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:16,066 INFO ]: Computing forward predicates... [2018-06-26 17:55:17,182 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-26 17:55:17,201 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:17,201 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2018-06-26 17:55:17,201 INFO ]: Interpolant automaton has 55 states [2018-06-26 17:55:17,201 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-26 17:55:17,201 INFO ]: CoverageRelationStatistics Valid=120, Invalid=2850, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 17:55:17,202 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 55 states. [2018-06-26 17:55:18,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:18,264 INFO ]: Finished difference Result 73 states and 78 transitions. [2018-06-26 17:55:18,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:55:18,264 INFO ]: Start accepts. Automaton has 55 states. Word has length 43 [2018-06-26 17:55:18,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:18,265 INFO ]: With dead ends: 73 [2018-06-26 17:55:18,265 INFO ]: Without dead ends: 73 [2018-06-26 17:55:18,265 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-06-26 17:55:18,265 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 17:55:18,266 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 46. [2018-06-26 17:55:18,266 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-26 17:55:18,267 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-06-26 17:55:18,268 INFO ]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 43 [2018-06-26 17:55:18,268 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:18,268 INFO ]: Abstraction has 46 states and 49 transitions. [2018-06-26 17:55:18,268 INFO ]: Interpolant automaton has 55 states. [2018-06-26 17:55:18,268 INFO ]: Start isEmpty. Operand 46 states and 49 transitions. [2018-06-26 17:55:18,268 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 17:55:18,268 INFO ]: Found error trace [2018-06-26 17:55:18,268 INFO ]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:18,268 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:18,268 INFO ]: Analyzing trace with hash 1995514363, now seen corresponding path program 41 times [2018-06-26 17:55:18,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:18,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:18,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:18,269 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:18,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:18,281 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 17:55:18,531 WARN ]: Verification canceled [2018-06-26 17:55:18,533 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:55:18,534 WARN ]: Timeout [2018-06-26 17:55:18,534 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:55:18 BasicIcfg [2018-06-26 17:55:18,534 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:55:18,537 INFO ]: Toolchain (without parser) took 59287.66 ms. Allocated memory was 301.5 MB in the beginning and 824.7 MB in the end (delta: 523.2 MB). Free memory was 257.8 MB in the beginning and 482.5 MB in the end (delta: -224.7 MB). Peak memory consumption was 298.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:18,538 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 301.5 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:55:18,538 INFO ]: ChcToBoogie took 58.17 ms. Allocated memory is still 301.5 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:18,538 INFO ]: Boogie Preprocessor took 35.33 ms. Allocated memory is still 301.5 MB. Free memory was 254.8 MB in the beginning and 253.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-26 17:55:18,538 INFO ]: RCFGBuilder took 266.18 ms. Allocated memory is still 301.5 MB. Free memory was 253.8 MB in the beginning and 244.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:18,539 INFO ]: BlockEncodingV2 took 83.91 ms. Allocated memory is still 301.5 MB. Free memory was 244.8 MB in the beginning and 241.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:18,539 INFO ]: TraceAbstraction took 58831.20 ms. Allocated memory was 301.5 MB in the beginning and 824.7 MB in the end (delta: 523.2 MB). Free memory was 241.8 MB in the beginning and 482.5 MB in the end (delta: -240.7 MB). Peak memory consumption was 282.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:18,545 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 16 edges - StatisticsResult: Encoded RCFG 8 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 301.5 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.17 ms. Allocated memory is still 301.5 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.33 ms. Allocated memory is still 301.5 MB. Free memory was 254.8 MB in the beginning and 253.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 266.18 ms. Allocated memory is still 301.5 MB. Free memory was 253.8 MB in the beginning and 244.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 83.91 ms. Allocated memory is still 301.5 MB. Free memory was 244.8 MB in the beginning and 241.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58831.20 ms. Allocated memory was 301.5 MB in the beginning and 824.7 MB in the end (delta: 523.2 MB). Free memory was 241.8 MB in the beginning and 482.5 MB in the end (delta: -240.7 MB). Peak memory consumption was 282.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 43 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 58.7s OverallTime, 45 OverallIterations, 13 TraceHistogramMax, 24.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 927 SDslu, 4067 SDs, 0 SdLazy, 11786 SolverSat, 1897 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2534 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 1700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14527 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=44, 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.0s AutomataMinimizationTime, 44 MinimizatonAttempts, 285 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 2005 ConstructedInterpolants, 88 QuantifiedInterpolants, 350151 SizeOfPredicates, 281 NumberOfNonLiveVariables, 13240 ConjunctsInSsa, 3205 ConjunctsInUnsatCore, 85 InterpolantComputations, 4 PerfectInterpolantSequences, 3568/6631 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-55-18-556.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-55-18-556.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-55-18-556.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-55-18-556.csv Completed graceful shutdown