java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:47:13,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:47:13,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:47:13,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:47:13,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:47:13,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:47:13,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:47:13,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:47:13,111 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:47:13,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:47:13,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:47:13,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:47:13,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:47:13,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:47:13,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:47:13,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:47:13,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:47:13,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:47:13,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:47:13,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:47:13,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:47:13,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:47:13,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:47:13,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:47:13,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:47:13,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:47:13,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:47:13,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:47:13,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:47:13,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:47:13,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:47:13,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:47:13,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:47:13,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:47:13,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:47:13,135 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:47:13,158 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:47:13,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:47:13,159 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:47:13,159 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:47:13,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:47:13,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:47:13,160 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:47:13,160 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:47:13,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:47:13,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:47:13,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:47:13,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:47:13,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:47:13,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:47:13,167 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:47:13,167 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:47:13,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:47:13,168 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:47:13,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:47:13,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:47:13,168 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:47:13,170 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:47:13,170 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:47:13,215 INFO ]: Repository-Root is: /tmp [2018-06-24 20:47:13,235 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:47:13,241 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:47:13,242 INFO ]: Initializing SmtParser... [2018-06-24 20:47:13,242 INFO ]: SmtParser initialized [2018-06-24 20:47:13,243 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-24 20:47:13,244 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-24 20:47:13,333 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 unknown [2018-06-24 20:47:13,496 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-24 20:47:13,500 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:47:13,507 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:47:13,507 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:47:13,507 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:47:13,510 INFO ]: ChcToBoogie initialized [2018-06-24 20:47:13,514 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,570 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13 Unit [2018-06-24 20:47:13,570 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:47:13,571 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:47:13,571 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:47:13,571 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:47:13,592 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,592 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,597 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,598 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,600 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,602 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,602 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,604 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:47:13,605 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:47:13,605 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:47:13,605 INFO ]: RCFGBuilder initialized [2018-06-24 20:47:13,606 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:47:13,621 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:47:13,621 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:47:13,621 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:47:13,621 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:47:13,621 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:47:13,621 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:47:13,795 INFO ]: Using library mode [2018-06-24 20:47:13,796 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:47:13 BoogieIcfgContainer [2018-06-24 20:47:13,796 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:47:13,796 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:47:13,796 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:47:13,797 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:47:13,798 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:47:13" (1/1) ... [2018-06-24 20:47:13,809 INFO ]: Initial Icfg 12 locations, 14 edges [2018-06-24 20:47:13,810 INFO ]: Using Remove infeasible edges [2018-06-24 20:47:13,811 INFO ]: Using Maximize final states [2018-06-24 20:47:13,811 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:47:13,811 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:47:13,813 INFO ]: Using Remove sink states [2018-06-24 20:47:13,814 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:47:13,814 INFO ]: Using Use SBE [2018-06-24 20:47:13,832 INFO ]: SBE split 1 edges [2018-06-24 20:47:13,836 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:47:13,840 INFO ]: 0 new accepting states [2018-06-24 20:47:13,911 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-24 20:47:13,913 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:47:13,915 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:47:13,915 INFO ]: 0 new accepting states [2018-06-24 20:47:13,915 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:47:13,915 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:47:13,915 INFO ]: Encoded RCFG 7 locations, 10 edges [2018-06-24 20:47:13,916 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:47:13 BasicIcfg [2018-06-24 20:47:13,916 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:47:13,917 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:47:13,917 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:47:13,932 INFO ]: TraceAbstraction initialized [2018-06-24 20:47:13,932 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:47:13" (1/4) ... [2018-06-24 20:47:13,933 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44db67f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:47:13, skipping insertion in model container [2018-06-24 20:47:13,933 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:47:13" (2/4) ... [2018-06-24 20:47:13,934 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44db67f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:47:13, skipping insertion in model container [2018-06-24 20:47:13,934 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:47:13" (3/4) ... [2018-06-24 20:47:13,934 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44db67f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:13, skipping insertion in model container [2018-06-24 20:47:13,934 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:47:13" (4/4) ... [2018-06-24 20:47:13,935 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:47:13,953 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:47:13,962 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:47:14,023 INFO ]: Using default assertion order modulation [2018-06-24 20:47:14,024 INFO ]: Interprodecural is true [2018-06-24 20:47:14,024 INFO ]: Hoare is false [2018-06-24 20:47:14,024 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:47:14,024 INFO ]: Backedges is TWOTRACK [2018-06-24 20:47:14,024 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:47:14,024 INFO ]: Difference is false [2018-06-24 20:47:14,024 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:47:14,024 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:47:14,034 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:47:14,043 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:47:14,043 INFO ]: Found error trace [2018-06-24 20:47:14,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:47:14,044 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:14,049 INFO ]: Analyzing trace with hash 1189513717, now seen corresponding path program 1 times [2018-06-24 20:47:14,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:14,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:14,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:14,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:14,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:14,129 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:14,175 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:14,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:14,176 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:47:14,178 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:47:14,189 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:47:14,189 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:47:14,191 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:47:14,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:14,277 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 20:47:14,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:47:14,279 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:47:14,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:14,288 INFO ]: With dead ends: 10 [2018-06-24 20:47:14,288 INFO ]: Without dead ends: 10 [2018-06-24 20:47:14,290 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-24 20:47:14,308 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:47:14,324 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 20:47:14,326 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:47:14,326 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 20:47:14,328 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 6 [2018-06-24 20:47:14,328 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:14,328 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 20:47:14,328 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:47:14,328 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 20:47:14,328 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:47:14,328 INFO ]: Found error trace [2018-06-24 20:47:14,328 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:47:14,328 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:14,329 INFO ]: Analyzing trace with hash 1189573299, now seen corresponding path program 1 times [2018-06-24 20:47:14,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:14,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:14,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:14,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:14,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:14,339 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:14,466 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:14,466 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:14,466 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:47:14,467 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:47:14,467 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:47:14,467 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:14,468 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-24 20:47:14,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:14,534 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-24 20:47:14,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:47:14,535 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:47:14,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:14,536 INFO ]: With dead ends: 13 [2018-06-24 20:47:14,536 INFO ]: Without dead ends: 13 [2018-06-24 20:47:14,537 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:14,537 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:47:14,539 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:47:14,539 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:47:14,540 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-24 20:47:14,540 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 6 [2018-06-24 20:47:14,540 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:14,540 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-24 20:47:14,540 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:47:14,540 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-24 20:47:14,540 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:14,540 INFO ]: Found error trace [2018-06-24 20:47:14,540 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:14,540 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:14,541 INFO ]: Analyzing trace with hash -1778344510, now seen corresponding path program 1 times [2018-06-24 20:47:14,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:14,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:14,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:14,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:14,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:14,555 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:14,598 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:14,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:14,598 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-24 20:47:14,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:14,627 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:14,633 INFO ]: Computing forward predicates... [2018-06-24 20:47:14,756 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:14,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:14,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-24 20:47:14,776 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:47:14,776 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:47:14,777 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:14,777 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 7 states. [2018-06-24 20:47:15,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:15,123 INFO ]: Finished difference Result 17 states and 24 transitions. [2018-06-24 20:47:15,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:47:15,123 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:47:15,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:15,124 INFO ]: With dead ends: 17 [2018-06-24 20:47:15,124 INFO ]: Without dead ends: 14 [2018-06-24 20:47:15,125 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:47:15,125 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:47:15,126 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 20:47:15,126 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:47:15,127 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 20:47:15,127 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2018-06-24 20:47:15,127 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:15,127 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 20:47:15,127 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:47:15,127 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 20:47:15,127 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:15,127 INFO ]: Found error trace [2018-06-24 20:47:15,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:15,128 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:15,128 INFO ]: Analyzing trace with hash -1751562401, now seen corresponding path program 1 times [2018-06-24 20:47:15,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:15,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:15,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:15,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,135 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,157 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:15,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:15,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:47:15,158 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:47:15,158 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:47:15,158 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:47:15,158 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 3 states. [2018-06-24 20:47:15,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:15,168 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-24 20:47:15,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:47:15,168 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:47:15,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:15,169 INFO ]: With dead ends: 13 [2018-06-24 20:47:15,169 INFO ]: Without dead ends: 13 [2018-06-24 20:47:15,169 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-24 20:47:15,169 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:47:15,170 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:47:15,170 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:47:15,171 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-24 20:47:15,171 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2018-06-24 20:47:15,171 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:15,171 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-24 20:47:15,171 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:47:15,171 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-24 20:47:15,171 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:15,171 INFO ]: Found error trace [2018-06-24 20:47:15,171 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:15,172 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:15,172 INFO ]: Analyzing trace with hash -1750787835, now seen corresponding path program 1 times [2018-06-24 20:47:15,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:15,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:15,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:15,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,227 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:15,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:15,227 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-24 20:47:15,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:15,255 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,257 INFO ]: Computing forward predicates... [2018-06-24 20:47:15,261 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:15,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:15,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:47:15,285 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:47:15,285 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:47:15,285 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:15,285 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-06-24 20:47:15,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:15,306 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-24 20:47:15,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:47:15,306 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:47:15,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:15,307 INFO ]: With dead ends: 14 [2018-06-24 20:47:15,307 INFO ]: Without dead ends: 14 [2018-06-24 20:47:15,307 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:15,307 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:47:15,308 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:47:15,308 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:47:15,309 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-24 20:47:15,309 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2018-06-24 20:47:15,309 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:15,309 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-24 20:47:15,309 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:47:15,309 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-24 20:47:15,309 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:47:15,309 INFO ]: Found error trace [2018-06-24 20:47:15,309 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:15,309 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:15,310 INFO ]: Analyzing trace with hash 1560515414, now seen corresponding path program 2 times [2018-06-24 20:47:15,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:15,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:15,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:15,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,320 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,522 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:15,522 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:15,522 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-24 20:47:15,532 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:15,545 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:15,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,546 INFO ]: Computing forward predicates... [2018-06-24 20:47:15,552 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:15,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:15,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:47:15,572 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:47:15,572 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:47:15,572 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:15,572 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 5 states. [2018-06-24 20:47:15,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:15,641 INFO ]: Finished difference Result 15 states and 19 transitions. [2018-06-24 20:47:15,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:47:15,642 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:47:15,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:15,642 INFO ]: With dead ends: 15 [2018-06-24 20:47:15,642 INFO ]: Without dead ends: 15 [2018-06-24 20:47:15,642 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:15,643 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:47:15,645 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:47:15,645 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:47:15,645 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-24 20:47:15,645 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2018-06-24 20:47:15,646 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:15,646 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-24 20:47:15,646 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:47:15,646 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-24 20:47:15,646 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:47:15,646 INFO ]: Found error trace [2018-06-24 20:47:15,646 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:15,646 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:15,646 INFO ]: Analyzing trace with hash 1131701029, now seen corresponding path program 3 times [2018-06-24 20:47:15,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:15,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:15,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,647 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:15,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,753 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:15,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:15,753 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-24 20:47:15,760 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:15,773 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:47:15,773 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:15,774 INFO ]: Computing forward predicates... [2018-06-24 20:47:15,844 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:15,863 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:15,863 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-24 20:47:15,864 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:47:15,864 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:47:15,864 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:47:15,864 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 8 states. [2018-06-24 20:47:16,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:16,303 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-24 20:47:16,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:47:16,304 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 20:47:16,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:16,305 INFO ]: With dead ends: 17 [2018-06-24 20:47:16,305 INFO ]: Without dead ends: 17 [2018-06-24 20:47:16,305 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:47:16,305 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:47:16,307 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-24 20:47:16,307 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:47:16,307 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-24 20:47:16,307 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2018-06-24 20:47:16,307 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:16,307 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-24 20:47:16,307 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:47:16,307 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-24 20:47:16,308 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:47:16,308 INFO ]: Found error trace [2018-06-24 20:47:16,308 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:16,308 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:16,308 INFO ]: Analyzing trace with hash -758292527, now seen corresponding path program 1 times [2018-06-24 20:47:16,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:16,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:16,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:16,309 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:16,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:16,318 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,375 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:16,376 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:16,376 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-24 20:47:16,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:16,405 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,407 INFO ]: Computing forward predicates... [2018-06-24 20:47:16,439 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:16,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:16,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:47:16,460 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:47:16,460 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:47:16,460 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:16,460 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 7 states. [2018-06-24 20:47:16,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:16,473 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-24 20:47:16,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:47:16,473 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-24 20:47:16,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:16,474 INFO ]: With dead ends: 19 [2018-06-24 20:47:16,474 INFO ]: Without dead ends: 19 [2018-06-24 20:47:16,474 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:16,474 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:47:16,476 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-24 20:47:16,476 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:47:16,477 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-24 20:47:16,477 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2018-06-24 20:47:16,477 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:16,477 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-24 20:47:16,477 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:47:16,477 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-24 20:47:16,477 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:47:16,477 INFO ]: Found error trace [2018-06-24 20:47:16,477 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:16,477 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:16,478 INFO ]: Analyzing trace with hash 948818847, now seen corresponding path program 1 times [2018-06-24 20:47:16,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:16,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:16,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:16,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:16,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:16,497 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,599 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:16,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:16,599 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-24 20:47:16,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:16,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,635 INFO ]: Computing forward predicates... [2018-06-24 20:47:16,640 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:16,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:16,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:47:16,659 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:47:16,659 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:47:16,659 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:16,659 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 7 states. [2018-06-24 20:47:16,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:16,701 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-24 20:47:16,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:47:16,701 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-24 20:47:16,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:16,702 INFO ]: With dead ends: 19 [2018-06-24 20:47:16,702 INFO ]: Without dead ends: 19 [2018-06-24 20:47:16,702 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:16,702 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:47:16,704 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:47:16,704 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:47:16,704 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-24 20:47:16,704 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-06-24 20:47:16,704 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:16,704 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-24 20:47:16,704 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:47:16,704 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-24 20:47:16,705 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:47:16,705 INFO ]: Found error trace [2018-06-24 20:47:16,705 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:16,705 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:16,705 INFO ]: Analyzing trace with hash 1412166193, now seen corresponding path program 2 times [2018-06-24 20:47:16,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:16,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:16,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:16,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:16,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:16,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,939 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:16,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:16,939 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-24 20:47:16,950 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:16,967 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:16,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,969 INFO ]: Computing forward predicates... [2018-06-24 20:47:16,990 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:17,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:17,009 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:47:17,009 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:47:17,009 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:47:17,010 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:17,010 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2018-06-24 20:47:17,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:17,056 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-24 20:47:17,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:47:17,058 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 20:47:17,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:17,058 INFO ]: With dead ends: 22 [2018-06-24 20:47:17,058 INFO ]: Without dead ends: 22 [2018-06-24 20:47:17,059 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:17,059 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:47:17,061 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 20:47:17,061 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:47:17,061 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-24 20:47:17,061 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2018-06-24 20:47:17,061 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:17,061 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-24 20:47:17,061 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:47:17,061 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-24 20:47:17,062 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:47:17,062 INFO ]: Found error trace [2018-06-24 20:47:17,062 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:17,062 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:17,062 INFO ]: Analyzing trace with hash -627786384, now seen corresponding path program 2 times [2018-06-24 20:47:17,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:17,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:17,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,063 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:17,063 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,149 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:17,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:17,149 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-24 20:47:17,155 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:17,183 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:17,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,185 INFO ]: Computing forward predicates... [2018-06-24 20:47:17,192 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:17,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:17,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:47:17,218 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:47:17,218 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:47:17,218 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:47:17,219 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-06-24 20:47:17,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:17,255 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-24 20:47:17,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:47:17,255 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-24 20:47:17,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:17,256 INFO ]: With dead ends: 22 [2018-06-24 20:47:17,256 INFO ]: Without dead ends: 22 [2018-06-24 20:47:17,256 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:47:17,256 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:47:17,258 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:47:17,258 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:47:17,258 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-24 20:47:17,259 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2018-06-24 20:47:17,259 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:17,259 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-24 20:47:17,259 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:47:17,259 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-24 20:47:17,259 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:47:17,259 INFO ]: Found error trace [2018-06-24 20:47:17,259 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:17,259 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:17,259 INFO ]: Analyzing trace with hash 2037059007, now seen corresponding path program 3 times [2018-06-24 20:47:17,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:17,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:17,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:17,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,340 INFO ]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:17,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:17,340 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-24 20:47:17,346 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:17,383 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:47:17,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,385 INFO ]: Computing forward predicates... [2018-06-24 20:47:17,437 INFO ]: Checked inductivity of 22 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:17,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:17,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-06-24 20:47:17,456 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:47:17,456 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:47:17,456 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:17,456 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 13 states. [2018-06-24 20:47:17,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:17,729 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-24 20:47:17,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:47:17,729 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-24 20:47:17,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:17,730 INFO ]: With dead ends: 35 [2018-06-24 20:47:17,730 INFO ]: Without dead ends: 35 [2018-06-24 20:47:17,730 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:17,730 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:47:17,733 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-24 20:47:17,733 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:47:17,733 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-06-24 20:47:17,733 INFO ]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-06-24 20:47:17,733 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:17,733 INFO ]: Abstraction has 23 states and 27 transitions. [2018-06-24 20:47:17,733 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:47:17,733 INFO ]: Start isEmpty. Operand 23 states and 27 transitions. [2018-06-24 20:47:17,734 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:47:17,734 INFO ]: Found error trace [2018-06-24 20:47:17,734 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:17,734 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:17,734 INFO ]: Analyzing trace with hash -131109743, now seen corresponding path program 3 times [2018-06-24 20:47:17,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:17,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:17,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,735 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:17,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,747 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,836 INFO ]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:17,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:17,836 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-24 20:47:17,841 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:17,864 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:47:17,864 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,865 INFO ]: Computing forward predicates... [2018-06-24 20:47:17,884 INFO ]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:17,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:17,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:47:17,903 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:17,903 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:17,903 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:17,903 INFO ]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2018-06-24 20:47:17,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:17,927 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-24 20:47:17,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:47:17,927 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-24 20:47:17,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:17,928 INFO ]: With dead ends: 27 [2018-06-24 20:47:17,928 INFO ]: Without dead ends: 27 [2018-06-24 20:47:17,928 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:17,928 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:47:17,930 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-24 20:47:17,930 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:47:17,930 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-06-24 20:47:17,930 INFO ]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2018-06-24 20:47:17,931 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:17,931 INFO ]: Abstraction has 25 states and 29 transitions. [2018-06-24 20:47:17,931 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:17,931 INFO ]: Start isEmpty. Operand 25 states and 29 transitions. [2018-06-24 20:47:17,931 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:47:17,931 INFO ]: Found error trace [2018-06-24 20:47:17,931 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:17,931 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:17,931 INFO ]: Analyzing trace with hash -160179003, now seen corresponding path program 4 times [2018-06-24 20:47:17,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:17,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:17,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,932 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:17,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,947 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:18,062 INFO ]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:18,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:18,062 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-24 20:47:18,069 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:18,094 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:18,094 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:18,096 INFO ]: Computing forward predicates... [2018-06-24 20:47:18,104 INFO ]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:18,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:18,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:47:18,136 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:47:18,136 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:47:18,136 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:47:18,136 INFO ]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2018-06-24 20:47:18,547 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:18,547 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-24 20:47:18,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:47:18,548 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-24 20:47:18,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:18,548 INFO ]: With dead ends: 26 [2018-06-24 20:47:18,548 INFO ]: Without dead ends: 26 [2018-06-24 20:47:18,549 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:47:18,549 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:47:18,551 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:47:18,551 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:47:18,551 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-24 20:47:18,551 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2018-06-24 20:47:18,551 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:18,551 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-24 20:47:18,551 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:47:18,552 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-24 20:47:18,552 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:47:18,552 INFO ]: Found error trace [2018-06-24 20:47:18,552 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:18,552 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:18,552 INFO ]: Analyzing trace with hash -1455567119, now seen corresponding path program 4 times [2018-06-24 20:47:18,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:18,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:18,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:18,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:18,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:18,560 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:18,787 INFO ]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:18,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:18,787 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-24 20:47:18,794 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:18,807 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:18,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:18,808 INFO ]: Computing forward predicates... [2018-06-24 20:47:18,883 INFO ]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:18,907 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:18,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:47:18,908 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:47:18,908 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:47:18,908 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:18,908 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 13 states. [2018-06-24 20:47:18,951 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:18,951 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-24 20:47:18,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:47:18,951 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-24 20:47:18,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:18,952 INFO ]: With dead ends: 30 [2018-06-24 20:47:18,952 INFO ]: Without dead ends: 30 [2018-06-24 20:47:18,952 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:18,952 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:47:18,954 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-24 20:47:18,954 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:47:18,955 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-06-24 20:47:18,955 INFO ]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2018-06-24 20:47:18,955 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:18,955 INFO ]: Abstraction has 28 states and 32 transitions. [2018-06-24 20:47:18,955 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:47:18,955 INFO ]: Start isEmpty. Operand 28 states and 32 transitions. [2018-06-24 20:47:18,955 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:47:18,955 INFO ]: Found error trace [2018-06-24 20:47:18,955 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:18,955 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:18,955 INFO ]: Analyzing trace with hash 73365014, now seen corresponding path program 5 times [2018-06-24 20:47:18,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:18,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:18,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:18,956 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:18,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:18,968 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,074 INFO ]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:19,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:19,074 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-24 20:47:19,079 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:19,096 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:47:19,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,097 INFO ]: Computing forward predicates... [2018-06-24 20:47:19,106 INFO ]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:19,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:19,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:47:19,129 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:19,129 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:19,130 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:19,130 INFO ]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2018-06-24 20:47:19,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:19,161 INFO ]: Finished difference Result 29 states and 33 transitions. [2018-06-24 20:47:19,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:47:19,161 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-24 20:47:19,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:19,162 INFO ]: With dead ends: 29 [2018-06-24 20:47:19,162 INFO ]: Without dead ends: 29 [2018-06-24 20:47:19,162 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:19,162 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:47:19,164 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:47:19,164 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:19,164 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-06-24 20:47:19,164 INFO ]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2018-06-24 20:47:19,164 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:19,164 INFO ]: Abstraction has 29 states and 33 transitions. [2018-06-24 20:47:19,164 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:19,164 INFO ]: Start isEmpty. Operand 29 states and 33 transitions. [2018-06-24 20:47:19,165 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:47:19,165 INFO ]: Found error trace [2018-06-24 20:47:19,165 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:19,165 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:19,165 INFO ]: Analyzing trace with hash -1276705051, now seen corresponding path program 6 times [2018-06-24 20:47:19,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:19,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:19,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,166 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:19,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,174 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,271 INFO ]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:19,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:19,271 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-24 20:47:19,276 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:19,301 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:47:19,301 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,302 INFO ]: Computing forward predicates... [2018-06-24 20:47:19,313 INFO ]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:19,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:19,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:47:19,337 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:47:19,337 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:47:19,337 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:47:19,337 INFO ]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2018-06-24 20:47:19,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:19,372 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-24 20:47:19,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:47:19,372 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-24 20:47:19,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:19,373 INFO ]: With dead ends: 30 [2018-06-24 20:47:19,373 INFO ]: Without dead ends: 30 [2018-06-24 20:47:19,373 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:47:19,373 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:47:19,375 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:47:19,375 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:47:19,375 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-24 20:47:19,375 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-06-24 20:47:19,375 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:19,375 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-24 20:47:19,375 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:47:19,375 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-24 20:47:19,376 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:47:19,376 INFO ]: Found error trace [2018-06-24 20:47:19,376 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:19,376 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:19,376 INFO ]: Analyzing trace with hash 1346181457, now seen corresponding path program 5 times [2018-06-24 20:47:19,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:19,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:19,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,377 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:19,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,392 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,515 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:19,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:19,515 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-24 20:47:19,521 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:19,585 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:19,585 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,587 INFO ]: Computing forward predicates... [2018-06-24 20:47:19,625 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:19,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:19,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:47:19,644 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:47:19,644 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:47:19,644 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:19,644 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2018-06-24 20:47:19,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:19,828 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-24 20:47:19,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:47:19,828 INFO ]: Start accepts. Automaton has 7 states. Word has length 18 [2018-06-24 20:47:19,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:19,829 INFO ]: With dead ends: 43 [2018-06-24 20:47:19,829 INFO ]: Without dead ends: 31 [2018-06-24 20:47:19,829 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:19,829 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:47:19,830 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:47:19,830 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:47:19,831 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-06-24 20:47:19,831 INFO ]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 18 [2018-06-24 20:47:19,831 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:19,831 INFO ]: Abstraction has 31 states and 35 transitions. [2018-06-24 20:47:19,831 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:47:19,831 INFO ]: Start isEmpty. Operand 31 states and 35 transitions. [2018-06-24 20:47:19,831 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:47:19,831 INFO ]: Found error trace [2018-06-24 20:47:19,831 INFO ]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:19,831 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:19,831 INFO ]: Analyzing trace with hash -179204106, now seen corresponding path program 7 times [2018-06-24 20:47:19,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:19,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:19,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:19,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,947 INFO ]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:19,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:19,947 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-24 20:47:19,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:19,984 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,986 INFO ]: Computing forward predicates... [2018-06-24 20:47:19,996 INFO ]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:20,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:20,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:47:20,028 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:47:20,028 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:47:20,028 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:20,028 INFO ]: Start difference. First operand 31 states and 35 transitions. Second operand 13 states. [2018-06-24 20:47:20,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:20,149 INFO ]: Finished difference Result 32 states and 36 transitions. [2018-06-24 20:47:20,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:47:20,149 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-24 20:47:20,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:20,150 INFO ]: With dead ends: 32 [2018-06-24 20:47:20,150 INFO ]: Without dead ends: 32 [2018-06-24 20:47:20,150 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:20,150 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:47:20,152 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:47:20,152 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:47:20,153 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-24 20:47:20,153 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2018-06-24 20:47:20,153 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:20,153 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-24 20:47:20,153 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:47:20,153 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-24 20:47:20,153 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:47:20,153 INFO ]: Found error trace [2018-06-24 20:47:20,153 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:20,153 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:20,154 INFO ]: Analyzing trace with hash -935612862, now seen corresponding path program 6 times [2018-06-24 20:47:20,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:20,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:20,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:20,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:20,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:20,167 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:20,471 INFO ]: Checked inductivity of 69 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:20,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:20,471 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-24 20:47:20,477 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:20,499 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:47:20,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:20,502 INFO ]: Computing forward predicates... [2018-06-24 20:47:20,755 INFO ]: Checked inductivity of 69 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:20,785 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:20,785 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 18 [2018-06-24 20:47:20,785 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:47:20,785 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:47:20,785 INFO ]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:47:20,786 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 18 states. [2018-06-24 20:47:21,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:21,043 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-24 20:47:21,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:47:21,043 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 20:47:21,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:21,044 INFO ]: With dead ends: 42 [2018-06-24 20:47:21,044 INFO ]: Without dead ends: 33 [2018-06-24 20:47:21,044 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:47:21,045 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:47:21,046 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:47:21,046 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:47:21,047 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-24 20:47:21,047 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-06-24 20:47:21,047 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:21,047 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-24 20:47:21,047 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:47:21,047 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-24 20:47:21,048 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:47:21,048 INFO ]: Found error trace [2018-06-24 20:47:21,048 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:21,048 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:21,048 INFO ]: Analyzing trace with hash -516413179, now seen corresponding path program 8 times [2018-06-24 20:47:21,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:21,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:21,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:21,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:21,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:21,059 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:21,363 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 20:47:21,804 INFO ]: Checked inductivity of 69 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:21,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:21,804 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:21,810 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:21,827 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:21,827 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:21,829 INFO ]: Computing forward predicates... [2018-06-24 20:47:22,084 INFO ]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:22,106 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:22,106 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 18 [2018-06-24 20:47:22,106 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:47:22,106 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:47:22,106 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:47:22,106 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 18 states. [2018-06-24 20:47:23,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:23,147 INFO ]: Finished difference Result 49 states and 54 transitions. [2018-06-24 20:47:23,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:47:23,147 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 20:47:23,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:23,147 INFO ]: With dead ends: 49 [2018-06-24 20:47:23,147 INFO ]: Without dead ends: 49 [2018-06-24 20:47:23,148 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:47:23,148 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:47:23,150 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-06-24 20:47:23,150 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:47:23,151 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-24 20:47:23,151 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-06-24 20:47:23,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:23,151 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-24 20:47:23,151 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:47:23,151 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-24 20:47:23,152 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:47:23,152 INFO ]: Found error trace [2018-06-24 20:47:23,152 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:23,152 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:23,152 INFO ]: Analyzing trace with hash 1343207281, now seen corresponding path program 7 times [2018-06-24 20:47:23,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:23,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:23,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:23,152 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:23,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:23,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:23,274 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:23,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:23,274 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-24 20:47:23,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:23,309 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:23,311 INFO ]: Computing forward predicates... [2018-06-24 20:47:23,469 INFO ]: Checked inductivity of 72 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:47:23,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:23,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2018-06-24 20:47:23,490 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:47:23,490 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:47:23,490 INFO ]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:47:23,490 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 19 states. [2018-06-24 20:47:24,067 WARN ]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 20:47:24,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:24,068 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-24 20:47:24,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:47:24,068 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:47:24,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:24,068 INFO ]: With dead ends: 42 [2018-06-24 20:47:24,068 INFO ]: Without dead ends: 34 [2018-06-24 20:47:24,069 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:47:24,069 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:47:24,071 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:47:24,071 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:47:24,071 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-24 20:47:24,071 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-06-24 20:47:24,072 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:24,072 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-24 20:47:24,072 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:47:24,072 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-24 20:47:24,072 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:47:24,072 INFO ]: Found error trace [2018-06-24 20:47:24,072 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:24,072 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:24,072 INFO ]: Analyzing trace with hash 1170649520, now seen corresponding path program 9 times [2018-06-24 20:47:24,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:24,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:24,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:24,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:24,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:24,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:24,275 INFO ]: Checked inductivity of 72 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:24,275 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:24,275 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-24 20:47:24,280 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:24,298 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:47:24,298 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:24,300 INFO ]: Computing forward predicates... [2018-06-24 20:47:24,339 INFO ]: Checked inductivity of 72 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:24,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:24,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:47:24,358 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:24,358 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:24,359 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:24,359 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 11 states. [2018-06-24 20:47:24,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:24,660 INFO ]: Finished difference Result 38 states and 42 transitions. [2018-06-24 20:47:24,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:47:24,660 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-24 20:47:24,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:24,661 INFO ]: With dead ends: 38 [2018-06-24 20:47:24,661 INFO ]: Without dead ends: 38 [2018-06-24 20:47:24,661 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:47:24,661 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:47:24,663 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-06-24 20:47:24,663 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:47:24,664 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-24 20:47:24,664 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-06-24 20:47:24,664 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:24,664 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-24 20:47:24,664 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:24,664 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-24 20:47:24,665 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:47:24,665 INFO ]: Found error trace [2018-06-24 20:47:24,665 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:24,665 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:24,665 INFO ]: Analyzing trace with hash -1027812318, now seen corresponding path program 8 times [2018-06-24 20:47:24,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:24,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:24,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:24,667 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:24,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:24,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:24,804 INFO ]: Checked inductivity of 76 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:24,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:24,804 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-24 20:47:24,810 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:24,838 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:24,838 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:24,841 INFO ]: Computing forward predicates... [2018-06-24 20:47:24,968 INFO ]: Checked inductivity of 76 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:24,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:24,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2018-06-24 20:47:24,987 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:47:24,987 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:47:24,987 INFO ]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:47:24,987 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 20 states. [2018-06-24 20:47:25,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:25,252 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-24 20:47:25,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:47:25,252 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-24 20:47:25,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:25,253 INFO ]: With dead ends: 42 [2018-06-24 20:47:25,253 INFO ]: Without dead ends: 35 [2018-06-24 20:47:25,253 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:47:25,253 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:47:25,254 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:47:25,254 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:47:25,255 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-24 20:47:25,255 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-06-24 20:47:25,255 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:25,255 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-24 20:47:25,255 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:47:25,255 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-24 20:47:25,255 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:47:25,255 INFO ]: Found error trace [2018-06-24 20:47:25,255 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:25,255 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:25,256 INFO ]: Analyzing trace with hash 1929985637, now seen corresponding path program 10 times [2018-06-24 20:47:25,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:25,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:25,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:25,256 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:25,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:25,266 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:25,395 INFO ]: Checked inductivity of 76 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:25,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:25,395 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-24 20:47:25,402 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:25,421 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:25,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:25,424 INFO ]: Computing forward predicates... [2018-06-24 20:47:25,588 INFO ]: Checked inductivity of 76 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:25,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:25,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2018-06-24 20:47:25,607 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:47:25,607 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:47:25,607 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:47:25,607 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 20 states. [2018-06-24 20:47:26,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:26,471 INFO ]: Finished difference Result 53 states and 58 transitions. [2018-06-24 20:47:26,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:47:26,488 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-24 20:47:26,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:26,489 INFO ]: With dead ends: 53 [2018-06-24 20:47:26,489 INFO ]: Without dead ends: 53 [2018-06-24 20:47:26,489 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:47:26,490 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:47:26,491 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-06-24 20:47:26,491 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:47:26,496 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-24 20:47:26,496 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-06-24 20:47:26,496 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:26,496 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-24 20:47:26,496 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:47:26,496 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-24 20:47:26,497 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:47:26,497 INFO ]: Found error trace [2018-06-24 20:47:26,497 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:26,497 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:26,497 INFO ]: Analyzing trace with hash -1514975855, now seen corresponding path program 9 times [2018-06-24 20:47:26,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:26,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:26,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:26,497 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:26,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:26,505 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:26,800 INFO ]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:26,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:26,800 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-24 20:47:26,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:26,851 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:47:26,851 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:26,854 INFO ]: Computing forward predicates... [2018-06-24 20:47:26,977 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:26,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:26,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2018-06-24 20:47:26,996 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:47:26,996 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:47:26,996 INFO ]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:47:26,996 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 21 states. [2018-06-24 20:47:27,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:27,263 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-24 20:47:27,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:47:27,263 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 20:47:27,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:27,263 INFO ]: With dead ends: 42 [2018-06-24 20:47:27,263 INFO ]: Without dead ends: 36 [2018-06-24 20:47:27,264 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:47:27,264 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:47:27,266 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:47:27,266 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:47:27,266 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-24 20:47:27,266 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-06-24 20:47:27,266 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:27,266 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-24 20:47:27,266 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:47:27,266 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-24 20:47:27,267 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:47:27,267 INFO ]: Found error trace [2018-06-24 20:47:27,267 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:27,267 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:27,267 INFO ]: Analyzing trace with hash -300398512, now seen corresponding path program 11 times [2018-06-24 20:47:27,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:27,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:27,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:27,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:27,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:27,276 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:27,517 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:27,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:27,518 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-24 20:47:27,523 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:27,545 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:27,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:27,548 INFO ]: Computing forward predicates... [2018-06-24 20:47:27,709 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:27,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:27,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 26 [2018-06-24 20:47:27,728 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:27,728 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:27,728 INFO ]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:27,728 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 26 states. [2018-06-24 20:47:29,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:29,063 INFO ]: Finished difference Result 43 states and 49 transitions. [2018-06-24 20:47:29,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:47:29,063 INFO ]: Start accepts. Automaton has 26 states. Word has length 22 [2018-06-24 20:47:29,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:29,064 INFO ]: With dead ends: 43 [2018-06-24 20:47:29,064 INFO ]: Without dead ends: 43 [2018-06-24 20:47:29,064 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=529, Invalid=2021, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:47:29,064 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:47:29,066 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-06-24 20:47:29,066 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:47:29,066 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-24 20:47:29,066 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-06-24 20:47:29,066 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:29,066 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-24 20:47:29,066 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:29,067 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-24 20:47:29,067 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:47:29,067 INFO ]: Found error trace [2018-06-24 20:47:29,067 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:29,067 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:29,067 INFO ]: Analyzing trace with hash 562823682, now seen corresponding path program 10 times [2018-06-24 20:47:29,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:29,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:29,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:29,068 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:29,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:29,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:29,466 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:29,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:29,466 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-24 20:47:29,472 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:29,490 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:29,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:29,492 INFO ]: Computing forward predicates... [2018-06-24 20:47:29,576 INFO ]: Checked inductivity of 87 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:29,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:29,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 26 [2018-06-24 20:47:29,594 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:29,594 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:29,595 INFO ]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:29,595 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 26 states. [2018-06-24 20:47:30,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:30,211 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-24 20:47:30,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:30,211 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-24 20:47:30,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:30,211 INFO ]: With dead ends: 48 [2018-06-24 20:47:30,211 INFO ]: Without dead ends: 43 [2018-06-24 20:47:30,211 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:47:30,211 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:47:30,213 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-24 20:47:30,213 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:47:30,213 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-06-24 20:47:30,213 INFO ]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-06-24 20:47:30,213 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:30,213 INFO ]: Abstraction has 37 states and 41 transitions. [2018-06-24 20:47:30,213 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:30,213 INFO ]: Start isEmpty. Operand 37 states and 41 transitions. [2018-06-24 20:47:30,214 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:47:30,214 INFO ]: Found error trace [2018-06-24 20:47:30,214 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:30,214 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:30,214 INFO ]: Analyzing trace with hash -722830395, now seen corresponding path program 12 times [2018-06-24 20:47:30,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:30,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:30,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:30,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:30,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:30,223 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:30,419 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:30,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:30,419 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-24 20:47:30,425 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:30,448 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:47:30,448 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:30,450 INFO ]: Computing forward predicates... [2018-06-24 20:47:30,537 INFO ]: Checked inductivity of 87 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:30,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:30,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 26 [2018-06-24 20:47:30,556 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:30,556 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:30,556 INFO ]: CoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:30,556 INFO ]: Start difference. First operand 37 states and 41 transitions. Second operand 26 states. [2018-06-24 20:47:31,624 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-24 20:47:31,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:31,727 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-24 20:47:31,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:47:31,727 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-24 20:47:31,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:31,727 INFO ]: With dead ends: 58 [2018-06-24 20:47:31,727 INFO ]: Without dead ends: 58 [2018-06-24 20:47:31,728 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:47:31,728 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:47:31,730 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-06-24 20:47:31,730 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:47:31,730 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-06-24 20:47:31,730 INFO ]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-06-24 20:47:31,730 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:31,730 INFO ]: Abstraction has 37 states and 41 transitions. [2018-06-24 20:47:31,730 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:31,730 INFO ]: Start isEmpty. Operand 37 states and 41 transitions. [2018-06-24 20:47:31,731 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:47:31,731 INFO ]: Found error trace [2018-06-24 20:47:31,731 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:31,731 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:31,731 INFO ]: Analyzing trace with hash 550099889, now seen corresponding path program 11 times [2018-06-24 20:47:31,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:31,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:31,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:31,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:31,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:31,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:32,055 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:32,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:32,055 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-24 20:47:32,064 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:32,090 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:32,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:32,093 INFO ]: Computing forward predicates... [2018-06-24 20:47:32,221 INFO ]: Checked inductivity of 94 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:47:32,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:32,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 26 [2018-06-24 20:47:32,240 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:32,240 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:32,241 INFO ]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:32,241 INFO ]: Start difference. First operand 37 states and 41 transitions. Second operand 26 states. [2018-06-24 20:47:32,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:32,515 INFO ]: Finished difference Result 57 states and 62 transitions. [2018-06-24 20:47:32,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:32,515 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-24 20:47:32,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:32,516 INFO ]: With dead ends: 57 [2018-06-24 20:47:32,516 INFO ]: Without dead ends: 45 [2018-06-24 20:47:32,516 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:47:32,517 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:47:32,518 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-06-24 20:47:32,518 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:47:32,518 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-24 20:47:32,518 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2018-06-24 20:47:32,518 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:32,518 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-24 20:47:32,518 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:32,518 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-24 20:47:32,519 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:47:32,519 INFO ]: Found error trace [2018-06-24 20:47:32,519 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:32,519 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:32,519 INFO ]: Analyzing trace with hash -933316880, now seen corresponding path program 13 times [2018-06-24 20:47:32,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:32,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:32,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:32,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:32,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:32,535 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:32,831 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:32,831 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:32,831 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-24 20:47:32,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:32,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:32,858 INFO ]: Computing forward predicates... [2018-06-24 20:47:33,321 INFO ]: Checked inductivity of 94 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:33,339 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:33,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 26 [2018-06-24 20:47:33,340 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:33,340 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:33,340 INFO ]: CoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:33,340 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 26 states. [2018-06-24 20:47:34,873 WARN ]: Spent 288.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-06-24 20:47:35,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:35,056 INFO ]: Finished difference Result 60 states and 67 transitions. [2018-06-24 20:47:35,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 20:47:35,056 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-24 20:47:35,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:35,057 INFO ]: With dead ends: 60 [2018-06-24 20:47:35,057 INFO ]: Without dead ends: 60 [2018-06-24 20:47:35,058 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=537, Invalid=2769, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:47:35,058 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 20:47:35,059 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 38. [2018-06-24 20:47:35,059 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:47:35,060 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-24 20:47:35,060 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2018-06-24 20:47:35,060 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:35,060 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-24 20:47:35,060 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:35,060 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-24 20:47:35,060 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:47:35,060 INFO ]: Found error trace [2018-06-24 20:47:35,060 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:35,060 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:35,060 INFO ]: Analyzing trace with hash 155662306, now seen corresponding path program 12 times [2018-06-24 20:47:35,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:35,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:35,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:35,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:35,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:35,069 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:35,547 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:35,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:35,547 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-24 20:47:35,552 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:35,576 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:47:35,576 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:35,578 INFO ]: Computing forward predicates... [2018-06-24 20:47:35,802 INFO ]: Checked inductivity of 102 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:35,827 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:35,827 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 26 [2018-06-24 20:47:35,827 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:35,827 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:35,827 INFO ]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:35,827 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 26 states. [2018-06-24 20:47:36,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:36,050 INFO ]: Finished difference Result 50 states and 54 transitions. [2018-06-24 20:47:36,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:36,050 INFO ]: Start accepts. Automaton has 26 states. Word has length 25 [2018-06-24 20:47:36,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:36,050 INFO ]: With dead ends: 50 [2018-06-24 20:47:36,050 INFO ]: Without dead ends: 47 [2018-06-24 20:47:36,051 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:47:36,051 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:47:36,052 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-24 20:47:36,052 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:47:36,052 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-24 20:47:36,052 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-06-24 20:47:36,052 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:36,052 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-24 20:47:36,052 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:36,052 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-24 20:47:36,053 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:47:36,053 INFO ]: Found error trace [2018-06-24 20:47:36,053 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:36,053 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:36,053 INFO ]: Analyzing trace with hash 1131536677, now seen corresponding path program 14 times [2018-06-24 20:47:36,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:36,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:36,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:36,054 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:36,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:36,063 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:36,340 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:36,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:36,340 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-24 20:47:36,345 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:36,368 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:36,368 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:36,370 INFO ]: Computing forward predicates... [2018-06-24 20:47:36,440 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:36,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:36,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 26 [2018-06-24 20:47:36,458 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:36,459 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:36,459 INFO ]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:36,459 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-06-24 20:47:36,937 WARN ]: Spent 150.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-06-24 20:47:37,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:37,699 INFO ]: Finished difference Result 62 states and 69 transitions. [2018-06-24 20:47:37,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-24 20:47:37,699 INFO ]: Start accepts. Automaton has 26 states. Word has length 25 [2018-06-24 20:47:37,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:37,700 INFO ]: With dead ends: 62 [2018-06-24 20:47:37,700 INFO ]: Without dead ends: 62 [2018-06-24 20:47:37,701 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=613, Invalid=3169, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:47:37,701 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-24 20:47:37,702 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 39. [2018-06-24 20:47:37,702 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:47:37,703 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-24 20:47:37,703 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-06-24 20:47:37,703 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:37,703 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-24 20:47:37,703 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:37,703 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-24 20:47:37,703 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:47:37,703 INFO ]: Found error trace [2018-06-24 20:47:37,703 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:37,703 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:37,703 INFO ]: Analyzing trace with hash 812999121, now seen corresponding path program 13 times [2018-06-24 20:47:37,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:37,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:37,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:37,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:37,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:37,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:37,996 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:37,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:37,996 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-24 20:47:38,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:38,029 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:38,031 INFO ]: Computing forward predicates... [2018-06-24 20:47:38,088 INFO ]: Checked inductivity of 111 backedges. 20 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:38,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:38,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 26 [2018-06-24 20:47:38,107 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:38,107 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:38,108 INFO ]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:38,108 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-06-24 20:47:38,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:38,373 INFO ]: Finished difference Result 51 states and 55 transitions. [2018-06-24 20:47:38,373 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:38,373 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-24 20:47:38,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:38,373 INFO ]: With dead ends: 51 [2018-06-24 20:47:38,373 INFO ]: Without dead ends: 49 [2018-06-24 20:47:38,373 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:47:38,374 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:47:38,375 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-06-24 20:47:38,375 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:47:38,375 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-24 20:47:38,375 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2018-06-24 20:47:38,375 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:38,375 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-24 20:47:38,375 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:38,375 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-24 20:47:38,376 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:47:38,376 INFO ]: Found error trace [2018-06-24 20:47:38,376 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:38,376 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:38,376 INFO ]: Analyzing trace with hash 717487504, now seen corresponding path program 15 times [2018-06-24 20:47:38,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:38,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:38,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:38,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:38,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:38,385 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:38,721 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 20:47:39,050 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:39,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:39,050 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-24 20:47:39,056 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:39,085 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:47:39,085 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:39,087 INFO ]: Computing forward predicates... [2018-06-24 20:47:39,146 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:39,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:39,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 26 [2018-06-24 20:47:39,165 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:39,165 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:39,165 INFO ]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:39,165 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 26 states. [2018-06-24 20:47:40,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:40,576 INFO ]: Finished difference Result 64 states and 71 transitions. [2018-06-24 20:47:40,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:47:40,576 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-24 20:47:40,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:40,576 INFO ]: With dead ends: 64 [2018-06-24 20:47:40,576 INFO ]: Without dead ends: 64 [2018-06-24 20:47:40,577 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=696, Invalid=3594, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:47:40,577 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 20:47:40,578 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 40. [2018-06-24 20:47:40,578 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:47:40,579 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-24 20:47:40,579 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2018-06-24 20:47:40,579 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:40,579 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-24 20:47:40,579 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:40,579 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-24 20:47:40,579 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:47:40,579 INFO ]: Found error trace [2018-06-24 20:47:40,579 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:40,579 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:40,579 INFO ]: Analyzing trace with hash -284396094, now seen corresponding path program 14 times [2018-06-24 20:47:40,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:40,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:40,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:40,580 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:40,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:40,587 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:41,081 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:41,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:41,081 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-24 20:47:41,087 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:41,114 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:41,114 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:41,116 INFO ]: Computing forward predicates... [2018-06-24 20:47:41,172 INFO ]: Checked inductivity of 121 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:41,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:41,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 26 [2018-06-24 20:47:41,197 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:41,197 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:41,198 INFO ]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:41,198 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 26 states. [2018-06-24 20:47:41,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:41,468 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-24 20:47:41,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:41,468 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:47:41,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:41,469 INFO ]: With dead ends: 52 [2018-06-24 20:47:41,469 INFO ]: Without dead ends: 51 [2018-06-24 20:47:41,469 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:47:41,469 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:47:41,470 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-24 20:47:41,470 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:47:41,470 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-06-24 20:47:41,471 INFO ]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-06-24 20:47:41,471 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:41,471 INFO ]: Abstraction has 41 states and 45 transitions. [2018-06-24 20:47:41,471 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:41,471 INFO ]: Start isEmpty. Operand 41 states and 45 transitions. [2018-06-24 20:47:41,471 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:47:41,471 INFO ]: Found error trace [2018-06-24 20:47:41,471 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:41,471 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:41,471 INFO ]: Analyzing trace with hash 766865029, now seen corresponding path program 16 times [2018-06-24 20:47:41,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:41,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:41,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:41,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:41,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:41,483 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:41,917 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:41,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:41,917 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-24 20:47:41,922 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:41,944 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:41,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:41,946 INFO ]: Computing forward predicates... [2018-06-24 20:47:41,994 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:42,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:42,013 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 26 [2018-06-24 20:47:42,013 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:42,013 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:42,013 INFO ]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:42,013 INFO ]: Start difference. First operand 41 states and 45 transitions. Second operand 26 states. [2018-06-24 20:47:43,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:43,873 INFO ]: Finished difference Result 66 states and 73 transitions. [2018-06-24 20:47:43,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-24 20:47:43,873 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:47:43,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:43,873 INFO ]: With dead ends: 66 [2018-06-24 20:47:43,873 INFO ]: Without dead ends: 66 [2018-06-24 20:47:43,874 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=786, Invalid=4044, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 20:47:43,874 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 20:47:43,876 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-06-24 20:47:43,876 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:47:43,876 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-06-24 20:47:43,876 INFO ]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-06-24 20:47:43,876 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:43,876 INFO ]: Abstraction has 41 states and 45 transitions. [2018-06-24 20:47:43,876 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:43,876 INFO ]: Start isEmpty. Operand 41 states and 45 transitions. [2018-06-24 20:47:43,876 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:47:43,876 INFO ]: Found error trace [2018-06-24 20:47:43,876 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:43,877 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:43,877 INFO ]: Analyzing trace with hash 56090609, now seen corresponding path program 15 times [2018-06-24 20:47:43,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:43,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:43,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:43,878 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:43,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:43,890 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:44,700 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:44,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:44,700 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-24 20:47:44,705 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:44,731 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:47:44,731 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:44,734 INFO ]: Computing forward predicates... [2018-06-24 20:47:45,088 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:45,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:45,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 36 [2018-06-24 20:47:45,107 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:47:45,107 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:47:45,107 INFO ]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:47:45,107 INFO ]: Start difference. First operand 41 states and 45 transitions. Second operand 36 states. [2018-06-24 20:47:46,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:46,929 INFO ]: Finished difference Result 57 states and 63 transitions. [2018-06-24 20:47:46,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-24 20:47:46,929 INFO ]: Start accepts. Automaton has 36 states. Word has length 28 [2018-06-24 20:47:46,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:46,929 INFO ]: With dead ends: 57 [2018-06-24 20:47:46,929 INFO ]: Without dead ends: 43 [2018-06-24 20:47:46,930 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=734, Invalid=3048, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:47:46,930 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:47:46,931 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-24 20:47:46,931 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:47:46,931 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-24 20:47:46,931 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-24 20:47:46,931 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:46,931 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-24 20:47:46,931 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:47:46,931 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-24 20:47:46,932 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:47:46,932 INFO ]: Found error trace [2018-06-24 20:47:46,932 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:46,932 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:46,932 INFO ]: Analyzing trace with hash 2021243810, now seen corresponding path program 16 times [2018-06-24 20:47:46,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:46,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:46,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:46,932 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:46,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:46,939 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:47,107 INFO ]: Checked inductivity of 144 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:47:47,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:47,107 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-24 20:47:47,107 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:47:47,107 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:47:47,107 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:47:47,108 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2018-06-24 20:47:47,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:47,125 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-24 20:47:47,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:47:47,130 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-24 20:47:47,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:47,130 INFO ]: With dead ends: 15 [2018-06-24 20:47:47,130 INFO ]: Without dead ends: 0 [2018-06-24 20:47:47,130 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:47:47,130 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 20:47:47,130 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 20:47:47,130 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 20:47:47,131 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 20:47:47,131 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-24 20:47:47,131 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:47,131 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 20:47:47,131 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:47:47,131 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 20:47:47,131 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 20:47:47,132 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:47:47,133 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:47 BasicIcfg [2018-06-24 20:47:47,133 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:47:47,134 INFO ]: Toolchain (without parser) took 33633.48 ms. Allocated memory was 309.3 MB in the beginning and 705.2 MB in the end (delta: 395.8 MB). Free memory was 265.8 MB in the beginning and 311.2 MB in the end (delta: -45.4 MB). Peak memory consumption was 350.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:47,135 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:47:47,135 INFO ]: ChcToBoogie took 63.14 ms. Allocated memory is still 309.3 MB. Free memory was 265.8 MB in the beginning and 263.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:47,135 INFO ]: Boogie Preprocessor took 33.27 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 262.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:47:47,136 INFO ]: RCFGBuilder took 191.36 ms. Allocated memory is still 309.3 MB. Free memory was 262.9 MB in the beginning and 255.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:47,136 INFO ]: BlockEncodingV2 took 119.58 ms. Allocated memory is still 309.3 MB. Free memory was 255.9 MB in the beginning and 252.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:47,136 INFO ]: TraceAbstraction took 33216.51 ms. Allocated memory was 309.3 MB in the beginning and 705.2 MB in the end (delta: 395.8 MB). Free memory was 251.9 MB in the beginning and 311.2 MB in the end (delta: -59.3 MB). Peak memory consumption was 336.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:47,139 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.14 ms. Allocated memory is still 309.3 MB. Free memory was 265.8 MB in the beginning and 263.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.27 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 262.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 191.36 ms. Allocated memory is still 309.3 MB. Free memory was 262.9 MB in the beginning and 255.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 119.58 ms. Allocated memory is still 309.3 MB. Free memory was 255.9 MB in the beginning and 252.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 33216.51 ms. Allocated memory was 309.3 MB in the beginning and 705.2 MB in the end (delta: 395.8 MB). Free memory was 251.9 MB in the beginning and 311.2 MB in the end (delta: -59.3 MB). Peak memory consumption was 336.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. SAFE Result, 33.1s OverallTime, 39 OverallIterations, 12 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 319 SDtfs, 193 SDslu, 2307 SDs, 0 SdLazy, 5663 SolverSat, 742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1562 GetRequests, 546 SyntacticMatches, 77 SemanticMatches, 939 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 23.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=36, 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.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 238 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 1338 NumberOfCodeBlocks, 1332 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 111976 SizeOfPredicates, 125 NumberOfNonLiveVariables, 5287 ConjunctsInSsa, 1657 ConjunctsInUnsatCore, 74 InterpolantComputations, 5 PerfectInterpolantSequences, 1306/4463 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-47-47-148.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-47-47-148.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-47-47-148.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-47-47-148.csv Received shutdown request...