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/nested-while_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:53:36,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:53:36,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:53:36,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:53:36,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:53:36,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:53:36,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:53:36,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:53:36,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:53:36,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:53:36,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:53:36,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:53:36,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:53:36,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:53:36,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:53:36,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:53:36,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:53:36,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:53:36,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:53:36,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:53:36,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:53:36,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:53:36,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:53:36,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:53:36,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:53:36,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:53:36,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:53:36,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:53:36,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:53:36,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:53:36,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:53:36,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:53:36,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:53:36,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:53:36,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:53:36,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:53:36,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:53:36,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:53:36,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:53:36,195 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:53:36,195 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:53:36,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:53:36,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:53:36,196 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:53:36,198 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:53:36,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:53:36,198 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:53:36,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:53:36,198 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:53:36,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:53:36,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:53:36,199 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:53:36,199 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:53:36,199 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:53:36,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:53:36,200 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:53:36,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:53:36,200 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:53:36,202 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:53:36,202 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:53:36,249 INFO ]: Repository-Root is: /tmp [2018-06-26 17:53:36,265 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:53:36,269 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:53:36,271 INFO ]: Initializing SmtParser... [2018-06-26 17:53:36,272 INFO ]: SmtParser initialized [2018-06-26 17:53:36,272 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-26 17:53:36,273 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:53:36,362 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 unknown [2018-06-26 17:53:36,577 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-26 17:53:36,581 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:53:36,587 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:53:36,588 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:53:36,588 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:53:36,588 INFO ]: ChcToBoogie initialized [2018-06-26 17:53:36,591 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,642 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36 Unit [2018-06-26 17:53:36,642 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:53:36,643 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:53:36,643 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:53:36,643 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:53:36,665 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,665 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,672 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,673 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,677 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,686 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,687 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... [2018-06-26 17:53:36,688 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:53:36,689 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:53:36,689 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:53:36,689 INFO ]: RCFGBuilder initialized [2018-06-26 17:53:36,695 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:53:36,708 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:53:36,708 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:53:36,708 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:53:36,708 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:53:36,708 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:53:36,708 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:53:37,018 INFO ]: Using library mode [2018-06-26 17:53:37,019 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:53:37 BoogieIcfgContainer [2018-06-26 17:53:37,019 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:53:37,019 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:53:37,019 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:53:37,020 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:53:37,021 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:53:37" (1/1) ... [2018-06-26 17:53:37,036 INFO ]: Initial Icfg 13 locations, 19 edges [2018-06-26 17:53:37,038 INFO ]: Using Remove infeasible edges [2018-06-26 17:53:37,038 INFO ]: Using Maximize final states [2018-06-26 17:53:37,039 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:53:37,039 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:53:37,041 INFO ]: Using Remove sink states [2018-06-26 17:53:37,042 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:53:37,042 INFO ]: Using Use SBE [2018-06-26 17:53:37,049 INFO ]: SBE split 0 edges [2018-06-26 17:53:37,054 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:53:37,056 INFO ]: 0 new accepting states [2018-06-26 17:53:37,115 INFO ]: Removed 12 edges and 4 locations by large block encoding [2018-06-26 17:53:37,117 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:53:37,119 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-26 17:53:37,119 INFO ]: 0 new accepting states [2018-06-26 17:53:37,119 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:53:37,119 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:53:37,120 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:53:37,120 INFO ]: 0 new accepting states [2018-06-26 17:53:37,120 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:53:37,120 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:53:37,120 INFO ]: Encoded RCFG 7 locations, 11 edges [2018-06-26 17:53:37,121 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:53:37 BasicIcfg [2018-06-26 17:53:37,121 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:53:37,122 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:53:37,122 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:53:37,125 INFO ]: TraceAbstraction initialized [2018-06-26 17:53:37,125 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:53:36" (1/4) ... [2018-06-26 17:53:37,126 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553c4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:53:37, skipping insertion in model container [2018-06-26 17:53:37,126 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:53:36" (2/4) ... [2018-06-26 17:53:37,126 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553c4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:53:37, skipping insertion in model container [2018-06-26 17:53:37,126 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:53:37" (3/4) ... [2018-06-26 17:53:37,126 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553c4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:53:37, skipping insertion in model container [2018-06-26 17:53:37,126 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:53:37" (4/4) ... [2018-06-26 17:53:37,128 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:53:37,137 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:53:37,144 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:53:37,182 INFO ]: Using default assertion order modulation [2018-06-26 17:53:37,183 INFO ]: Interprodecural is true [2018-06-26 17:53:37,183 INFO ]: Hoare is false [2018-06-26 17:53:37,183 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:53:37,183 INFO ]: Backedges is TWOTRACK [2018-06-26 17:53:37,183 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:53:37,183 INFO ]: Difference is false [2018-06-26 17:53:37,183 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:53:37,183 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:53:37,196 INFO ]: Start isEmpty. Operand 7 states. [2018-06-26 17:53:37,218 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:53:37,218 INFO ]: Found error trace [2018-06-26 17:53:37,219 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:53:37,219 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:37,223 INFO ]: Analyzing trace with hash 32973444, now seen corresponding path program 1 times [2018-06-26 17:53:37,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:37,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:37,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:37,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:37,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:37,311 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:37,364 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:37,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:53:37,365 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:53:37,367 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:53:37,377 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:53:37,377 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:53:37,378 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-26 17:53:37,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:37,446 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-26 17:53:37,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:53:37,447 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:53:37,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:37,454 INFO ]: With dead ends: 8 [2018-06-26 17:53:37,454 INFO ]: Without dead ends: 7 [2018-06-26 17:53:37,456 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:53:37,470 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:53:37,482 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:53:37,483 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:53:37,484 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-06-26 17:53:37,485 INFO ]: Start accepts. Automaton has 7 states and 10 transitions. Word has length 5 [2018-06-26 17:53:37,485 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:37,485 INFO ]: Abstraction has 7 states and 10 transitions. [2018-06-26 17:53:37,485 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:53:37,485 INFO ]: Start isEmpty. Operand 7 states and 10 transitions. [2018-06-26 17:53:37,485 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:53:37,485 INFO ]: Found error trace [2018-06-26 17:53:37,485 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:53:37,486 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:37,487 INFO ]: Analyzing trace with hash 1020813213, now seen corresponding path program 1 times [2018-06-26 17:53:37,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:37,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:37,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:37,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:37,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:37,508 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:37,563 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:37,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:53:37,564 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:53:37,565 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:53:37,565 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:53:37,565 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:53:37,566 INFO ]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-06-26 17:53:37,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:37,667 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-26 17:53:37,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:53:37,667 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:53:37,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:37,671 INFO ]: With dead ends: 11 [2018-06-26 17:53:37,671 INFO ]: Without dead ends: 11 [2018-06-26 17:53:37,672 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:53:37,672 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:53:37,675 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 17:53:37,675 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:53:37,675 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-26 17:53:37,675 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-06-26 17:53:37,675 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:37,676 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-26 17:53:37,676 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:53:37,676 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-26 17:53:37,676 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:53:37,676 INFO ]: Found error trace [2018-06-26 17:53:37,676 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:37,676 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:37,676 INFO ]: Analyzing trace with hash 1579730382, now seen corresponding path program 1 times [2018-06-26 17:53:37,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:37,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:37,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:37,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:37,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:37,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:37,837 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:37,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:37,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:37,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:37,883 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:37,892 INFO ]: Computing forward predicates... [2018-06-26 17:53:38,111 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:38,131 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:53:38,131 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-26 17:53:38,131 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:53:38,132 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:53:38,132 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:53:38,132 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 8 states. [2018-06-26 17:53:38,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:38,345 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-26 17:53:38,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:53:38,345 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 17:53:38,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:38,346 INFO ]: With dead ends: 13 [2018-06-26 17:53:38,346 INFO ]: Without dead ends: 12 [2018-06-26 17:53:38,346 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:53:38,346 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:53:38,348 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 17:53:38,348 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:53:38,348 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-26 17:53:38,349 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-26 17:53:38,349 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:38,349 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-26 17:53:38,349 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:53:38,349 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-26 17:53:38,349 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:53:38,349 INFO ]: Found error trace [2018-06-26 17:53:38,349 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:38,349 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:38,350 INFO ]: Analyzing trace with hash 1579760173, now seen corresponding path program 1 times [2018-06-26 17:53:38,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:38,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:38,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:38,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:38,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:38,362 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:38,412 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:38,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:38,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:38,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:38,454 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:38,456 INFO ]: Computing forward predicates... [2018-06-26 17:53:38,516 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:38,537 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:53:38,537 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-26 17:53:38,537 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:53:38,537 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:53:38,537 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:53:38,537 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 5 states. [2018-06-26 17:53:38,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:38,629 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-26 17:53:38,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:53:38,630 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:53:38,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:38,630 INFO ]: With dead ends: 13 [2018-06-26 17:53:38,630 INFO ]: Without dead ends: 10 [2018-06-26 17:53:38,630 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:53:38,630 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:53:38,632 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:53:38,632 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:53:38,632 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-26 17:53:38,632 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-26 17:53:38,632 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:38,632 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-26 17:53:38,632 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:53:38,632 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-26 17:53:38,632 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:53:38,632 INFO ]: Found error trace [2018-06-26 17:53:38,632 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:38,633 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:38,633 INFO ]: Analyzing trace with hash 1580922022, now seen corresponding path program 1 times [2018-06-26 17:53:38,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:38,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:38,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:38,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:38,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:38,650 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:38,676 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:38,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:38,676 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:38,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:38,701 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:38,702 INFO ]: Computing forward predicates... [2018-06-26 17:53:38,710 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:38,742 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:53:38,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-26 17:53:38,742 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:53:38,742 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:53:38,742 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:53:38,742 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-26 17:53:38,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:38,762 INFO ]: Finished difference Result 9 states and 12 transitions. [2018-06-26 17:53:38,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:53:38,762 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:53:38,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:38,763 INFO ]: With dead ends: 9 [2018-06-26 17:53:38,763 INFO ]: Without dead ends: 8 [2018-06-26 17:53:38,763 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:53:38,763 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:53:38,764 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:53:38,764 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:53:38,764 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-26 17:53:38,764 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 7 [2018-06-26 17:53:38,764 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:38,764 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-26 17:53:38,764 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:53:38,764 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-26 17:53:38,764 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:53:38,764 INFO ]: Found error trace [2018-06-26 17:53:38,764 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:38,764 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:38,764 INFO ]: Analyzing trace with hash 1581845543, now seen corresponding path program 1 times [2018-06-26 17:53:38,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:38,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:38,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:38,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:38,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:38,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:38,891 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:38,891 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:53:38,891 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:53:38,892 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:53:38,892 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:53:38,892 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:53:38,892 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-06-26 17:53:39,015 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-26 17:53:39,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:39,087 INFO ]: Finished difference Result 9 states and 10 transitions. [2018-06-26 17:53:39,088 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:53:39,088 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:53:39,088 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:39,089 INFO ]: With dead ends: 9 [2018-06-26 17:53:39,089 INFO ]: Without dead ends: 9 [2018-06-26 17:53:39,089 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:53:39,089 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:53:39,090 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:53:39,090 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:53:39,090 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-26 17:53:39,090 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-06-26 17:53:39,090 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:39,090 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-26 17:53:39,090 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:53:39,090 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-26 17:53:39,091 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:53:39,091 INFO ]: Found error trace [2018-06-26 17:53:39,091 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:39,091 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:39,091 INFO ]: Analyzing trace with hash 1791863428, now seen corresponding path program 1 times [2018-06-26 17:53:39,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:39,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:39,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:39,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:39,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:39,120 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:39,269 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:39,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:39,269 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:39,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:39,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:39,310 INFO ]: Computing forward predicates... [2018-06-26 17:53:39,349 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:39,369 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:39,369 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:53:39,369 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:53:39,369 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:53:39,369 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:53:39,369 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-06-26 17:53:39,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:39,512 INFO ]: Finished difference Result 14 states and 17 transitions. [2018-06-26 17:53:39,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:53:39,513 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 17:53:39,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:39,513 INFO ]: With dead ends: 14 [2018-06-26 17:53:39,513 INFO ]: Without dead ends: 14 [2018-06-26 17:53:39,513 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:53:39,514 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:53:39,514 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-26 17:53:39,514 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:53:39,515 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-26 17:53:39,515 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-26 17:53:39,515 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:39,515 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-26 17:53:39,515 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:53:39,515 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-26 17:53:39,515 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:53:39,515 INFO ]: Found error trace [2018-06-26 17:53:39,515 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:39,515 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:39,515 INFO ]: Analyzing trace with hash -287516729, now seen corresponding path program 2 times [2018-06-26 17:53:39,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:39,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:39,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:39,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:39,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:39,527 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:39,647 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:39,647 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:39,647 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:39,653 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:53:39,690 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:53:39,690 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:39,692 INFO ]: Computing forward predicates... [2018-06-26 17:53:39,976 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:40,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-26 17:53:40,001 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:53:40,002 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:53:40,002 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:53:40,002 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-26 17:53:40,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:40,076 INFO ]: Finished difference Result 13 states and 15 transitions. [2018-06-26 17:53:40,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:53:40,077 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-26 17:53:40,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:40,077 INFO ]: With dead ends: 13 [2018-06-26 17:53:40,077 INFO ]: Without dead ends: 10 [2018-06-26 17:53:40,077 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:53:40,078 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:53:40,079 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:53:40,079 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:53:40,079 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-26 17:53:40,079 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2018-06-26 17:53:40,079 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:40,079 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-26 17:53:40,079 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:53:40,079 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-26 17:53:40,079 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:53:40,079 INFO ]: Found error trace [2018-06-26 17:53:40,079 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:40,079 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:40,080 INFO ]: Analyzing trace with hash -221946738, now seen corresponding path program 3 times [2018-06-26 17:53:40,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:40,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:40,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,080 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:40,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,092 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:40,154 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,154 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:40,154 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:40,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:53:40,188 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 17:53:40,188 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:40,190 INFO ]: Computing forward predicates... [2018-06-26 17:53:40,271 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:40,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-26 17:53:40,290 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:53:40,290 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:53:40,290 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:53:40,291 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 9 states. [2018-06-26 17:53:40,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:40,339 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-26 17:53:40,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:53:40,339 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-26 17:53:40,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:40,339 INFO ]: With dead ends: 11 [2018-06-26 17:53:40,339 INFO ]: Without dead ends: 11 [2018-06-26 17:53:40,340 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:53:40,340 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:53:40,341 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:53:40,341 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:53:40,341 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-26 17:53:40,341 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-06-26 17:53:40,341 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:40,341 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-26 17:53:40,341 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:53:40,341 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-26 17:53:40,342 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:53:40,342 INFO ]: Found error trace [2018-06-26 17:53:40,342 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:40,342 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:40,342 INFO ]: Analyzing trace with hash 1708877565, now seen corresponding path program 4 times [2018-06-26 17:53:40,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:40,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:40,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,343 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:40,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,373 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:40,463 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:40,464 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:40,476 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:53:40,492 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:53:40,492 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:40,494 INFO ]: Computing forward predicates... [2018-06-26 17:53:40,515 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:40,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 17:53:40,536 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:53:40,536 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:53:40,536 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:53:40,536 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2018-06-26 17:53:40,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:40,658 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-26 17:53:40,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:53:40,658 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 17:53:40,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:40,658 INFO ]: With dead ends: 17 [2018-06-26 17:53:40,658 INFO ]: Without dead ends: 17 [2018-06-26 17:53:40,659 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:53:40,659 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:53:40,660 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-26 17:53:40,660 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:53:40,661 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-26 17:53:40,661 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-06-26 17:53:40,661 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:40,661 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-26 17:53:40,661 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:53:40,661 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-26 17:53:40,661 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:53:40,661 INFO ]: Found error trace [2018-06-26 17:53:40,661 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:40,661 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:40,661 INFO ]: Analyzing trace with hash 1434888814, now seen corresponding path program 5 times [2018-06-26 17:53:40,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:40,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:40,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:40,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,683 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:40,746 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:40,747 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:40,754 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:53:40,805 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 17:53:40,805 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:40,807 INFO ]: Computing forward predicates... [2018-06-26 17:53:40,887 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:40,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:40,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-26 17:53:40,907 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:53:40,907 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:53:40,907 INFO ]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:53:40,907 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 14 states. [2018-06-26 17:53:40,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:40,965 INFO ]: Finished difference Result 16 states and 18 transitions. [2018-06-26 17:53:40,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:53:40,965 INFO ]: Start accepts. Automaton has 14 states. Word has length 11 [2018-06-26 17:53:40,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:40,965 INFO ]: With dead ends: 16 [2018-06-26 17:53:40,966 INFO ]: Without dead ends: 12 [2018-06-26 17:53:40,966 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:53:40,966 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:53:40,967 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:53:40,967 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:53:40,967 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-26 17:53:40,967 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2018-06-26 17:53:40,967 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:40,967 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-26 17:53:40,967 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:53:40,967 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-26 17:53:40,968 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:53:40,968 INFO ]: Found error trace [2018-06-26 17:53:40,968 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:40,968 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:40,968 INFO ]: Analyzing trace with hash -827408761, now seen corresponding path program 6 times [2018-06-26 17:53:40,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:40,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:40,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,969 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:40,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:40,978 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:41,301 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:41,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:41,301 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:41,308 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:53:41,349 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 17:53:41,349 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:41,351 INFO ]: Computing forward predicates... [2018-06-26 17:53:41,442 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:41,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:41,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-26 17:53:41,461 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:53:41,461 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:53:41,461 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:53:41,461 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2018-06-26 17:53:41,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:41,506 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-26 17:53:41,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:53:41,506 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-26 17:53:41,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:41,507 INFO ]: With dead ends: 13 [2018-06-26 17:53:41,507 INFO ]: Without dead ends: 13 [2018-06-26 17:53:41,507 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:53:41,507 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:53:41,508 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:53:41,508 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:53:41,509 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-26 17:53:41,509 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-26 17:53:41,509 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:41,509 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-26 17:53:41,509 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:53:41,509 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-26 17:53:41,509 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:53:41,509 INFO ]: Found error trace [2018-06-26 17:53:41,509 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:41,509 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:41,510 INFO ]: Analyzing trace with hash 119424036, now seen corresponding path program 7 times [2018-06-26 17:53:41,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:41,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:41,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:41,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:41,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:41,521 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:41,735 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:41,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:41,735 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) [2018-06-26 17:53:41,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:41,770 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:41,772 INFO ]: Computing forward predicates... [2018-06-26 17:53:41,797 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:41,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:41,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 17:53:41,823 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:53:41,823 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:53:41,823 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:53:41,824 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2018-06-26 17:53:41,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:41,952 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-26 17:53:41,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:53:41,952 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-26 17:53:41,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:41,952 INFO ]: With dead ends: 20 [2018-06-26 17:53:41,952 INFO ]: Without dead ends: 20 [2018-06-26 17:53:41,953 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:53:41,953 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:53:41,954 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-26 17:53:41,954 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:53:41,955 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-26 17:53:41,955 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-26 17:53:41,955 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:41,955 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-26 17:53:41,955 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:53:41,955 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-26 17:53:41,955 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:53:41,955 INFO ]: Found error trace [2018-06-26 17:53:41,955 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:41,955 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:41,956 INFO ]: Analyzing trace with hash -593530329, now seen corresponding path program 8 times [2018-06-26 17:53:41,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:41,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:41,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:41,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:41,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:41,967 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:42,075 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:42,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:42,075 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:42,087 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:53:42,141 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:53:42,141 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:42,143 INFO ]: Computing forward predicates... [2018-06-26 17:53:42,313 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:42,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:42,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-26 17:53:42,333 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:53:42,333 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:53:42,333 INFO ]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:53:42,333 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 17 states. [2018-06-26 17:53:42,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:42,457 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-26 17:53:42,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:53:42,457 INFO ]: Start accepts. Automaton has 17 states. Word has length 13 [2018-06-26 17:53:42,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:42,458 INFO ]: With dead ends: 19 [2018-06-26 17:53:42,458 INFO ]: Without dead ends: 14 [2018-06-26 17:53:42,458 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:53:42,458 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:53:42,459 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:53:42,459 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:53:42,460 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-26 17:53:42,460 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2018-06-26 17:53:42,460 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:42,460 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-26 17:53:42,460 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:53:42,460 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-26 17:53:42,460 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:53:42,460 INFO ]: Found error trace [2018-06-26 17:53:42,460 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:42,460 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:42,460 INFO ]: Analyzing trace with hash -2005278418, now seen corresponding path program 9 times [2018-06-26 17:53:42,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:42,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:42,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:42,461 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:42,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:42,470 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:42,584 INFO ]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:42,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:42,584 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:42,590 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:53:42,643 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:53:42,643 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:42,645 INFO ]: Computing forward predicates... [2018-06-26 17:53:42,806 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:42,826 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:42,826 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-06-26 17:53:42,826 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:53:42,826 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:53:42,826 INFO ]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:53:42,826 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-26 17:53:42,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:42,975 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-26 17:53:42,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:53:42,976 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-26 17:53:42,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:42,976 INFO ]: With dead ends: 15 [2018-06-26 17:53:42,976 INFO ]: Without dead ends: 15 [2018-06-26 17:53:42,976 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:53:42,977 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:53:42,978 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:53:42,978 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:53:42,978 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-26 17:53:42,978 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-26 17:53:42,978 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:42,978 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-26 17:53:42,978 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:53:42,978 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-26 17:53:42,979 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:53:42,979 INFO ]: Found error trace [2018-06-26 17:53:42,979 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:42,979 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:42,979 INFO ]: Analyzing trace with hash -2034796963, now seen corresponding path program 10 times [2018-06-26 17:53:42,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:42,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:42,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:42,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:42,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:42,994 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:43,126 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:43,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:43,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:43,131 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:53:43,157 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:53:43,157 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:43,160 INFO ]: Computing forward predicates... [2018-06-26 17:53:43,183 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:43,215 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:43,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 17:53:43,215 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:53:43,215 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:53:43,215 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:53:43,215 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-26 17:53:43,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:43,414 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-26 17:53:43,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:53:43,438 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 17:53:43,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:43,439 INFO ]: With dead ends: 23 [2018-06-26 17:53:43,439 INFO ]: Without dead ends: 23 [2018-06-26 17:53:43,439 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:53:43,439 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:53:43,441 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-26 17:53:43,441 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:53:43,441 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-26 17:53:43,441 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-06-26 17:53:43,441 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:43,441 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-26 17:53:43,441 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:53:43,442 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-26 17:53:43,442 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:53:43,442 INFO ]: Found error trace [2018-06-26 17:53:43,442 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:43,442 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:43,442 INFO ]: Analyzing trace with hash 1345095438, now seen corresponding path program 11 times [2018-06-26 17:53:43,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:43,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:43,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:43,443 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:43,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:43,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:43,567 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:43,568 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:43,568 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:43,575 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:53:43,614 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:53:43,614 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:43,617 INFO ]: Computing forward predicates... [2018-06-26 17:53:44,128 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:44,149 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:44,149 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-26 17:53:44,150 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:53:44,150 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:53:44,150 INFO ]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:53:44,150 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 20 states. [2018-06-26 17:53:44,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:44,361 INFO ]: Finished difference Result 22 states and 24 transitions. [2018-06-26 17:53:44,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:53:44,362 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-26 17:53:44,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:44,362 INFO ]: With dead ends: 22 [2018-06-26 17:53:44,362 INFO ]: Without dead ends: 16 [2018-06-26 17:53:44,362 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:53:44,362 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:53:44,363 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:53:44,363 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:53:44,364 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-26 17:53:44,364 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2018-06-26 17:53:44,364 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:44,364 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-26 17:53:44,364 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:53:44,364 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-26 17:53:44,364 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:53:44,364 INFO ]: Found error trace [2018-06-26 17:53:44,364 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:44,364 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:44,364 INFO ]: Analyzing trace with hash 530577639, now seen corresponding path program 12 times [2018-06-26 17:53:44,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:44,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:44,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:44,365 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:44,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:44,374 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:45,240 INFO ]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:45,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:45,240 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:45,246 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:53:45,270 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:53:45,270 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:45,272 INFO ]: Computing forward predicates... [2018-06-26 17:53:45,362 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:45,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:45,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2018-06-26 17:53:45,381 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:53:45,381 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:53:45,381 INFO ]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:53:45,381 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2018-06-26 17:53:45,481 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:45,481 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-26 17:53:45,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:53:45,481 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-26 17:53:45,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:45,481 INFO ]: With dead ends: 17 [2018-06-26 17:53:45,481 INFO ]: Without dead ends: 17 [2018-06-26 17:53:45,482 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:53:45,482 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:53:45,483 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:53:45,483 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:53:45,483 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-26 17:53:45,483 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-26 17:53:45,483 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:45,483 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-26 17:53:45,483 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:53:45,483 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-26 17:53:45,484 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:53:45,484 INFO ]: Found error trace [2018-06-26 17:53:45,484 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:45,484 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:45,484 INFO ]: Analyzing trace with hash -732670524, now seen corresponding path program 13 times [2018-06-26 17:53:45,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:45,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:45,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:45,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:45,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:45,496 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:45,731 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:45,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:45,731 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:45,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:45,761 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:45,764 INFO ]: Computing forward predicates... [2018-06-26 17:53:45,855 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:45,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:45,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 17:53:45,875 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:53:45,875 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:53:45,875 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:53:45,875 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-06-26 17:53:46,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:46,283 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-26 17:53:46,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:53:46,283 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-26 17:53:46,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:46,284 INFO ]: With dead ends: 26 [2018-06-26 17:53:46,284 INFO ]: Without dead ends: 26 [2018-06-26 17:53:46,284 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:53:46,284 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:53:46,286 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-06-26 17:53:46,286 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:53:46,286 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-26 17:53:46,286 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-06-26 17:53:46,286 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:46,286 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-26 17:53:46,286 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:53:46,286 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-26 17:53:46,287 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:53:46,287 INFO ]: Found error trace [2018-06-26 17:53:46,287 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:46,287 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:46,287 INFO ]: Analyzing trace with hash -1238657913, now seen corresponding path program 14 times [2018-06-26 17:53:46,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:46,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:46,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:46,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:46,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:46,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:46,541 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:46,541 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:46,541 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:46,547 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:53:46,579 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:53:46,579 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:46,582 INFO ]: Computing forward predicates... [2018-06-26 17:53:46,717 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:46,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:46,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-26 17:53:46,737 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:53:46,737 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:53:46,737 INFO ]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:53:46,737 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 23 states. [2018-06-26 17:53:46,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:46,870 INFO ]: Finished difference Result 25 states and 27 transitions. [2018-06-26 17:53:46,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:53:46,870 INFO ]: Start accepts. Automaton has 23 states. Word has length 17 [2018-06-26 17:53:46,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:46,871 INFO ]: With dead ends: 25 [2018-06-26 17:53:46,871 INFO ]: Without dead ends: 18 [2018-06-26 17:53:46,871 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:53:46,871 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:53:46,872 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:53:46,872 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:53:46,873 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-26 17:53:46,873 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2018-06-26 17:53:46,873 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:46,873 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-26 17:53:46,873 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:53:46,873 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-26 17:53:46,873 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:53:46,873 INFO ]: Found error trace [2018-06-26 17:53:46,873 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:46,873 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:46,874 INFO ]: Analyzing trace with hash -718905906, now seen corresponding path program 15 times [2018-06-26 17:53:46,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:46,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:46,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:46,874 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:46,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:46,884 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:47,049 INFO ]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:47,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:47,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:47,055 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:53:47,086 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:53:47,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:47,088 INFO ]: Computing forward predicates... [2018-06-26 17:53:47,180 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:47,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:47,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-06-26 17:53:47,199 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:53:47,199 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:53:47,199 INFO ]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:53:47,199 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 22 states. [2018-06-26 17:53:47,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:47,294 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-26 17:53:47,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:53:47,296 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-26 17:53:47,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:47,296 INFO ]: With dead ends: 19 [2018-06-26 17:53:47,296 INFO ]: Without dead ends: 19 [2018-06-26 17:53:47,296 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:53:47,297 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:53:47,298 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:53:47,298 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:53:47,298 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-26 17:53:47,298 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-26 17:53:47,298 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:47,298 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-26 17:53:47,298 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:53:47,298 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-26 17:53:47,299 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:53:47,299 INFO ]: Found error trace [2018-06-26 17:53:47,299 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:47,299 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:47,299 INFO ]: Analyzing trace with hash -811954755, now seen corresponding path program 16 times [2018-06-26 17:53:47,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:47,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:47,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:47,299 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:47,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:47,311 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:47,475 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:47,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:47,475 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:47,483 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:53:47,513 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:53:47,513 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:47,516 INFO ]: Computing forward predicates... [2018-06-26 17:53:47,573 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:47,592 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:47,592 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 17:53:47,592 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:53:47,592 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:53:47,592 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:53:47,592 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-06-26 17:53:47,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:47,914 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-26 17:53:47,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:53:47,914 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-26 17:53:47,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:47,914 INFO ]: With dead ends: 29 [2018-06-26 17:53:47,914 INFO ]: Without dead ends: 29 [2018-06-26 17:53:47,915 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:53:47,915 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:53:47,916 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-26 17:53:47,916 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:53:47,916 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-26 17:53:47,916 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-26 17:53:47,916 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:47,917 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-26 17:53:47,917 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:53:47,917 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-26 17:53:47,917 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:53:47,917 INFO ]: Found error trace [2018-06-26 17:53:47,917 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:47,917 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:47,917 INFO ]: Analyzing trace with hash 598498222, now seen corresponding path program 17 times [2018-06-26 17:53:47,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:47,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:47,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:47,918 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:47,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:47,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:48,635 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:48,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:48,635 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) [2018-06-26 17:53:48,648 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:48,698 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 17:53:48,698 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:48,700 INFO ]: Computing forward predicates... [2018-06-26 17:53:48,835 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:48,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:48,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-26 17:53:48,868 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:53:48,868 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:53:48,868 INFO ]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:53:48,868 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 26 states. [2018-06-26 17:53:49,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:49,013 INFO ]: Finished difference Result 28 states and 30 transitions. [2018-06-26 17:53:49,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:53:49,014 INFO ]: Start accepts. Automaton has 26 states. Word has length 19 [2018-06-26 17:53:49,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:49,014 INFO ]: With dead ends: 28 [2018-06-26 17:53:49,014 INFO ]: Without dead ends: 20 [2018-06-26 17:53:49,014 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:53:49,014 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:53:49,016 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:53:49,016 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:53:49,016 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-26 17:53:49,016 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-06-26 17:53:49,016 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:49,016 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-26 17:53:49,016 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:53:49,016 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-26 17:53:49,016 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:53:49,016 INFO ]: Found error trace [2018-06-26 17:53:49,016 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:49,016 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:49,017 INFO ]: Analyzing trace with hash -469058745, now seen corresponding path program 18 times [2018-06-26 17:53:49,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:49,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:49,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:49,017 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:49,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:49,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:49,303 INFO ]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:49,303 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:49,303 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:49,309 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:53:49,342 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 17:53:49,342 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:49,345 INFO ]: Computing forward predicates... [2018-06-26 17:53:49,606 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:49,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:49,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2018-06-26 17:53:49,627 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:53:49,627 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:53:49,627 INFO ]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:53:49,627 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 25 states. [2018-06-26 17:53:49,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:49,730 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-26 17:53:49,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:53:49,730 INFO ]: Start accepts. Automaton has 25 states. Word has length 19 [2018-06-26 17:53:49,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:49,730 INFO ]: With dead ends: 21 [2018-06-26 17:53:49,730 INFO ]: Without dead ends: 21 [2018-06-26 17:53:49,731 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=692, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:53:49,731 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:53:49,732 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:53:49,732 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:53:49,732 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-26 17:53:49,732 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-26 17:53:49,732 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:49,732 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-26 17:53:49,732 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:53:49,732 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-26 17:53:49,733 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:53:49,733 INFO ]: Found error trace [2018-06-26 17:53:49,733 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:49,733 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:49,733 INFO ]: Analyzing trace with hash -1656627356, now seen corresponding path program 19 times [2018-06-26 17:53:49,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:49,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:49,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:49,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:49,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:49,751 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:50,052 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:50,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:50,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:50,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:50,090 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:50,094 INFO ]: Computing forward predicates... [2018-06-26 17:53:50,149 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:50,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:50,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 17:53:50,169 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:53:50,169 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:53:50,169 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:53:50,169 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2018-06-26 17:53:50,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:50,487 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-26 17:53:50,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:53:50,487 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-26 17:53:50,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:50,487 INFO ]: With dead ends: 32 [2018-06-26 17:53:50,487 INFO ]: Without dead ends: 32 [2018-06-26 17:53:50,487 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:53:50,487 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:53:50,489 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-06-26 17:53:50,489 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:53:50,489 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-26 17:53:50,490 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-26 17:53:50,490 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:50,490 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-26 17:53:50,490 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:53:50,490 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-26 17:53:50,490 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:53:50,490 INFO ]: Found error trace [2018-06-26 17:53:50,490 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:50,490 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:50,490 INFO ]: Analyzing trace with hash 183451367, now seen corresponding path program 20 times [2018-06-26 17:53:50,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:50,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:50,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:50,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:50,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:50,502 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:50,830 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:50,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:50,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:50,836 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:53:50,867 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:53:50,867 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:50,871 INFO ]: Computing forward predicates... [2018-06-26 17:53:51,184 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:51,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:51,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-06-26 17:53:51,204 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:53:51,204 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:53:51,204 INFO ]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:53:51,204 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 29 states. [2018-06-26 17:53:51,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:51,466 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-26 17:53:51,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:53:51,466 INFO ]: Start accepts. Automaton has 29 states. Word has length 21 [2018-06-26 17:53:51,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:51,466 INFO ]: With dead ends: 31 [2018-06-26 17:53:51,466 INFO ]: Without dead ends: 22 [2018-06-26 17:53:51,467 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:53:51,467 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:53:51,468 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:53:51,468 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:53:51,468 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-26 17:53:51,468 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-06-26 17:53:51,468 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:51,468 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-26 17:53:51,468 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:53:51,468 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-26 17:53:51,469 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:53:51,469 INFO ]: Found error trace [2018-06-26 17:53:51,469 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:51,469 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:51,469 INFO ]: Analyzing trace with hash 1448923758, now seen corresponding path program 21 times [2018-06-26 17:53:51,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:51,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:51,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:51,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:51,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:51,482 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:51,880 INFO ]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:51,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:51,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:51,892 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:53:51,932 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:53:51,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:51,935 INFO ]: Computing forward predicates... [2018-06-26 17:53:52,067 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:52,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:52,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-06-26 17:53:52,086 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:53:52,086 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:53:52,086 INFO ]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:53:52,086 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 28 states. [2018-06-26 17:53:52,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:52,533 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-26 17:53:52,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:53:52,533 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-26 17:53:52,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:52,533 INFO ]: With dead ends: 23 [2018-06-26 17:53:52,533 INFO ]: Without dead ends: 23 [2018-06-26 17:53:52,534 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:53:52,534 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:53:52,535 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:53:52,535 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:53:52,535 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-26 17:53:52,535 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-06-26 17:53:52,535 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:52,535 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-26 17:53:52,535 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:53:52,535 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-26 17:53:52,536 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:53:52,536 INFO ]: Found error trace [2018-06-26 17:53:52,536 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:52,536 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:52,536 INFO ]: Analyzing trace with hash 1966255389, now seen corresponding path program 22 times [2018-06-26 17:53:52,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:52,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:52,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:52,537 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:52,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:52,555 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:52,916 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:52,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:52,916 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:52,922 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:53:52,955 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:53:52,955 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:52,958 INFO ]: Computing forward predicates... [2018-06-26 17:53:53,068 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:53,086 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:53,086 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-26 17:53:53,086 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:53:53,086 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:53:53,086 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:53:53,087 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2018-06-26 17:53:53,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:53,442 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-26 17:53:53,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:53:53,442 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-26 17:53:53,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:53,442 INFO ]: With dead ends: 35 [2018-06-26 17:53:53,442 INFO ]: Without dead ends: 35 [2018-06-26 17:53:53,443 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:53:53,443 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:53:53,444 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-06-26 17:53:53,444 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:53:53,444 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-26 17:53:53,444 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-06-26 17:53:53,444 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:53,444 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-26 17:53:53,444 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:53:53,444 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-26 17:53:53,445 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:53:53,445 INFO ]: Found error trace [2018-06-26 17:53:53,445 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:53,445 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:53,445 INFO ]: Analyzing trace with hash 823666766, now seen corresponding path program 23 times [2018-06-26 17:53:53,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:53,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:53,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:53,446 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:53,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:53,457 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:53,898 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:53,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:53,898 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:53,904 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:53:53,949 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 17:53:53,949 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:53,951 INFO ]: Computing forward predicates... [2018-06-26 17:53:54,164 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:54,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:54,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-06-26 17:53:54,184 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:53:54,184 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:53:54,185 INFO ]: CoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:53:54,185 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 32 states. [2018-06-26 17:53:54,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:54,362 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-26 17:53:54,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:53:54,366 INFO ]: Start accepts. Automaton has 32 states. Word has length 23 [2018-06-26 17:53:54,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:54,366 INFO ]: With dead ends: 34 [2018-06-26 17:53:54,366 INFO ]: Without dead ends: 24 [2018-06-26 17:53:54,367 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1285, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 17:53:54,367 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:53:54,368 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:53:54,368 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:53:54,368 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-26 17:53:54,368 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2018-06-26 17:53:54,369 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:54,369 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-26 17:53:54,369 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:53:54,369 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-26 17:53:54,369 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:53:54,369 INFO ]: Found error trace [2018-06-26 17:53:54,369 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:54,369 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:54,369 INFO ]: Analyzing trace with hash 1398605223, now seen corresponding path program 24 times [2018-06-26 17:53:54,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:54,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:54,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:54,370 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:54,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:54,380 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:54,904 INFO ]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:54,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:54,904 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:54,912 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:53:54,958 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 17:53:54,958 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:54,961 INFO ]: Computing forward predicates... [2018-06-26 17:53:56,070 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:56,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:56,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2018-06-26 17:53:56,090 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:53:56,090 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:53:56,090 INFO ]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:53:56,090 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 31 states. [2018-06-26 17:53:56,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:56,338 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-26 17:53:56,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:53:56,339 INFO ]: Start accepts. Automaton has 31 states. Word has length 23 [2018-06-26 17:53:56,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:56,339 INFO ]: With dead ends: 25 [2018-06-26 17:53:56,339 INFO ]: Without dead ends: 25 [2018-06-26 17:53:56,340 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=465, Invalid=1095, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:53:56,340 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:53:56,340 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:53:56,340 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:53:56,341 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-26 17:53:56,341 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-26 17:53:56,341 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:56,341 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-26 17:53:56,341 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:53:56,341 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-26 17:53:56,341 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:53:56,341 INFO ]: Found error trace [2018-06-26 17:53:56,341 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:56,341 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:56,341 INFO ]: Analyzing trace with hash 406380804, now seen corresponding path program 25 times [2018-06-26 17:53:56,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:56,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:56,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:56,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:56,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:56,354 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:56,981 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:56,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:56,981 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:56,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:57,032 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:57,035 INFO ]: Computing forward predicates... [2018-06-26 17:53:57,286 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:57,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:57,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-26 17:53:57,306 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:53:57,306 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:53:57,306 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:53:57,306 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 22 states. [2018-06-26 17:53:57,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:57,795 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-26 17:53:57,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:53:57,795 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-26 17:53:57,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:57,795 INFO ]: With dead ends: 38 [2018-06-26 17:53:57,795 INFO ]: Without dead ends: 38 [2018-06-26 17:53:57,796 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:53:57,796 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:53:57,797 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-06-26 17:53:57,797 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:53:57,798 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-26 17:53:57,798 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-06-26 17:53:57,798 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:57,798 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-26 17:53:57,798 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:53:57,798 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-26 17:53:57,798 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:53:57,798 INFO ]: Found error trace [2018-06-26 17:53:57,798 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:57,803 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:57,803 INFO ]: Analyzing trace with hash -287805113, now seen corresponding path program 26 times [2018-06-26 17:53:57,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:57,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:57,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:57,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:53:57,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:57,814 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:58,047 INFO ]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:58,047 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:58,047 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:58,052 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:53:58,097 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:53:58,097 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:58,101 INFO ]: Computing forward predicates... [2018-06-26 17:53:58,693 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:58,723 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:53:58,723 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-26 17:53:58,724 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:53:58,724 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:53:58,724 INFO ]: CoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:53:58,724 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 35 states. [2018-06-26 17:53:59,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:53:59,009 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-26 17:53:59,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:53:59,011 INFO ]: Start accepts. Automaton has 35 states. Word has length 25 [2018-06-26 17:53:59,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:53:59,011 INFO ]: With dead ends: 37 [2018-06-26 17:53:59,011 INFO ]: Without dead ends: 26 [2018-06-26 17:53:59,011 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=519, Invalid=1551, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:53:59,012 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:53:59,013 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:53:59,013 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:53:59,013 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-26 17:53:59,013 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2018-06-26 17:53:59,014 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:53:59,014 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-26 17:53:59,014 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:53:59,014 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-26 17:53:59,014 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:53:59,014 INFO ]: Found error trace [2018-06-26 17:53:59,014 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:53:59,014 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:53:59,014 INFO ]: Analyzing trace with hash 355417870, now seen corresponding path program 27 times [2018-06-26 17:53:59,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:53:59,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:53:59,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:59,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:53:59,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:53:59,025 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:59,645 INFO ]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:53:59,645 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:53:59,645 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:53:59,650 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:53:59,692 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:53:59,692 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:53:59,695 INFO ]: Computing forward predicates... [2018-06-26 17:54:00,356 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:00,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:00,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 34 [2018-06-26 17:54:00,375 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:54:00,375 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:54:00,375 INFO ]: CoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:54:00,375 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 34 states. [2018-06-26 17:54:00,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:00,562 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-26 17:54:00,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:54:00,562 INFO ]: Start accepts. Automaton has 34 states. Word has length 25 [2018-06-26 17:54:00,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:00,562 INFO ]: With dead ends: 27 [2018-06-26 17:54:00,562 INFO ]: Without dead ends: 27 [2018-06-26 17:54:00,563 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=561, Invalid=1331, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:54:00,563 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:54:00,564 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:54:00,564 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:54:00,564 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-26 17:54:00,564 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-26 17:54:00,564 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:00,564 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-26 17:54:00,564 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:54:00,564 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-26 17:54:00,565 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:54:00,565 INFO ]: Found error trace [2018-06-26 17:54:00,565 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:00,565 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:00,566 INFO ]: Analyzing trace with hash -1867656067, now seen corresponding path program 28 times [2018-06-26 17:54:00,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:00,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:00,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:00,566 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:00,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:00,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:01,572 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:01,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:01,572 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:01,578 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:01,617 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:01,617 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:01,621 INFO ]: Computing forward predicates... [2018-06-26 17:54:01,698 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:01,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:01,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-26 17:54:01,717 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:54:01,717 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:54:01,717 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:54:01,717 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2018-06-26 17:54:02,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:02,261 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-26 17:54:02,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:54:02,261 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-26 17:54:02,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:02,262 INFO ]: With dead ends: 41 [2018-06-26 17:54:02,262 INFO ]: Without dead ends: 41 [2018-06-26 17:54:02,262 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:54:02,262 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:54:02,263 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-06-26 17:54:02,263 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:54:02,264 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:54:02,264 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-06-26 17:54:02,264 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:02,265 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:54:02,265 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:54:02,265 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:54:02,265 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:54:02,265 INFO ]: Found error trace [2018-06-26 17:54:02,265 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:02,265 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:02,265 INFO ]: Analyzing trace with hash -2063471378, now seen corresponding path program 29 times [2018-06-26 17:54:02,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:02,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:02,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:02,265 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:02,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:02,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:02,596 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:02,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:02,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:02,601 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:02,645 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:54:02,645 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:02,648 INFO ]: Computing forward predicates... [2018-06-26 17:54:02,939 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:02,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:02,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-26 17:54:02,958 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:54:02,958 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:54:02,958 INFO ]: CoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:54:02,958 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 38 states. [2018-06-26 17:54:03,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:03,194 INFO ]: Finished difference Result 40 states and 42 transitions. [2018-06-26 17:54:03,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:54:03,195 INFO ]: Start accepts. Automaton has 38 states. Word has length 27 [2018-06-26 17:54:03,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:03,195 INFO ]: With dead ends: 40 [2018-06-26 17:54:03,195 INFO ]: Without dead ends: 28 [2018-06-26 17:54:03,196 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=608, Invalid=1842, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 17:54:03,196 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:54:03,196 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:54:03,196 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:54:03,197 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-26 17:54:03,197 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 27 [2018-06-26 17:54:03,197 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:03,197 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-26 17:54:03,197 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:54:03,197 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-26 17:54:03,197 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:54:03,197 INFO ]: Found error trace [2018-06-26 17:54:03,197 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:03,197 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:03,197 INFO ]: Analyzing trace with hash 696571911, now seen corresponding path program 30 times [2018-06-26 17:54:03,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:03,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:03,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:03,198 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:03,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:03,212 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:03,578 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:03,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:03,578 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:03,590 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:03,637 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:54:03,637 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:03,640 INFO ]: Computing forward predicates... [2018-06-26 17:54:03,850 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:03,869 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:03,869 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 37 [2018-06-26 17:54:03,869 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:54:03,869 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:54:03,869 INFO ]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:54:03,869 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 37 states. [2018-06-26 17:54:04,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:04,063 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-26 17:54:04,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:54:04,063 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-26 17:54:04,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:04,063 INFO ]: With dead ends: 29 [2018-06-26 17:54:04,063 INFO ]: Without dead ends: 29 [2018-06-26 17:54:04,064 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=1590, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 17:54:04,064 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:54:04,065 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:54:04,065 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:54:04,065 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-26 17:54:04,065 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-26 17:54:04,065 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:04,065 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-26 17:54:04,065 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:54:04,065 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-26 17:54:04,065 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:54:04,065 INFO ]: Found error trace [2018-06-26 17:54:04,066 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:04,066 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:04,066 INFO ]: Analyzing trace with hash 118184612, now seen corresponding path program 31 times [2018-06-26 17:54:04,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:04,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:04,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:04,066 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:04,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:04,080 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:04,638 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:04,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:04,638 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:04,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:04,686 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:04,689 INFO ]: Computing forward predicates... [2018-06-26 17:54:04,754 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:04,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:04,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-26 17:54:04,773 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:54:04,774 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:54:04,774 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:54:04,774 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 26 states. [2018-06-26 17:54:05,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:05,306 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-26 17:54:05,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:54:05,306 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-26 17:54:05,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:05,306 INFO ]: With dead ends: 44 [2018-06-26 17:54:05,306 INFO ]: Without dead ends: 44 [2018-06-26 17:54:05,307 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:54:05,307 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 17:54:05,308 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-26 17:54:05,308 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:54:05,308 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-26 17:54:05,308 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-06-26 17:54:05,308 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:05,309 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-26 17:54:05,309 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:54:05,309 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-26 17:54:05,309 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:54:05,309 INFO ]: Found error trace [2018-06-26 17:54:05,309 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:05,309 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:05,309 INFO ]: Analyzing trace with hash -631952473, now seen corresponding path program 32 times [2018-06-26 17:54:05,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:05,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:05,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:05,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:05,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:05,324 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:05,787 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:05,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:05,787 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:05,792 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:05,836 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:05,836 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:05,840 INFO ]: Computing forward predicates... [2018-06-26 17:54:06,328 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:06,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:06,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-26 17:54:06,347 INFO ]: Interpolant automaton has 41 states [2018-06-26 17:54:06,347 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 17:54:06,347 INFO ]: CoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:54:06,348 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 41 states. [2018-06-26 17:54:06,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:06,613 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-26 17:54:06,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:54:06,613 INFO ]: Start accepts. Automaton has 41 states. Word has length 29 [2018-06-26 17:54:06,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:06,613 INFO ]: With dead ends: 43 [2018-06-26 17:54:06,613 INFO ]: Without dead ends: 30 [2018-06-26 17:54:06,614 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=704, Invalid=2158, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 17:54:06,614 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:54:06,615 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:54:06,615 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:54:06,615 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-26 17:54:06,615 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 29 [2018-06-26 17:54:06,615 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:06,615 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-26 17:54:06,615 INFO ]: Interpolant automaton has 41 states. [2018-06-26 17:54:06,615 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-26 17:54:06,616 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:54:06,616 INFO ]: Found error trace [2018-06-26 17:54:06,616 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:06,617 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:06,617 INFO ]: Analyzing trace with hash -969956434, now seen corresponding path program 33 times [2018-06-26 17:54:06,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:06,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:06,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:06,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:06,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:06,628 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:07,102 INFO ]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:07,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:07,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:07,116 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:07,165 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:54:07,165 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:07,168 INFO ]: Computing forward predicates... [2018-06-26 17:54:07,443 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:07,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:07,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 40 [2018-06-26 17:54:07,463 INFO ]: Interpolant automaton has 40 states [2018-06-26 17:54:07,463 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 17:54:07,463 INFO ]: CoverageRelationStatistics Valid=366, Invalid=1194, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:54:07,463 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 40 states. [2018-06-26 17:54:07,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:07,956 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-26 17:54:07,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:54:07,956 INFO ]: Start accepts. Automaton has 40 states. Word has length 29 [2018-06-26 17:54:07,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:07,956 INFO ]: With dead ends: 31 [2018-06-26 17:54:07,956 INFO ]: Without dead ends: 31 [2018-06-26 17:54:07,956 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1872, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 17:54:07,957 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:54:07,957 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:54:07,957 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:54:07,957 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-26 17:54:07,957 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-26 17:54:07,957 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:07,957 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-26 17:54:07,957 INFO ]: Interpolant automaton has 40 states. [2018-06-26 17:54:07,957 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-26 17:54:07,958 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:54:07,958 INFO ]: Found error trace [2018-06-26 17:54:07,958 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:07,958 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:07,958 INFO ]: Analyzing trace with hash -4586531, now seen corresponding path program 34 times [2018-06-26 17:54:07,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:07,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:07,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:07,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:07,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:07,967 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:08,379 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:08,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:08,379 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:08,385 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:08,432 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:08,432 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:08,436 INFO ]: Computing forward predicates... [2018-06-26 17:54:08,514 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:08,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:08,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-26 17:54:08,533 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:54:08,533 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:54:08,533 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:54:08,533 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 28 states. [2018-06-26 17:54:09,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:09,215 INFO ]: Finished difference Result 47 states and 50 transitions. [2018-06-26 17:54:09,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:54:09,215 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-26 17:54:09,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:09,216 INFO ]: With dead ends: 47 [2018-06-26 17:54:09,216 INFO ]: Without dead ends: 47 [2018-06-26 17:54:09,216 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:09,216 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 17:54:09,217 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-06-26 17:54:09,217 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:54:09,218 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-26 17:54:09,218 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-06-26 17:54:09,218 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:09,218 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-26 17:54:09,218 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:54:09,218 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-26 17:54:09,218 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:54:09,218 INFO ]: Found error trace [2018-06-26 17:54:09,218 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:09,218 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:09,218 INFO ]: Analyzing trace with hash -142890610, now seen corresponding path program 35 times [2018-06-26 17:54:09,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:09,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:09,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:09,219 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:09,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:09,229 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:09,534 INFO ]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:09,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:09,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:09,540 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:09,594 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-26 17:54:09,594 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:09,597 INFO ]: Computing forward predicates... [2018-06-26 17:54:09,968 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:09,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:09,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 44 [2018-06-26 17:54:09,987 INFO ]: Interpolant automaton has 44 states [2018-06-26 17:54:09,987 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-26 17:54:09,987 INFO ]: CoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:54:09,987 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 44 states. [2018-06-26 17:54:10,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:10,262 INFO ]: Finished difference Result 46 states and 48 transitions. [2018-06-26 17:54:10,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:54:10,262 INFO ]: Start accepts. Automaton has 44 states. Word has length 31 [2018-06-26 17:54:10,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:10,263 INFO ]: With dead ends: 46 [2018-06-26 17:54:10,263 INFO ]: Without dead ends: 32 [2018-06-26 17:54:10,263 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=807, Invalid=2499, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 17:54:10,263 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:54:10,264 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:54:10,264 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:54:10,264 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-26 17:54:10,264 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 31 [2018-06-26 17:54:10,264 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:10,264 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-26 17:54:10,264 INFO ]: Interpolant automaton has 44 states. [2018-06-26 17:54:10,264 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-26 17:54:10,265 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:54:10,265 INFO ]: Found error trace [2018-06-26 17:54:10,265 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:10,265 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:10,265 INFO ]: Analyzing trace with hash -2031078809, now seen corresponding path program 36 times [2018-06-26 17:54:10,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:10,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:10,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,265 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:10,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:10,632 INFO ]: Checked inductivity of 169 backedges. 79 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:10,632 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:10,632 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:10,637 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:10,694 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 17:54:10,694 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:10,697 INFO ]: Computing forward predicates... [2018-06-26 17:54:10,981 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:10,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:11,000 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 43 [2018-06-26 17:54:11,000 INFO ]: Interpolant automaton has 43 states [2018-06-26 17:54:11,000 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 17:54:11,000 INFO ]: CoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:11,000 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 43 states. [2018-06-26 17:54:11,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:11,272 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-26 17:54:11,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:54:11,272 INFO ]: Start accepts. Automaton has 43 states. Word has length 31 [2018-06-26 17:54:11,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:11,273 INFO ]: With dead ends: 33 [2018-06-26 17:54:11,273 INFO ]: Without dead ends: 33 [2018-06-26 17:54:11,273 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=2177, Unknown=0, NotChecked=0, Total=3080 [2018-06-26 17:54:11,273 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:54:11,273 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:54:11,274 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:54:11,274 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-26 17:54:11,274 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-26 17:54:11,274 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:11,274 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-26 17:54:11,274 INFO ]: Interpolant automaton has 43 states. [2018-06-26 17:54:11,274 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-26 17:54:11,274 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:54:11,274 INFO ]: Found error trace [2018-06-26 17:54:11,274 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:11,274 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:11,274 INFO ]: Analyzing trace with hash 1460358212, now seen corresponding path program 37 times [2018-06-26 17:54:11,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:11,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:11,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,275 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:11,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:11,878 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:11,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:11,878 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:11,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:11,933 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:11,937 INFO ]: Computing forward predicates... [2018-06-26 17:54:12,030 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:12,049 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:12,049 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-26 17:54:12,049 INFO ]: Interpolant automaton has 30 states [2018-06-26 17:54:12,049 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 17:54:12,049 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:54:12,049 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 30 states. [2018-06-26 17:54:12,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:12,767 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-26 17:54:12,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:54:12,767 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-26 17:54:12,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:12,767 INFO ]: With dead ends: 50 [2018-06-26 17:54:12,767 INFO ]: Without dead ends: 50 [2018-06-26 17:54:12,767 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=1912, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:54:12,767 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-26 17:54:12,769 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-06-26 17:54:12,769 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:54:12,769 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-26 17:54:12,769 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-06-26 17:54:12,769 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:12,769 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-26 17:54:12,769 INFO ]: Interpolant automaton has 30 states. [2018-06-26 17:54:12,769 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-26 17:54:12,769 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:54:12,769 INFO ]: Found error trace [2018-06-26 17:54:12,769 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:12,769 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:12,770 INFO ]: Analyzing trace with hash -1974243833, now seen corresponding path program 38 times [2018-06-26 17:54:12,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:12,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:12,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:12,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:12,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:12,781 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:13,622 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:13,622 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:13,622 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:13,628 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:13,689 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:13,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:13,695 INFO ]: Computing forward predicates... [2018-06-26 17:54:14,080 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:14,099 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:14,105 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 47 [2018-06-26 17:54:14,105 INFO ]: Interpolant automaton has 47 states [2018-06-26 17:54:14,105 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-26 17:54:14,105 INFO ]: CoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:54:14,105 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 47 states. [2018-06-26 17:54:14,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:14,410 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-26 17:54:14,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:54:14,411 INFO ]: Start accepts. Automaton has 47 states. Word has length 33 [2018-06-26 17:54:14,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:14,411 INFO ]: With dead ends: 49 [2018-06-26 17:54:14,411 INFO ]: Without dead ends: 34 [2018-06-26 17:54:14,411 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=917, Invalid=2865, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 17:54:14,411 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:54:14,412 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:54:14,412 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:54:14,412 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-26 17:54:14,412 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 33 [2018-06-26 17:54:14,412 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:14,412 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-26 17:54:14,412 INFO ]: Interpolant automaton has 47 states. [2018-06-26 17:54:14,412 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-26 17:54:14,412 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:54:14,412 INFO ]: Found error trace [2018-06-26 17:54:14,412 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:14,412 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:14,412 INFO ]: Analyzing trace with hash -378535858, now seen corresponding path program 39 times [2018-06-26 17:54:14,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:14,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:14,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:14,413 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:14,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:14,425 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:14,766 INFO ]: Checked inductivity of 196 backedges. 92 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:14,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:14,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:14,771 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:14,832 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-26 17:54:14,832 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:14,835 INFO ]: Computing forward predicates... [2018-06-26 17:54:15,128 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:15,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:15,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 46 [2018-06-26 17:54:15,148 INFO ]: Interpolant automaton has 46 states [2018-06-26 17:54:15,148 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-26 17:54:15,148 INFO ]: CoverageRelationStatistics Valid=482, Invalid=1588, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:54:15,148 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 46 states. [2018-06-26 17:54:15,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:15,530 INFO ]: Finished difference Result 35 states and 36 transitions. [2018-06-26 17:54:15,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:54:15,530 INFO ]: Start accepts. Automaton has 46 states. Word has length 33 [2018-06-26 17:54:15,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:15,530 INFO ]: With dead ends: 35 [2018-06-26 17:54:15,530 INFO ]: Without dead ends: 35 [2018-06-26 17:54:15,530 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=2505, Unknown=0, NotChecked=0, Total=3540 [2018-06-26 17:54:15,530 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:54:15,531 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:54:15,531 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:54:15,531 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-26 17:54:15,531 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-06-26 17:54:15,531 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:15,531 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-26 17:54:15,531 INFO ]: Interpolant automaton has 46 states. [2018-06-26 17:54:15,531 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-26 17:54:15,531 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:54:15,531 INFO ]: Found error trace [2018-06-26 17:54:15,531 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:15,531 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:15,532 INFO ]: Analyzing trace with hash 1149582141, now seen corresponding path program 40 times [2018-06-26 17:54:15,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:15,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:15,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:15,532 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:15,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:15,543 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:16,016 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:16,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:16,016 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:16,023 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:16,076 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:16,076 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:16,081 INFO ]: Computing forward predicates... [2018-06-26 17:54:16,178 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:16,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:16,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-26 17:54:16,210 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:54:16,210 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:54:16,210 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:54:16,210 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-06-26 17:54:17,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:17,000 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-26 17:54:17,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:54:17,000 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-26 17:54:17,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:17,000 INFO ]: With dead ends: 53 [2018-06-26 17:54:17,000 INFO ]: Without dead ends: 53 [2018-06-26 17:54:17,000 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=2183, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 17:54:17,000 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 17:54:17,002 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-26 17:54:17,002 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:54:17,002 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-26 17:54:17,002 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-06-26 17:54:17,002 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:17,002 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-26 17:54:17,002 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:54:17,002 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-26 17:54:17,002 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:54:17,002 INFO ]: Found error trace [2018-06-26 17:54:17,002 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:17,002 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:17,003 INFO ]: Analyzing trace with hash 1276599854, now seen corresponding path program 41 times [2018-06-26 17:54:17,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:17,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:17,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:17,003 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:17,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:17,016 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:17,386 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:17,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:17,386 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:17,392 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:17,453 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-26 17:54:17,453 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:17,457 INFO ]: Computing forward predicates... [2018-06-26 17:54:17,922 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:17,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:17,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 50 [2018-06-26 17:54:17,942 INFO ]: Interpolant automaton has 50 states [2018-06-26 17:54:17,942 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-26 17:54:17,942 INFO ]: CoverageRelationStatistics Valid=578, Invalid=1872, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 17:54:17,943 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 50 states. [2018-06-26 17:54:18,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:18,231 INFO ]: Finished difference Result 52 states and 54 transitions. [2018-06-26 17:54:18,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:54:18,231 INFO ]: Start accepts. Automaton has 50 states. Word has length 35 [2018-06-26 17:54:18,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:18,231 INFO ]: With dead ends: 52 [2018-06-26 17:54:18,231 INFO ]: Without dead ends: 36 [2018-06-26 17:54:18,232 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1034, Invalid=3256, Unknown=0, NotChecked=0, Total=4290 [2018-06-26 17:54:18,232 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:54:18,233 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:54:18,233 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:54:18,233 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-26 17:54:18,233 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 35 [2018-06-26 17:54:18,233 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:18,233 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-26 17:54:18,233 INFO ]: Interpolant automaton has 50 states. [2018-06-26 17:54:18,233 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-26 17:54:18,233 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:54:18,233 INFO ]: Found error trace [2018-06-26 17:54:18,233 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:18,233 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:18,233 INFO ]: Analyzing trace with hash -796060473, now seen corresponding path program 42 times [2018-06-26 17:54:18,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:18,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:18,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:18,234 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:18,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:18,242 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:18,682 INFO ]: Checked inductivity of 225 backedges. 106 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:18,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:18,683 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:18,691 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:18,767 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-26 17:54:18,767 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:18,771 INFO ]: Computing forward predicates... [2018-06-26 17:54:19,100 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:19,118 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:19,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 49 [2018-06-26 17:54:19,118 INFO ]: Interpolant automaton has 49 states [2018-06-26 17:54:19,118 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-26 17:54:19,119 INFO ]: CoverageRelationStatistics Valid=546, Invalid=1806, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 17:54:19,119 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 49 states. [2018-06-26 17:54:19,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:19,535 INFO ]: Finished difference Result 37 states and 38 transitions. [2018-06-26 17:54:19,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:54:19,535 INFO ]: Start accepts. Automaton has 49 states. Word has length 35 [2018-06-26 17:54:19,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:19,536 INFO ]: With dead ends: 37 [2018-06-26 17:54:19,536 INFO ]: Without dead ends: 37 [2018-06-26 17:54:19,536 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2018-06-26 17:54:19,536 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:54:19,537 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:54:19,537 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:54:19,538 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-26 17:54:19,538 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-06-26 17:54:19,538 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:19,538 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-26 17:54:19,538 INFO ]: Interpolant automaton has 49 states. [2018-06-26 17:54:19,538 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-26 17:54:19,538 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:54:19,538 INFO ]: Found error trace [2018-06-26 17:54:19,538 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:19,538 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:19,538 INFO ]: Analyzing trace with hash 1091220964, now seen corresponding path program 43 times [2018-06-26 17:54:19,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:19,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:19,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:19,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:19,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:19,552 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:20,324 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:20,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:20,324 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:20,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:20,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:20,389 INFO ]: Computing forward predicates... [2018-06-26 17:54:20,521 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:20,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:20,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-26 17:54:20,541 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:54:20,541 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:54:20,541 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:54:20,541 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 34 states. [2018-06-26 17:54:21,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:21,563 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-26 17:54:21,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:54:21,563 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-26 17:54:21,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:21,563 INFO ]: With dead ends: 56 [2018-06-26 17:54:21,563 INFO ]: Without dead ends: 56 [2018-06-26 17:54:21,563 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=2472, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 17:54:21,563 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-26 17:54:21,565 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-06-26 17:54:21,565 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:54:21,565 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-26 17:54:21,565 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-06-26 17:54:21,565 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:21,565 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-26 17:54:21,565 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:54:21,565 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-26 17:54:21,566 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:54:21,566 INFO ]: Found error trace [2018-06-26 17:54:21,566 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:21,566 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:21,566 INFO ]: Analyzing trace with hash -532596633, now seen corresponding path program 44 times [2018-06-26 17:54:21,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:21,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:21,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:21,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:21,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:21,582 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:21,984 INFO ]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:21,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:21,984 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:21,990 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:22,047 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:22,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:22,051 INFO ]: Computing forward predicates... [2018-06-26 17:54:22,560 INFO ]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:22,579 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:22,579 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 53 [2018-06-26 17:54:22,579 INFO ]: Interpolant automaton has 53 states [2018-06-26 17:54:22,579 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-26 17:54:22,580 INFO ]: CoverageRelationStatistics Valid=648, Invalid=2108, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 17:54:22,580 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 53 states. [2018-06-26 17:54:22,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:22,981 INFO ]: Finished difference Result 55 states and 57 transitions. [2018-06-26 17:54:22,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:54:22,981 INFO ]: Start accepts. Automaton has 53 states. Word has length 37 [2018-06-26 17:54:22,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:22,981 INFO ]: With dead ends: 55 [2018-06-26 17:54:22,981 INFO ]: Without dead ends: 38 [2018-06-26 17:54:22,981 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1158, Invalid=3672, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 17:54:22,981 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:54:22,982 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:54:22,982 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:54:22,982 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-26 17:54:22,982 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 37 [2018-06-26 17:54:22,982 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:22,982 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-26 17:54:22,982 INFO ]: Interpolant automaton has 53 states. [2018-06-26 17:54:22,982 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-26 17:54:22,982 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:54:22,982 INFO ]: Found error trace [2018-06-26 17:54:22,983 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:22,983 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:22,983 INFO ]: Analyzing trace with hash -360557330, now seen corresponding path program 45 times [2018-06-26 17:54:22,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:22,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:22,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:22,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:22,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:22,998 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,535 INFO ]: Checked inductivity of 256 backedges. 121 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:23,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:23,536 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:23,541 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:23,607 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:54:23,607 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:23,611 INFO ]: Computing forward predicates... [2018-06-26 17:54:23,937 INFO ]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:23,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:23,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 52 [2018-06-26 17:54:23,956 INFO ]: Interpolant automaton has 52 states [2018-06-26 17:54:23,957 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-26 17:54:23,957 INFO ]: CoverageRelationStatistics Valid=614, Invalid=2038, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 17:54:23,957 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 52 states. [2018-06-26 17:54:24,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:24,409 INFO ]: Finished difference Result 39 states and 40 transitions. [2018-06-26 17:54:24,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:54:24,409 INFO ]: Start accepts. Automaton has 52 states. Word has length 37 [2018-06-26 17:54:24,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:24,409 INFO ]: With dead ends: 39 [2018-06-26 17:54:24,409 INFO ]: Without dead ends: 39 [2018-06-26 17:54:24,409 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=3230, Unknown=0, NotChecked=0, Total=4556 [2018-06-26 17:54:24,409 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:54:24,410 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:54:24,410 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:54:24,411 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-26 17:54:24,411 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-26 17:54:24,411 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:24,411 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-26 17:54:24,411 INFO ]: Interpolant automaton has 52 states. [2018-06-26 17:54:24,411 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-26 17:54:24,411 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:54:24,411 INFO ]: Found error trace [2018-06-26 17:54:24,411 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:24,411 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:24,412 INFO ]: Analyzing trace with hash 1706916509, now seen corresponding path program 46 times [2018-06-26 17:54:24,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:24,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:24,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:24,412 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:24,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:24,430 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:25,029 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:25,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:25,029 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:25,036 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:25,098 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:25,098 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:25,103 INFO ]: Computing forward predicates... [2018-06-26 17:54:25,176 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:25,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:25,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-26 17:54:25,198 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:54:25,198 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:54:25,198 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:54:25,198 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 36 states. [2018-06-26 17:54:26,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:26,188 INFO ]: Finished difference Result 59 states and 62 transitions. [2018-06-26 17:54:26,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-26 17:54:26,188 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-26 17:54:26,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:26,189 INFO ]: With dead ends: 59 [2018-06-26 17:54:26,189 INFO ]: Without dead ends: 59 [2018-06-26 17:54:26,189 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=2779, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 17:54:26,189 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 17:54:26,191 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-06-26 17:54:26,191 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:54:26,191 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-26 17:54:26,191 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-26 17:54:26,191 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:26,191 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-26 17:54:26,191 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:54:26,191 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-26 17:54:26,191 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:54:26,191 INFO ]: Found error trace [2018-06-26 17:54:26,191 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:26,191 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:26,192 INFO ]: Analyzing trace with hash 1374096078, now seen corresponding path program 47 times [2018-06-26 17:54:26,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:26,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:26,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:26,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:26,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:26,208 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:27,220 INFO ]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:27,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:27,220 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:27,225 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:27,296 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:54:27,296 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:27,301 INFO ]: Computing forward predicates... [2018-06-26 17:54:27,956 INFO ]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:27,975 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:27,975 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 56 [2018-06-26 17:54:27,975 INFO ]: Interpolant automaton has 56 states [2018-06-26 17:54:27,976 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-26 17:54:27,976 INFO ]: CoverageRelationStatistics Valid=722, Invalid=2358, Unknown=0, NotChecked=0, Total=3080 [2018-06-26 17:54:27,976 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 56 states. [2018-06-26 17:54:28,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:28,416 INFO ]: Finished difference Result 58 states and 60 transitions. [2018-06-26 17:54:28,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-26 17:54:28,417 INFO ]: Start accepts. Automaton has 56 states. Word has length 39 [2018-06-26 17:54:28,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:28,417 INFO ]: With dead ends: 58 [2018-06-26 17:54:28,417 INFO ]: Without dead ends: 40 [2018-06-26 17:54:28,417 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1289, Invalid=4113, Unknown=0, NotChecked=0, Total=5402 [2018-06-26 17:54:28,417 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:54:28,418 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:54:28,418 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:54:28,418 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-26 17:54:28,418 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 39 [2018-06-26 17:54:28,418 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:28,418 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-26 17:54:28,418 INFO ]: Interpolant automaton has 56 states. [2018-06-26 17:54:28,418 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-26 17:54:28,418 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:54:28,418 INFO ]: Found error trace [2018-06-26 17:54:28,418 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:28,418 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:28,418 INFO ]: Analyzing trace with hash -1882620121, now seen corresponding path program 48 times [2018-06-26 17:54:28,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:28,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:28,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:28,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:28,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:28,427 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:29,565 INFO ]: Checked inductivity of 289 backedges. 137 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:29,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:29,565 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:29,571 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:29,641 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 17:54:29,641 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:29,646 INFO ]: Computing forward predicates... [2018-06-26 17:54:31,291 INFO ]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:31,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:31,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 55 [2018-06-26 17:54:31,310 INFO ]: Interpolant automaton has 55 states [2018-06-26 17:54:31,310 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-26 17:54:31,310 INFO ]: CoverageRelationStatistics Valid=686, Invalid=2284, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 17:54:31,310 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 55 states. [2018-06-26 17:54:31,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:31,795 INFO ]: Finished difference Result 41 states and 42 transitions. [2018-06-26 17:54:31,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:54:31,795 INFO ]: Start accepts. Automaton has 55 states. Word has length 39 [2018-06-26 17:54:31,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:31,795 INFO ]: With dead ends: 41 [2018-06-26 17:54:31,796 INFO ]: Without dead ends: 41 [2018-06-26 17:54:31,796 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1485, Invalid=3627, Unknown=0, NotChecked=0, Total=5112 [2018-06-26 17:54:31,796 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:54:31,797 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:54:31,797 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:54:31,797 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-26 17:54:31,797 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-06-26 17:54:31,798 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:31,798 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-26 17:54:31,798 INFO ]: Interpolant automaton has 55 states. [2018-06-26 17:54:31,798 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-26 17:54:31,798 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:54:31,798 INFO ]: Found error trace [2018-06-26 17:54:31,798 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:31,798 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:31,798 INFO ]: Analyzing trace with hash 1767610244, now seen corresponding path program 49 times [2018-06-26 17:54:31,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:31,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:31,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:31,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:31,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:31,810 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 17:54:33,521 WARN ]: Verification canceled [2018-06-26 17:54:33,523 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:54:33,524 WARN ]: Timeout [2018-06-26 17:54:33,524 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:54:33 BasicIcfg [2018-06-26 17:54:33,524 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:54:33,525 INFO ]: Toolchain (without parser) took 56943.41 ms. Allocated memory was 305.7 MB in the beginning and 846.7 MB in the end (delta: 541.1 MB). Free memory was 258.9 MB in the beginning and 353.2 MB in the end (delta: -94.4 MB). Peak memory consumption was 446.7 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:33,526 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:54:33,526 INFO ]: ChcToBoogie took 54.94 ms. Allocated memory is still 305.7 MB. Free memory was 258.9 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:33,527 INFO ]: Boogie Preprocessor took 45.44 ms. Allocated memory is still 305.7 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:33,527 INFO ]: RCFGBuilder took 329.86 ms. Allocated memory is still 305.7 MB. Free memory was 254.9 MB in the beginning and 244.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:33,527 INFO ]: BlockEncodingV2 took 102.17 ms. Allocated memory is still 305.7 MB. Free memory was 244.9 MB in the beginning and 240.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:33,528 INFO ]: TraceAbstraction took 56402.60 ms. Allocated memory was 305.7 MB in the beginning and 846.7 MB in the end (delta: 541.1 MB). Free memory was 240.9 MB in the beginning and 353.2 MB in the end (delta: -112.4 MB). Peak memory consumption was 428.7 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:33,534 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 19 edges - StatisticsResult: Encoded RCFG 7 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.94 ms. Allocated memory is still 305.7 MB. Free memory was 258.9 MB in the beginning and 256.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 45.44 ms. Allocated memory is still 305.7 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 329.86 ms. Allocated memory is still 305.7 MB. Free memory was 254.9 MB in the beginning and 244.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 102.17 ms. Allocated memory is still 305.7 MB. Free memory was 244.9 MB in the beginning and 240.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56402.60 ms. Allocated memory was 305.7 MB in the beginning and 846.7 MB in the end (delta: 541.1 MB). Free memory was 240.9 MB in the beginning and 353.2 MB in the end (delta: -112.4 MB). Peak memory consumption was 428.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 56.3s OverallTime, 55 OverallIterations, 17 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 280 SDtfs, 344 SDslu, 2792 SDs, 0 SdLazy, 13615 SolverSat, 1656 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2661 GetRequests, 734 SyntacticMatches, 109 SemanticMatches, 1818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16417 ImplicationChecksByTransitivity, 38.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 54 MinimizatonAttempts, 171 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 237 NumberOfCheckSat, 2227 ConstructedInterpolants, 0 QuantifiedInterpolants, 370271 SizeOfPredicates, 316 NumberOfNonLiveVariables, 18289 ConjunctsInSsa, 4242 ConjunctsInUnsatCore, 105 InterpolantComputations, 6 PerfectInterpolantSequences, 3588/10407 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-54-33-545.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-54-33-545.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-54-33-545.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-54-33-545.csv Completed graceful shutdown