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/HOLA/23.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:42:27,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:42:27,798 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:42:27,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:42:27,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:42:27,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:42:27,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:42:27,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:42:27,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:42:27,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:42:27,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:42:27,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:42:27,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:42:27,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:42:27,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:42:27,826 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:42:27,827 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:42:27,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:42:27,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:42:27,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:42:27,838 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:42:27,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:42:27,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:42:27,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:42:27,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:42:27,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:42:27,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:42:27,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:42:27,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:42:27,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:42:27,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:42:27,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:42:27,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:42:27,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:42:27,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:42:27,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:42:27,855 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:42:27,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:42:27,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:42:27,876 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:42:27,876 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:42:27,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:42:27,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:42:27,884 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:42:27,884 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:42:27,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:42:27,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:42:27,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:42:27,885 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:42:27,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:42:27,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:42:27,885 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:42:27,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:42:27,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:42:27,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:42:27,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:42:27,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:42:27,886 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:42:27,889 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:42:27,889 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:42:27,928 INFO ]: Repository-Root is: /tmp [2018-06-26 17:42:27,942 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:42:27,948 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:42:27,949 INFO ]: Initializing SmtParser... [2018-06-26 17:42:27,950 INFO ]: SmtParser initialized [2018-06-26 17:42:27,950 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 [2018-06-26 17:42:27,954 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:42:28,041 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 unknown [2018-06-26 17:42:28,355 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 [2018-06-26 17:42:28,360 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:42:28,366 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:42:28,366 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:42:28,366 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:42:28,367 INFO ]: ChcToBoogie initialized [2018-06-26 17:42:28,370 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,430 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28 Unit [2018-06-26 17:42:28,430 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:42:28,431 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:42:28,431 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:42:28,431 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:42:28,447 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,447 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,452 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,452 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,459 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,461 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,462 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,464 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:42:28,465 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:42:28,465 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:42:28,465 INFO ]: RCFGBuilder initialized [2018-06-26 17:42:28,466 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:42:28,475 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:42:28,475 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:42:28,475 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:42:28,475 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:42:28,475 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:42:28,475 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 17:42:28,876 INFO ]: Using library mode [2018-06-26 17:42:28,876 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:42:28 BoogieIcfgContainer [2018-06-26 17:42:28,877 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:42:28,877 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:42:28,877 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:42:28,878 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:42:28,879 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:42:28" (1/1) ... [2018-06-26 17:42:28,894 INFO ]: Initial Icfg 25 locations, 25 edges [2018-06-26 17:42:28,896 INFO ]: Using Remove infeasible edges [2018-06-26 17:42:28,896 INFO ]: Using Maximize final states [2018-06-26 17:42:28,897 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:42:28,897 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:42:28,901 INFO ]: Using Remove sink states [2018-06-26 17:42:28,902 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:42:28,902 INFO ]: Using Use SBE [2018-06-26 17:42:28,912 INFO ]: SBE split 0 edges [2018-06-26 17:42:28,924 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:42:28,925 INFO ]: 0 new accepting states [2018-06-26 17:42:29,247 INFO ]: Removed 35 edges and 17 locations by large block encoding [2018-06-26 17:42:29,249 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:42:29,255 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:42:29,255 INFO ]: 0 new accepting states [2018-06-26 17:42:29,256 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:42:29,256 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:42:29,256 INFO ]: Encoded RCFG 6 locations, 6 edges [2018-06-26 17:42:29,256 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:42:29 BasicIcfg [2018-06-26 17:42:29,256 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:42:29,257 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:42:29,257 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:42:29,261 INFO ]: TraceAbstraction initialized [2018-06-26 17:42:29,261 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:42:28" (1/4) ... [2018-06-26 17:42:29,262 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b81099b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:42:29, skipping insertion in model container [2018-06-26 17:42:29,262 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:42:28" (2/4) ... [2018-06-26 17:42:29,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b81099b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:42:29, skipping insertion in model container [2018-06-26 17:42:29,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:42:28" (3/4) ... [2018-06-26 17:42:29,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b81099b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:42:29, skipping insertion in model container [2018-06-26 17:42:29,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:42:29" (4/4) ... [2018-06-26 17:42:29,264 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:42:29,273 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:42:29,282 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:42:29,330 INFO ]: Using default assertion order modulation [2018-06-26 17:42:29,331 INFO ]: Interprodecural is true [2018-06-26 17:42:29,331 INFO ]: Hoare is false [2018-06-26 17:42:29,331 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:42:29,331 INFO ]: Backedges is TWOTRACK [2018-06-26 17:42:29,331 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:42:29,331 INFO ]: Difference is false [2018-06-26 17:42:29,331 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:42:29,331 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:42:29,346 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 17:42:29,366 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:42:29,366 INFO ]: Found error trace [2018-06-26 17:42:29,367 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:42:29,367 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:29,374 INFO ]: Analyzing trace with hash 33287883, now seen corresponding path program 1 times [2018-06-26 17:42:29,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:29,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:29,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:29,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:29,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:29,500 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:29,617 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:42:29,618 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:42:29,618 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:42:29,620 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:42:29,633 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:42:29,634 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:42:29,636 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 17:42:29,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:29,703 INFO ]: Finished difference Result 7 states and 7 transitions. [2018-06-26 17:42:29,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:42:29,704 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:42:29,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:29,711 INFO ]: With dead ends: 7 [2018-06-26 17:42:29,711 INFO ]: Without dead ends: 7 [2018-06-26 17:42:29,712 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:42:29,725 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:42:29,742 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:42:29,744 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:42:29,744 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-26 17:42:29,746 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-06-26 17:42:29,746 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:29,746 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-26 17:42:29,746 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:42:29,746 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-26 17:42:29,746 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:42:29,746 INFO ]: Found error trace [2018-06-26 17:42:29,746 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:42:29,746 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:29,746 INFO ]: Analyzing trace with hash 1031703457, now seen corresponding path program 1 times [2018-06-26 17:42:29,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:29,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:29,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:29,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:29,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:29,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:29,913 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:42:29,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:29,913 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:42:29,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:30,071 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:30,083 INFO ]: Computing forward predicates... [2018-06-26 17:42:30,132 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:42:30,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:30,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 17:42:30,169 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:42:30,169 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:42:30,169 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:42:30,170 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-06-26 17:42:30,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:30,281 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-26 17:42:30,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:42:30,282 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:42:30,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:30,282 INFO ]: With dead ends: 8 [2018-06-26 17:42:30,282 INFO ]: Without dead ends: 8 [2018-06-26 17:42:30,283 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:42:30,283 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:42:30,284 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:42:30,284 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:42:30,284 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-26 17:42:30,285 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-26 17:42:30,285 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:30,285 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-26 17:42:30,285 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:42:30,285 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-26 17:42:30,285 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:42:30,285 INFO ]: Found error trace [2018-06-26 17:42:30,285 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 17:42:30,285 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:30,285 INFO ]: Analyzing trace with hash 1917815179, now seen corresponding path program 2 times [2018-06-26 17:42:30,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:30,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:30,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:30,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:30,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:30,340 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:30,482 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:30,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:30,483 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:42:30,501 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:42:30,594 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:42:30,641 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:30,646 INFO ]: Computing forward predicates... [2018-06-26 17:42:30,726 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:30,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:30,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:42:30,751 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:42:30,751 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:42:30,751 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:42:30,751 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-26 17:42:30,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:30,809 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-26 17:42:30,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:42:30,809 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:42:30,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:30,810 INFO ]: With dead ends: 9 [2018-06-26 17:42:30,810 INFO ]: Without dead ends: 9 [2018-06-26 17:42:30,810 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:42:30,810 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:42:30,811 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:42:30,811 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:42:30,812 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-26 17:42:30,812 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-26 17:42:30,812 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:30,812 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-26 17:42:30,812 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:42:30,812 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-26 17:42:30,812 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:42:30,812 INFO ]: Found error trace [2018-06-26 17:42:30,812 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 17:42:30,812 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:30,813 INFO ]: Analyzing trace with hash -677492511, now seen corresponding path program 3 times [2018-06-26 17:42:30,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:30,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:30,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:30,814 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:30,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:30,849 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:31,109 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:31,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:31,109 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:42:31,121 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:42:31,228 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:42:31,228 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:31,233 INFO ]: Computing forward predicates... [2018-06-26 17:42:31,542 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:31,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:31,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:42:31,576 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:42:31,576 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:42:31,576 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:42:31,576 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-26 17:42:31,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:31,706 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-26 17:42:31,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:42:31,707 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 17:42:31,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:31,707 INFO ]: With dead ends: 10 [2018-06-26 17:42:31,707 INFO ]: Without dead ends: 10 [2018-06-26 17:42:31,708 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:42:31,708 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:42:31,709 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:42:31,709 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:42:31,709 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-26 17:42:31,709 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-26 17:42:31,710 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:31,710 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-26 17:42:31,710 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:42:31,710 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-26 17:42:31,710 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:42:31,710 INFO ]: Found error trace [2018-06-26 17:42:31,710 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 17:42:31,711 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:31,711 INFO ]: Analyzing trace with hash 472347723, now seen corresponding path program 4 times [2018-06-26 17:42:31,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:31,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:31,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:31,712 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:31,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:31,743 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:32,016 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:32,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:32,016 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:42:32,024 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:42:32,112 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:42:32,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:32,121 INFO ]: Computing forward predicates... [2018-06-26 17:42:32,412 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:32,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:32,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:42:32,433 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:42:32,434 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:42:32,434 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:42:32,434 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-26 17:42:32,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:32,490 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-26 17:42:32,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:42:32,491 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 17:42:32,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:32,491 INFO ]: With dead ends: 11 [2018-06-26 17:42:32,491 INFO ]: Without dead ends: 11 [2018-06-26 17:42:32,492 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:42:32,492 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:42:32,494 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:42:32,494 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:42:32,495 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-26 17:42:32,495 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-26 17:42:32,495 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:32,495 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-26 17:42:32,495 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:42:32,495 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-26 17:42:32,495 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:42:32,495 INFO ]: Found error trace [2018-06-26 17:42:32,495 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-26 17:42:32,495 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:32,495 INFO ]: Analyzing trace with hash 1757656609, now seen corresponding path program 5 times [2018-06-26 17:42:32,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:32,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:32,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:32,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:32,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:32,527 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:32,798 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:32,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:32,798 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:42:32,816 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:42:32,917 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:42:32,917 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:32,922 INFO ]: Computing forward predicates... [2018-06-26 17:42:33,074 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:33,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:33,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 17:42:33,107 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:42:33,107 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:42:33,107 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:42:33,107 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-26 17:42:33,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:33,168 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-26 17:42:33,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:42:33,169 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 17:42:33,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:33,170 INFO ]: With dead ends: 12 [2018-06-26 17:42:33,170 INFO ]: Without dead ends: 12 [2018-06-26 17:42:33,170 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:42:33,170 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:42:33,171 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:42:33,171 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:42:33,172 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-26 17:42:33,172 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-26 17:42:33,172 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:33,172 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-26 17:42:33,172 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:42:33,172 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-26 17:42:33,172 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:42:33,172 INFO ]: Found error trace [2018-06-26 17:42:33,172 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-26 17:42:33,172 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:33,172 INFO ]: Analyzing trace with hash -1347440885, now seen corresponding path program 6 times [2018-06-26 17:42:33,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:33,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:33,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:33,175 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:33,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:33,203 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:33,664 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:33,664 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:33,665 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:42:33,675 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:42:33,771 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:42:33,771 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:33,776 INFO ]: Computing forward predicates... [2018-06-26 17:42:33,953 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:33,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:33,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 17:42:33,976 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:42:33,976 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:42:33,976 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:42:33,976 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-26 17:42:34,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:34,037 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 17:42:34,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:42:34,038 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 17:42:34,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:34,038 INFO ]: With dead ends: 13 [2018-06-26 17:42:34,038 INFO ]: Without dead ends: 13 [2018-06-26 17:42:34,039 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:42:34,039 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:42:34,040 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:42:34,040 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:42:34,040 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-26 17:42:34,040 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-26 17:42:34,040 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:34,040 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-26 17:42:34,041 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:42:34,041 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-26 17:42:34,041 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:42:34,041 INFO ]: Found error trace [2018-06-26 17:42:34,041 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-26 17:42:34,041 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:34,041 INFO ]: Analyzing trace with hash 1178784609, now seen corresponding path program 7 times [2018-06-26 17:42:34,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:34,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:34,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:34,042 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:34,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:34,064 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:35,130 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:35,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:35,130 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:42:35,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:35,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:35,222 INFO ]: Computing forward predicates... [2018-06-26 17:42:35,678 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:35,713 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:35,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 17:42:35,714 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:42:35,714 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:42:35,714 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:42:35,714 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-26 17:42:35,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:35,896 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-26 17:42:35,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:42:35,897 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-26 17:42:35,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:35,897 INFO ]: With dead ends: 14 [2018-06-26 17:42:35,897 INFO ]: Without dead ends: 14 [2018-06-26 17:42:35,897 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:42:35,897 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:42:35,899 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:42:35,899 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:42:35,899 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-26 17:42:35,899 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-26 17:42:35,899 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:35,899 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-26 17:42:35,899 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:42:35,899 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-26 17:42:35,900 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:42:35,900 INFO ]: Found error trace [2018-06-26 17:42:35,900 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-26 17:42:35,900 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:35,900 INFO ]: Analyzing trace with hash -2112603701, now seen corresponding path program 8 times [2018-06-26 17:42:35,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:35,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:35,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:35,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:35,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:35,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:36,141 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:36,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:36,141 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:42:36,158 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:42:36,246 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:42:36,246 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:36,252 INFO ]: Computing forward predicates... [2018-06-26 17:42:36,452 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:36,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:36,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 17:42:36,477 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:42:36,477 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:42:36,477 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:42:36,477 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-26 17:42:36,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:36,566 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 17:42:36,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:42:36,567 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-26 17:42:36,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:36,567 INFO ]: With dead ends: 15 [2018-06-26 17:42:36,567 INFO ]: Without dead ends: 15 [2018-06-26 17:42:36,567 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:42:36,567 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:42:36,569 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:42:36,569 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:42:36,569 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-26 17:42:36,569 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-26 17:42:36,569 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:36,569 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-26 17:42:36,569 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:42:36,569 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-26 17:42:36,570 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:42:36,570 INFO ]: Found error trace [2018-06-26 17:42:36,570 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-26 17:42:36,570 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:36,570 INFO ]: Analyzing trace with hash -1066426207, now seen corresponding path program 9 times [2018-06-26 17:42:36,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:36,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:36,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:36,570 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:36,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:36,596 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:36,837 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:36,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:36,837 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:42:36,843 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:42:37,010 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:42:37,045 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:37,057 INFO ]: Computing forward predicates... [2018-06-26 17:42:37,485 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:37,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:37,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 17:42:37,510 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:42:37,510 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:42:37,510 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:42:37,511 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-26 17:42:37,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:37,585 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-26 17:42:37,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:42:37,585 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 17:42:37,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:37,586 INFO ]: With dead ends: 16 [2018-06-26 17:42:37,586 INFO ]: Without dead ends: 16 [2018-06-26 17:42:37,586 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:42:37,586 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:42:37,588 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:42:37,588 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:42:37,588 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-26 17:42:37,588 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-26 17:42:37,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:37,588 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-26 17:42:37,588 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:42:37,588 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-26 17:42:37,589 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:42:37,589 INFO ]: Found error trace [2018-06-26 17:42:37,589 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-26 17:42:37,589 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:37,589 INFO ]: Analyzing trace with hash 1300305035, now seen corresponding path program 10 times [2018-06-26 17:42:37,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:37,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:37,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:37,590 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:37,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:37,627 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:37,886 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:37,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:37,887 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:42:37,894 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:42:38,011 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:42:38,011 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:38,022 INFO ]: Computing forward predicates... [2018-06-26 17:42:38,313 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:38,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:38,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 17:42:38,333 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:42:38,333 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:42:38,333 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:42:38,333 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-26 17:42:38,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:38,399 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-26 17:42:38,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:42:38,399 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-26 17:42:38,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:38,399 INFO ]: With dead ends: 17 [2018-06-26 17:42:38,399 INFO ]: Without dead ends: 17 [2018-06-26 17:42:38,399 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:42:38,399 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:42:38,401 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:42:38,401 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:42:38,401 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-26 17:42:38,401 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-26 17:42:38,401 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:38,401 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-26 17:42:38,401 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:42:38,401 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-26 17:42:38,402 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:42:38,402 INFO ]: Found error trace [2018-06-26 17:42:38,402 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-26 17:42:38,402 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:38,402 INFO ]: Analyzing trace with hash 1654529505, now seen corresponding path program 11 times [2018-06-26 17:42:38,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:38,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:38,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:38,403 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:38,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:38,427 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:38,641 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:38,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:38,641 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:42:38,649 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:42:38,796 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:42:38,796 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:38,807 INFO ]: Computing forward predicates... [2018-06-26 17:42:39,095 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:39,114 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:39,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 17:42:39,114 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:42:39,115 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:42:39,115 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:42:39,115 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-26 17:42:39,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:39,215 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-26 17:42:39,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:42:39,215 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-26 17:42:39,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:39,215 INFO ]: With dead ends: 18 [2018-06-26 17:42:39,215 INFO ]: Without dead ends: 18 [2018-06-26 17:42:39,215 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:42:39,216 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:42:39,217 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:42:39,217 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:42:39,217 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-26 17:42:39,217 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-26 17:42:39,217 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:39,217 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-26 17:42:39,217 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:42:39,217 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-26 17:42:39,218 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:42:39,218 INFO ]: Found error trace [2018-06-26 17:42:39,218 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-26 17:42:39,218 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:39,218 INFO ]: Analyzing trace with hash -249413813, now seen corresponding path program 12 times [2018-06-26 17:42:39,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:39,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:39,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:39,218 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:39,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:39,246 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:39,497 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:39,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:39,497 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:42:39,503 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:42:39,620 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:42:39,620 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:39,628 INFO ]: Computing forward predicates... [2018-06-26 17:42:40,372 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:40,406 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:40,406 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:42:40,406 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:42:40,406 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:42:40,406 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:42:40,406 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-26 17:42:40,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:40,767 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-26 17:42:40,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:42:40,767 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-26 17:42:40,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:40,768 INFO ]: With dead ends: 19 [2018-06-26 17:42:40,768 INFO ]: Without dead ends: 19 [2018-06-26 17:42:40,768 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:42:40,768 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:42:40,769 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:42:40,769 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:42:40,770 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-26 17:42:40,770 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-26 17:42:40,770 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:40,770 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-26 17:42:40,770 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:42:40,770 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-26 17:42:40,770 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:42:40,770 INFO ]: Found error trace [2018-06-26 17:42:40,770 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-26 17:42:40,771 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:40,771 INFO ]: Analyzing trace with hash 857885473, now seen corresponding path program 13 times [2018-06-26 17:42:40,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:40,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:40,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:40,771 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:40,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:40,799 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:41,130 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:41,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:41,130 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:42:41,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:41,261 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:41,271 INFO ]: Computing forward predicates... [2018-06-26 17:42:41,485 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:41,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:41,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 17:42:41,505 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:42:41,505 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:42:41,505 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:42:41,505 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-26 17:42:41,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:41,602 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-26 17:42:41,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:42:41,602 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-26 17:42:41,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:41,603 INFO ]: With dead ends: 20 [2018-06-26 17:42:41,603 INFO ]: Without dead ends: 20 [2018-06-26 17:42:41,603 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:42:41,603 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:42:41,605 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:42:41,605 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:42:41,605 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-26 17:42:41,605 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-26 17:42:41,605 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:41,605 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-26 17:42:41,605 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:42:41,605 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-26 17:42:41,606 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:42:41,606 INFO ]: Found error trace [2018-06-26 17:42:41,606 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-26 17:42:41,606 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:41,606 INFO ]: Analyzing trace with hash 824424971, now seen corresponding path program 14 times [2018-06-26 17:42:41,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:41,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:41,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:41,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:41,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:41,640 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:41,957 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:41,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:41,957 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:42:41,963 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:42:42,077 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:42:42,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:42,120 INFO ]: Computing forward predicates... [2018-06-26 17:42:42,403 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:42,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:42,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 17:42:42,423 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:42:42,423 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:42:42,424 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:42:42,424 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-26 17:42:42,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:42,560 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-26 17:42:42,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:42:42,560 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-26 17:42:42,560 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:42,560 INFO ]: With dead ends: 21 [2018-06-26 17:42:42,560 INFO ]: Without dead ends: 21 [2018-06-26 17:42:42,561 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:42:42,561 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:42:42,562 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:42:42,562 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:42:42,563 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-26 17:42:42,563 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-26 17:42:42,563 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:42,563 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-26 17:42:42,563 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:42:42,563 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-26 17:42:42,563 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:42:42,563 INFO ]: Found error trace [2018-06-26 17:42:42,563 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-26 17:42:42,563 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:42,564 INFO ]: Analyzing trace with hash -212850591, now seen corresponding path program 15 times [2018-06-26 17:42:42,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:42,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:42,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:42,564 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:42,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:42,594 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:43,142 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:43,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:43,142 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:42:43,147 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:42:43,317 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:42:43,317 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:43,325 INFO ]: Computing forward predicates... [2018-06-26 17:42:43,599 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:43,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:43,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 17:42:43,620 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:42:43,620 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:42:43,620 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:42:43,620 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-26 17:42:43,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:43,782 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-26 17:42:43,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:42:43,782 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-26 17:42:43,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:43,782 INFO ]: With dead ends: 22 [2018-06-26 17:42:43,782 INFO ]: Without dead ends: 22 [2018-06-26 17:42:43,783 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 14 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:42:43,783 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:42:43,784 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:42:43,784 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:42:43,785 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-26 17:42:43,785 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-26 17:42:43,785 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:43,785 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-26 17:42:43,785 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:42:43,785 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-26 17:42:43,785 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:42:43,785 INFO ]: Found error trace [2018-06-26 17:42:43,786 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-26 17:42:43,786 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:43,786 INFO ]: Analyzing trace with hash 1991345355, now seen corresponding path program 16 times [2018-06-26 17:42:43,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:43,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:43,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:43,786 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:43,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:43,816 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:44,141 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:44,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:44,141 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:42:44,147 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:42:44,292 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:42:44,292 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:44,304 INFO ]: Computing forward predicates... [2018-06-26 17:42:44,551 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:44,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:44,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 17:42:44,583 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:42:44,583 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:42:44,584 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:42:44,584 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-26 17:42:45,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:45,005 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-26 17:42:45,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:42:45,006 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-26 17:42:45,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:45,007 INFO ]: With dead ends: 23 [2018-06-26 17:42:45,007 INFO ]: Without dead ends: 23 [2018-06-26 17:42:45,007 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:42:45,007 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:42:45,008 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:42:45,008 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:42:45,009 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-26 17:42:45,009 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-26 17:42:45,009 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:45,009 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-26 17:42:45,009 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:42:45,009 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-26 17:42:45,010 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:42:45,010 INFO ]: Found error trace [2018-06-26 17:42:45,010 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-26 17:42:45,010 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:45,010 INFO ]: Analyzing trace with hash 1601942945, now seen corresponding path program 17 times [2018-06-26 17:42:45,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:45,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:45,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:45,011 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:45,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:45,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:45,419 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:45,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:45,419 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:42:45,425 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:42:45,628 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:42:45,628 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:45,644 INFO ]: Computing forward predicates... [2018-06-26 17:42:46,288 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:46,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:46,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-26 17:42:46,310 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:42:46,310 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:42:46,310 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:42:46,310 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-26 17:42:46,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:46,494 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-26 17:42:46,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:42:46,496 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-26 17:42:46,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:46,497 INFO ]: With dead ends: 24 [2018-06-26 17:42:46,497 INFO ]: Without dead ends: 24 [2018-06-26 17:42:46,497 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 16 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:42:46,497 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:42:46,498 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:42:46,498 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:42:46,499 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-26 17:42:46,499 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-26 17:42:46,499 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:46,499 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-26 17:42:46,499 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:42:46,499 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-26 17:42:46,499 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:42:46,499 INFO ]: Found error trace [2018-06-26 17:42:46,499 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-26 17:42:46,499 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:46,499 INFO ]: Analyzing trace with hash -1879597173, now seen corresponding path program 18 times [2018-06-26 17:42:46,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:46,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:46,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:46,500 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:46,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:46,532 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:48,049 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:48,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:48,049 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) [2018-06-26 17:42:48,071 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:42:48,316 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 17:42:48,316 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:48,343 INFO ]: Computing forward predicates... [2018-06-26 17:42:48,699 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:48,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:48,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-26 17:42:48,720 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:42:48,720 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:42:48,720 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:42:48,720 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-26 17:42:48,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:48,986 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-26 17:42:48,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:42:48,986 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-26 17:42:48,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:48,986 INFO ]: With dead ends: 25 [2018-06-26 17:42:48,986 INFO ]: Without dead ends: 25 [2018-06-26 17:42:48,987 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 17 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:42:48,987 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:42:48,988 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:42:48,988 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:42:48,989 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-26 17:42:48,989 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-26 17:42:48,989 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:48,989 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-26 17:42:48,989 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:42:48,989 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-26 17:42:48,989 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:42:48,989 INFO ]: Found error trace [2018-06-26 17:42:48,990 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-26 17:42:48,990 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:48,990 INFO ]: Analyzing trace with hash 1861808865, now seen corresponding path program 19 times [2018-06-26 17:42:48,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:48,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:48,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:48,990 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:48,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:49,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:49,407 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:49,407 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:49,407 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:42:49,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:49,568 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:49,583 INFO ]: Computing forward predicates... [2018-06-26 17:42:50,103 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:50,123 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:50,123 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-26 17:42:50,123 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:42:50,123 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:42:50,123 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:42:50,124 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-26 17:42:50,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:50,378 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-26 17:42:50,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:42:50,378 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-26 17:42:50,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:50,379 INFO ]: With dead ends: 26 [2018-06-26 17:42:50,379 INFO ]: Without dead ends: 26 [2018-06-26 17:42:50,379 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:42:50,379 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:42:50,380 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:42:50,380 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:42:50,380 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-26 17:42:50,380 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-26 17:42:50,380 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:50,380 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-26 17:42:50,380 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:42:50,380 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-26 17:42:50,381 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:42:50,381 INFO ]: Found error trace [2018-06-26 17:42:50,381 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-26 17:42:50,381 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:50,381 INFO ]: Analyzing trace with hash 1881279051, now seen corresponding path program 20 times [2018-06-26 17:42:50,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:50,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:50,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:50,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:50,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:50,420 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:50,801 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:50,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:50,801 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:42:50,807 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:42:50,968 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:42:50,968 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:50,979 INFO ]: Computing forward predicates... [2018-06-26 17:42:51,510 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:51,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:51,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-26 17:42:51,537 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:42:51,537 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:42:51,537 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:42:51,537 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-26 17:42:51,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:51,789 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-26 17:42:51,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:42:51,789 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-26 17:42:51,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:51,789 INFO ]: With dead ends: 27 [2018-06-26 17:42:51,789 INFO ]: Without dead ends: 27 [2018-06-26 17:42:51,790 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:42:51,790 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:42:51,791 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:42:51,791 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:42:51,791 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-26 17:42:51,791 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-26 17:42:51,791 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:51,791 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-26 17:42:51,791 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:42:51,792 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-26 17:42:51,792 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:42:51,792 INFO ]: Found error trace [2018-06-26 17:42:51,792 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-26 17:42:51,792 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:51,792 INFO ]: Analyzing trace with hash -1810112479, now seen corresponding path program 21 times [2018-06-26 17:42:51,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:51,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:51,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:51,793 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:51,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:51,838 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:52,173 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:52,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:52,174 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:42:52,179 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:42:52,420 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 17:42:52,420 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:52,431 INFO ]: Computing forward predicates... [2018-06-26 17:42:52,802 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:52,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:52,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-26 17:42:52,822 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:42:52,822 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:42:52,822 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:42:52,823 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-26 17:42:53,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:53,205 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-26 17:42:53,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:42:53,206 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-26 17:42:53,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:53,206 INFO ]: With dead ends: 28 [2018-06-26 17:42:53,206 INFO ]: Without dead ends: 28 [2018-06-26 17:42:53,207 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 20 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:42:53,207 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:42:53,210 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:42:53,210 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:42:53,210 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-26 17:42:53,211 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-26 17:42:53,211 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:53,211 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-26 17:42:53,211 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:42:53,211 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-26 17:42:53,211 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:42:53,211 INFO ]: Found error trace [2018-06-26 17:42:53,212 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-26 17:42:53,212 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:53,212 INFO ]: Analyzing trace with hash -279132917, now seen corresponding path program 22 times [2018-06-26 17:42:53,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:53,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:53,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:53,212 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:53,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:53,264 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:53,592 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:53,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:53,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:42:53,597 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:42:53,763 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:42:53,763 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:53,785 INFO ]: Computing forward predicates... [2018-06-26 17:42:54,476 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:54,496 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:54,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-26 17:42:54,496 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:42:54,497 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:42:54,497 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:42:54,497 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-26 17:42:55,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:55,199 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-26 17:42:55,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:42:55,200 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-26 17:42:55,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:55,200 INFO ]: With dead ends: 29 [2018-06-26 17:42:55,200 INFO ]: Without dead ends: 29 [2018-06-26 17:42:55,201 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 21 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:42:55,201 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:42:55,202 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:42:55,202 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:42:55,203 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 17:42:55,203 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-26 17:42:55,203 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:55,203 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 17:42:55,203 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:42:55,203 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 17:42:55,203 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:42:55,203 INFO ]: Found error trace [2018-06-26 17:42:55,203 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-26 17:42:55,203 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:55,204 INFO ]: Analyzing trace with hash -63406751, now seen corresponding path program 23 times [2018-06-26 17:42:55,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:55,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:55,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:55,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:55,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:55,238 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:55,654 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:55,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:55,654 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:42:55,659 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:42:55,898 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 17:42:55,898 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:55,940 INFO ]: Computing forward predicates... [2018-06-26 17:42:56,579 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:56,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:56,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-26 17:42:56,601 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:42:56,601 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:42:56,601 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:42:56,602 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-26 17:42:57,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:57,023 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-26 17:42:57,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:42:57,023 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-26 17:42:57,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:57,024 INFO ]: With dead ends: 30 [2018-06-26 17:42:57,024 INFO ]: Without dead ends: 30 [2018-06-26 17:42:57,024 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 22 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:42:57,024 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:42:57,026 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:42:57,026 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:42:57,027 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-26 17:42:57,027 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-26 17:42:57,027 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:57,027 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-26 17:42:57,027 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:42:57,027 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-26 17:42:57,028 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:42:57,028 INFO ]: Found error trace [2018-06-26 17:42:57,028 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-26 17:42:57,028 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:57,028 INFO ]: Analyzing trace with hash -1965830197, now seen corresponding path program 24 times [2018-06-26 17:42:57,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:57,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:57,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:57,028 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:57,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:57,053 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:57,392 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:57,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:57,392 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:42:57,398 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:42:57,668 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-26 17:42:57,668 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:57,689 INFO ]: Computing forward predicates... [2018-06-26 17:42:58,489 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:58,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:42:58,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-26 17:42:58,510 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:42:58,510 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:42:58,510 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:42:58,510 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-26 17:42:58,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:42:58,812 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-26 17:42:58,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:42:58,812 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-26 17:42:58,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:42:58,813 INFO ]: With dead ends: 31 [2018-06-26 17:42:58,813 INFO ]: Without dead ends: 31 [2018-06-26 17:42:58,813 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 23 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:42:58,813 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:42:58,814 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:42:58,814 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:42:58,815 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-26 17:42:58,815 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-26 17:42:58,815 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:42:58,815 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-26 17:42:58,815 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:42:58,815 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-26 17:42:58,815 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:42:58,815 INFO ]: Found error trace [2018-06-26 17:42:58,815 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-26 17:42:58,816 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:42:58,816 INFO ]: Analyzing trace with hash -811414879, now seen corresponding path program 25 times [2018-06-26 17:42:58,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:42:58,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:42:58,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:58,816 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:42:58,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:42:58,850 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:59,662 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:42:59,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:42:59,663 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:42:59,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:42:59,863 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:42:59,891 INFO ]: Computing forward predicates... [2018-06-26 17:43:00,395 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:00,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:00,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-26 17:43:00,415 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:43:00,415 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:43:00,415 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:43:00,415 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-26 17:43:00,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:00,733 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-26 17:43:00,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:43:00,733 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-26 17:43:00,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:00,733 INFO ]: With dead ends: 32 [2018-06-26 17:43:00,733 INFO ]: Without dead ends: 32 [2018-06-26 17:43:00,734 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 24 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:43:00,734 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:43:00,735 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:43:00,735 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:43:00,736 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-26 17:43:00,736 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-26 17:43:00,736 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:00,736 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-26 17:43:00,736 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:43:00,736 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-26 17:43:00,736 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:43:00,736 INFO ]: Found error trace [2018-06-26 17:43:00,736 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-26 17:43:00,737 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:00,737 INFO ]: Analyzing trace with hash 615721611, now seen corresponding path program 26 times [2018-06-26 17:43:00,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:00,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:00,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:00,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:43:00,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:00,804 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:02,400 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:02,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:02,400 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:43:02,413 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:43:02,627 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:43:02,627 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:02,642 INFO ]: Computing forward predicates... [2018-06-26 17:43:03,195 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:03,217 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:03,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-26 17:43:03,217 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:43:03,218 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:43:03,218 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:43:03,218 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-26 17:43:03,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:03,557 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-26 17:43:03,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:43:03,558 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-26 17:43:03,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:03,558 INFO ]: With dead ends: 33 [2018-06-26 17:43:03,559 INFO ]: Without dead ends: 33 [2018-06-26 17:43:03,559 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 25 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:43:03,559 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:43:03,561 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:43:03,561 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:43:03,561 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-26 17:43:03,561 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-26 17:43:03,562 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:03,562 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-26 17:43:03,562 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:43:03,562 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-26 17:43:03,683 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:43:03,683 INFO ]: Found error trace [2018-06-26 17:43:03,683 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-26 17:43:03,683 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:03,683 INFO ]: Analyzing trace with hash 1907279841, now seen corresponding path program 27 times [2018-06-26 17:43:03,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:03,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:03,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:03,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:03,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:03,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:04,309 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:04,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:04,309 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:43:04,315 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:43:04,607 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-26 17:43:04,607 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:04,627 INFO ]: Computing forward predicates... [2018-06-26 17:43:05,988 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:06,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:06,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-26 17:43:06,011 INFO ]: Interpolant automaton has 30 states [2018-06-26 17:43:06,011 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 17:43:06,011 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:43:06,011 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-26 17:43:06,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:06,376 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-26 17:43:06,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:43:06,377 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-26 17:43:06,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:06,377 INFO ]: With dead ends: 34 [2018-06-26 17:43:06,377 INFO ]: Without dead ends: 34 [2018-06-26 17:43:06,378 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 26 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:43:06,378 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:43:06,379 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:43:06,380 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:43:06,380 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-26 17:43:06,380 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-26 17:43:06,380 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:06,380 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-26 17:43:06,380 INFO ]: Interpolant automaton has 30 states. [2018-06-26 17:43:06,380 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-26 17:43:06,381 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:43:06,381 INFO ]: Found error trace [2018-06-26 17:43:06,381 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-26 17:43:06,381 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:06,381 INFO ]: Analyzing trace with hash -1004087989, now seen corresponding path program 28 times [2018-06-26 17:43:06,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:06,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:06,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:06,381 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:06,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:06,460 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:06,982 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:06,982 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:06,982 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:43:06,988 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:43:07,190 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:43:07,190 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:07,219 INFO ]: Computing forward predicates... [2018-06-26 17:43:07,904 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:07,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:07,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-26 17:43:07,934 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:43:07,934 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:43:07,934 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:43:07,934 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-26 17:43:08,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:09,255 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-26 17:43:09,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:43:09,255 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-26 17:43:09,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:09,256 INFO ]: With dead ends: 35 [2018-06-26 17:43:09,256 INFO ]: Without dead ends: 35 [2018-06-26 17:43:09,257 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 27 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:43:09,257 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:43:09,269 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:43:09,269 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:43:09,270 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-26 17:43:09,270 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-26 17:43:09,270 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:09,270 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-26 17:43:09,270 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:43:09,270 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-26 17:43:09,271 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:43:09,271 INFO ]: Found error trace [2018-06-26 17:43:09,271 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-26 17:43:09,271 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:09,271 INFO ]: Analyzing trace with hash -1062177503, now seen corresponding path program 29 times [2018-06-26 17:43:09,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:09,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:09,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:09,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:09,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:09,392 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:10,065 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:10,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:10,108 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:43:10,118 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:43:10,480 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-26 17:43:10,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:10,548 INFO ]: Computing forward predicates... [2018-06-26 17:43:11,136 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:11,158 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:11,158 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-26 17:43:11,158 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:43:11,159 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:43:11,159 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:43:11,159 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-26 17:43:11,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:11,553 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-26 17:43:11,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:43:11,553 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-26 17:43:11,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:11,554 INFO ]: With dead ends: 36 [2018-06-26 17:43:11,554 INFO ]: Without dead ends: 36 [2018-06-26 17:43:11,554 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 28 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:43:11,554 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:43:11,555 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:43:11,555 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:43:11,555 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-26 17:43:11,555 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-26 17:43:11,555 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:11,555 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-26 17:43:11,555 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:43:11,556 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-26 17:43:11,556 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:43:11,556 INFO ]: Found error trace [2018-06-26 17:43:11,556 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-26 17:43:11,556 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:11,556 INFO ]: Analyzing trace with hash 1432014859, now seen corresponding path program 30 times [2018-06-26 17:43:11,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:11,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:11,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:11,556 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:11,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:11,611 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:12,163 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:12,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:12,163 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:43:12,168 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:43:12,560 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-26 17:43:12,560 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:12,581 INFO ]: Computing forward predicates... [2018-06-26 17:43:13,253 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:13,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:13,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-26 17:43:13,275 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:43:13,275 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:43:13,275 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:43:13,275 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-26 17:43:13,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:13,699 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-26 17:43:13,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:43:13,699 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-26 17:43:13,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:13,699 INFO ]: With dead ends: 37 [2018-06-26 17:43:13,699 INFO ]: Without dead ends: 37 [2018-06-26 17:43:13,700 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 29 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:43:13,700 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:43:13,701 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:43:13,701 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:43:13,701 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-26 17:43:13,701 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-26 17:43:13,701 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:13,701 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-26 17:43:13,701 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:43:13,701 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-26 17:43:13,702 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:43:13,702 INFO ]: Found error trace [2018-06-26 17:43:13,702 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-26 17:43:13,702 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:13,702 INFO ]: Analyzing trace with hash 1442566753, now seen corresponding path program 31 times [2018-06-26 17:43:13,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:13,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:13,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:13,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:13,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:13,741 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:14,497 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:14,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:14,497 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:43:14,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:43:14,773 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:14,823 INFO ]: Computing forward predicates... [2018-06-26 17:43:15,639 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:15,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:15,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-26 17:43:15,660 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:43:15,660 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:43:15,661 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:43:15,661 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-26 17:43:16,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:16,233 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-26 17:43:16,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:43:16,233 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-26 17:43:16,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:16,234 INFO ]: With dead ends: 38 [2018-06-26 17:43:16,234 INFO ]: Without dead ends: 38 [2018-06-26 17:43:16,234 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 30 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:43:16,234 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:43:16,235 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:43:16,235 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:43:16,236 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-26 17:43:16,236 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-26 17:43:16,236 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:16,236 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-26 17:43:16,236 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:43:16,236 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-26 17:43:16,236 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:43:16,236 INFO ]: Found error trace [2018-06-26 17:43:16,237 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-26 17:43:16,237 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:16,237 INFO ]: Analyzing trace with hash 1769675467, now seen corresponding path program 32 times [2018-06-26 17:43:16,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:16,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:16,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:16,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:43:16,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:16,304 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:16,964 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:16,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:16,964 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:43:16,970 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:43:17,216 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:43:17,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:17,234 INFO ]: Computing forward predicates... [2018-06-26 17:43:18,649 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:18,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:18,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-26 17:43:18,681 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:43:18,681 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:43:18,681 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:43:18,681 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-26 17:43:19,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:19,272 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-26 17:43:19,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:43:19,272 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-26 17:43:19,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:19,273 INFO ]: With dead ends: 39 [2018-06-26 17:43:19,273 INFO ]: Without dead ends: 39 [2018-06-26 17:43:19,273 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 31 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:43:19,273 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:43:19,274 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:43:19,274 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:43:19,275 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-26 17:43:19,275 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-26 17:43:19,275 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:19,275 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-26 17:43:19,275 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:43:19,275 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-26 17:43:19,275 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:43:19,275 INFO ]: Found error trace [2018-06-26 17:43:19,275 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-26 17:43:19,275 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:19,275 INFO ]: Analyzing trace with hash -974856287, now seen corresponding path program 33 times [2018-06-26 17:43:19,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:19,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:19,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:19,276 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:19,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:19,342 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:20,461 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:20,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:20,461 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:43:20,466 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:43:20,852 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-26 17:43:20,853 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:20,873 INFO ]: Computing forward predicates... [2018-06-26 17:43:21,831 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:21,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:21,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-26 17:43:21,852 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:43:21,853 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:43:21,853 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:43:21,853 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-26 17:43:22,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:22,365 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-26 17:43:22,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:43:22,365 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-26 17:43:22,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:22,365 INFO ]: With dead ends: 40 [2018-06-26 17:43:22,365 INFO ]: Without dead ends: 40 [2018-06-26 17:43:22,366 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 32 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:43:22,366 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:43:22,367 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:43:22,367 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:43:22,367 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-26 17:43:22,367 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-26 17:43:22,367 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:22,367 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-26 17:43:22,367 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:43:22,367 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-26 17:43:22,367 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:43:22,367 INFO ]: Found error trace [2018-06-26 17:43:22,367 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-26 17:43:22,367 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:22,367 INFO ]: Analyzing trace with hash -155994741, now seen corresponding path program 34 times [2018-06-26 17:43:22,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:22,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:22,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:22,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:22,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:22,425 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:23,097 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:23,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:23,097 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:43:23,103 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:43:23,353 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:43:23,353 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:23,394 INFO ]: Computing forward predicates... [2018-06-26 17:43:24,299 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:24,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:43:24,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-26 17:43:24,322 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:43:24,322 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:43:24,323 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:43:24,323 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-26 17:43:24,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:43:24,853 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-26 17:43:24,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:43:24,854 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-26 17:43:24,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:43:24,854 INFO ]: With dead ends: 41 [2018-06-26 17:43:24,854 INFO ]: Without dead ends: 41 [2018-06-26 17:43:24,854 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:43:24,854 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:43:24,855 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:43:24,855 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:43:24,856 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-26 17:43:24,856 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-26 17:43:24,856 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:43:24,856 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-26 17:43:24,856 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:43:24,856 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-26 17:43:24,856 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:43:24,856 INFO ]: Found error trace [2018-06-26 17:43:24,856 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-26 17:43:24,856 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:43:24,856 INFO ]: Analyzing trace with hash -541090591, now seen corresponding path program 35 times [2018-06-26 17:43:24,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:43:24,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:43:24,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:24,856 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:43:24,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:43:24,908 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:26,450 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:43:26,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:43:26,451 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:43:26,461 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:43:27,239 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-26 17:43:27,239 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:43:27,321 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 17:43:27,878 INFO ]: Timeout while computing interpolants [2018-06-26 17:43:28,078 WARN ]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:43:28,078 WARN ]: Verification canceled [2018-06-26 17:43:28,080 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:43:28,081 WARN ]: Timeout [2018-06-26 17:43:28,081 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:43:28 BasicIcfg [2018-06-26 17:43:28,081 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:43:28,082 INFO ]: Toolchain (without parser) took 59720.92 ms. Allocated memory was 300.4 MB in the beginning and 960.5 MB in the end (delta: 660.1 MB). Free memory was 248.9 MB in the beginning and 648.3 MB in the end (delta: -399.4 MB). Peak memory consumption was 260.7 MB. Max. memory is 3.6 GB. [2018-06-26 17:43:28,083 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 300.4 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:43:28,083 INFO ]: ChcToBoogie took 64.23 ms. Allocated memory is still 300.4 MB. Free memory was 248.9 MB in the beginning and 246.9 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:43:28,083 INFO ]: Boogie Preprocessor took 33.11 ms. Allocated memory is still 300.4 MB. Free memory was 246.9 MB in the beginning and 244.9 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:43:28,084 INFO ]: RCFGBuilder took 411.95 ms. Allocated memory is still 300.4 MB. Free memory was 244.9 MB in the beginning and 227.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:43:28,084 INFO ]: BlockEncodingV2 took 379.31 ms. Allocated memory is still 300.4 MB. Free memory was 227.9 MB in the beginning and 206.8 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:43:28,085 INFO ]: TraceAbstraction took 58823.40 ms. Allocated memory was 300.4 MB in the beginning and 960.5 MB in the end (delta: 660.1 MB). Free memory was 205.8 MB in the beginning and 648.3 MB in the end (delta: -442.5 MB). Peak memory consumption was 217.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:43:28,087 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 25 locations, 25 edges - StatisticsResult: Encoded RCFG 6 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 300.4 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.23 ms. Allocated memory is still 300.4 MB. Free memory was 248.9 MB in the beginning and 246.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.11 ms. Allocated memory is still 300.4 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 411.95 ms. Allocated memory is still 300.4 MB. Free memory was 244.9 MB in the beginning and 227.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 379.31 ms. Allocated memory is still 300.4 MB. Free memory was 227.9 MB in the beginning and 206.8 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58823.40 ms. Allocated memory was 300.4 MB in the beginning and 960.5 MB in the end (delta: 660.1 MB). Free memory was 205.8 MB in the beginning and 648.3 MB in the end (delta: -442.5 MB). Peak memory consumption was 217.6 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 41 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.7s OverallTime, 36 OverallIterations, 35 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 0 SDslu, 1890 SDs, 0 SdLazy, 16170 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 240 SyntacticMatches, 561 SemanticMatches, 630 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=35, 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, 35 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 1535 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 265844 SizeOfPredicates, 4148 NumberOfNonLiveVariables, 50065 ConjunctsInSsa, 6528 ConjunctsInUnsatCore, 69 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14280 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/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-43-28-097.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-43-28-097.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-43-28-097.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-43-28-097.csv Completed graceful shutdown