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/llreve-bench/smt2/loop__break_single.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:42:03,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:42:03,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:42:03,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:42:03,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:42:03,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:42:03,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:42:03,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:42:03,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:42:03,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:42:03,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:42:03,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:42:03,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:42:03,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:42:03,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:42:03,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:42:03,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:42:03,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:42:03,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:42:03,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:42:03,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:42:03,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:42:03,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:42:03,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:42:03,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:42:03,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:42:03,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:42:03,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:42:03,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:42:03,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:42:03,330 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:42:03,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:42:03,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:42:03,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:42:03,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:42:03,336 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:42:03,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:42:03,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:42:03,355 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:42:03,356 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:42:03,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:42:03,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:42:03,359 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:42:03,359 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:42:03,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:42:03,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:42:03,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:42:03,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:42:03,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:03,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:42:03,360 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:42:03,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:42:03,363 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:42:03,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:42:03,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:42:03,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:42:03,363 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:42:03,365 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:42:03,365 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:42:03,411 INFO ]: Repository-Root is: /tmp [2018-06-24 21:42:03,429 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:42:03,432 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:42:03,434 INFO ]: Initializing SmtParser... [2018-06-24 21:42:03,434 INFO ]: SmtParser initialized [2018-06-24 21:42:03,434 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-24 21:42:03,435 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:42:03,508 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@19d49eb3 [2018-06-24 21:42:03,675 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-24 21:42:03,679 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:42:03,684 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:42:03,685 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:42:03,685 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:42:03,685 INFO ]: ChcToBoogie initialized [2018-06-24 21:42:03,688 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,744 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03 Unit [2018-06-24 21:42:03,744 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:42:03,745 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:42:03,745 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:42:03,746 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:42:03,766 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,766 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,772 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,772 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,774 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,776 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,777 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,779 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:42:03,779 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:42:03,779 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:42:03,779 INFO ]: RCFGBuilder initialized [2018-06-24 21:42:03,780 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:42:03,795 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:42:03,795 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:42:03,795 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:42:03,795 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:42:03,795 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:42:03,795 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:03,962 INFO ]: Using library mode [2018-06-24 21:42:03,962 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:03 BoogieIcfgContainer [2018-06-24 21:42:03,962 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:42:03,962 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:42:03,962 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:42:03,963 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:42:03,964 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:03" (1/1) ... [2018-06-24 21:42:03,979 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:42:03,981 INFO ]: Using Remove infeasible edges [2018-06-24 21:42:03,981 INFO ]: Using Maximize final states [2018-06-24 21:42:03,982 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:42:03,982 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:42:03,984 INFO ]: Using Remove sink states [2018-06-24 21:42:03,986 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:42:03,986 INFO ]: Using Use SBE [2018-06-24 21:42:04,012 INFO ]: SBE split 3 edges [2018-06-24 21:42:04,016 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:42:04,020 INFO ]: 0 new accepting states [2018-06-24 21:42:04,073 INFO ]: Removed 7 edges and 2 locations by large block encoding [2018-06-24 21:42:04,075 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:04,077 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:42:04,077 INFO ]: 0 new accepting states [2018-06-24 21:42:04,077 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:42:04,077 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:04,078 INFO ]: Encoded RCFG 6 locations, 13 edges [2018-06-24 21:42:04,078 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:04 BasicIcfg [2018-06-24 21:42:04,078 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:42:04,079 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:42:04,079 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:42:04,094 INFO ]: TraceAbstraction initialized [2018-06-24 21:42:04,094 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:03" (1/4) ... [2018-06-24 21:42:04,095 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265fffb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:42:04, skipping insertion in model container [2018-06-24 21:42:04,095 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:03" (2/4) ... [2018-06-24 21:42:04,096 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265fffb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:42:04, skipping insertion in model container [2018-06-24 21:42:04,096 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:03" (3/4) ... [2018-06-24 21:42:04,096 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265fffb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:04, skipping insertion in model container [2018-06-24 21:42:04,096 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:04" (4/4) ... [2018-06-24 21:42:04,097 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:42:04,116 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:42:04,127 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:42:04,172 INFO ]: Using default assertion order modulation [2018-06-24 21:42:04,174 INFO ]: Interprodecural is true [2018-06-24 21:42:04,174 INFO ]: Hoare is false [2018-06-24 21:42:04,174 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:42:04,174 INFO ]: Backedges is TWOTRACK [2018-06-24 21:42:04,174 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:42:04,174 INFO ]: Difference is false [2018-06-24 21:42:04,174 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:42:04,174 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:42:04,188 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:42:04,208 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:42:04,209 INFO ]: Found error trace [2018-06-24 21:42:04,209 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:42:04,210 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:04,224 INFO ]: Analyzing trace with hash 37560071, now seen corresponding path program 1 times [2018-06-24 21:42:04,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:04,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:04,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:04,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:04,358 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:04,359 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:04,359 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:04,361 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:04,375 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:04,376 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:04,378 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:42:04,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:04,482 INFO ]: Finished difference Result 7 states and 17 transitions. [2018-06-24 21:42:04,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:04,484 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:42:04,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:04,499 INFO ]: With dead ends: 7 [2018-06-24 21:42:04,499 INFO ]: Without dead ends: 7 [2018-06-24 21:42:04,501 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:04,519 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:42:04,538 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:42:04,539 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:42:04,540 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-06-24 21:42:04,541 INFO ]: Start accepts. Automaton has 7 states and 17 transitions. Word has length 5 [2018-06-24 21:42:04,542 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:04,542 INFO ]: Abstraction has 7 states and 17 transitions. [2018-06-24 21:42:04,542 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:04,542 INFO ]: Start isEmpty. Operand 7 states and 17 transitions. [2018-06-24 21:42:04,542 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:42:04,542 INFO ]: Found error trace [2018-06-24 21:42:04,542 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:42:04,543 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:04,543 INFO ]: Analyzing trace with hash 37589862, now seen corresponding path program 1 times [2018-06-24 21:42:04,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:04,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:04,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:04,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:04,627 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:04,627 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:04,627 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:04,628 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:04,628 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:04,628 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:04,629 INFO ]: Start difference. First operand 7 states and 17 transitions. Second operand 3 states. [2018-06-24 21:42:04,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:04,869 INFO ]: Finished difference Result 8 states and 22 transitions. [2018-06-24 21:42:04,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:04,871 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:42:04,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:04,871 INFO ]: With dead ends: 8 [2018-06-24 21:42:04,871 INFO ]: Without dead ends: 8 [2018-06-24 21:42:04,872 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:04,872 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:42:04,873 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:42:04,874 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:42:04,874 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-06-24 21:42:04,874 INFO ]: Start accepts. Automaton has 8 states and 22 transitions. Word has length 5 [2018-06-24 21:42:04,874 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:04,874 INFO ]: Abstraction has 8 states and 22 transitions. [2018-06-24 21:42:04,874 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:04,874 INFO ]: Start isEmpty. Operand 8 states and 22 transitions. [2018-06-24 21:42:04,874 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:04,875 INFO ]: Found error trace [2018-06-24 21:42:04,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:04,875 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:04,876 INFO ]: Analyzing trace with hash 1164136527, now seen corresponding path program 1 times [2018-06-24 21:42:04,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:04,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:04,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:04,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,888 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:04,949 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:04,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:04,949 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:04,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:04,983 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:04,989 INFO ]: Computing forward predicates... [2018-06-24 21:42:05,004 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:05,022 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:05,022 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:42:05,023 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:05,023 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:05,023 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:05,023 INFO ]: Start difference. First operand 8 states and 22 transitions. Second operand 4 states. [2018-06-24 21:42:05,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:05,275 INFO ]: Finished difference Result 10 states and 32 transitions. [2018-06-24 21:42:05,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:05,276 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:42:05,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:05,277 INFO ]: With dead ends: 10 [2018-06-24 21:42:05,277 INFO ]: Without dead ends: 10 [2018-06-24 21:42:05,277 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:05,277 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:42:05,279 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:42:05,279 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:42:05,279 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-06-24 21:42:05,280 INFO ]: Start accepts. Automaton has 10 states and 32 transitions. Word has length 6 [2018-06-24 21:42:05,280 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:05,282 INFO ]: Abstraction has 10 states and 32 transitions. [2018-06-24 21:42:05,282 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:05,282 INFO ]: Start isEmpty. Operand 10 states and 32 transitions. [2018-06-24 21:42:05,283 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:05,283 INFO ]: Found error trace [2018-06-24 21:42:05,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:05,283 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:05,283 INFO ]: Analyzing trace with hash 1165060048, now seen corresponding path program 1 times [2018-06-24 21:42:05,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:05,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:05,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:05,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:05,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:05,296 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:05,408 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:05,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:05,408 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:05,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:05,433 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:05,434 INFO ]: Computing forward predicates... [2018-06-24 21:42:05,475 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:05,494 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:42:05,494 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-24 21:42:05,494 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:42:05,495 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:42:05,495 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:05,496 INFO ]: Start difference. First operand 10 states and 32 transitions. Second operand 6 states. [2018-06-24 21:42:05,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:05,939 INFO ]: Finished difference Result 30 states and 122 transitions. [2018-06-24 21:42:05,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:42:05,939 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:42:05,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:05,942 INFO ]: With dead ends: 30 [2018-06-24 21:42:05,942 INFO ]: Without dead ends: 20 [2018-06-24 21:42:05,942 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:42:05,942 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:42:05,946 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-24 21:42:05,946 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:42:05,947 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 69 transitions. [2018-06-24 21:42:05,947 INFO ]: Start accepts. Automaton has 19 states and 69 transitions. Word has length 6 [2018-06-24 21:42:05,947 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:05,947 INFO ]: Abstraction has 19 states and 69 transitions. [2018-06-24 21:42:05,947 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:42:05,947 INFO ]: Start isEmpty. Operand 19 states and 69 transitions. [2018-06-24 21:42:05,948 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:05,948 INFO ]: Found error trace [2018-06-24 21:42:05,948 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:05,948 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:05,948 INFO ]: Analyzing trace with hash 1165119630, now seen corresponding path program 1 times [2018-06-24 21:42:05,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:05,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:05,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:05,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:05,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:05,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:06,010 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:06,011 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:06,011 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:06,011 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:06,011 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:06,011 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:06,011 INFO ]: Start difference. First operand 19 states and 69 transitions. Second operand 4 states. [2018-06-24 21:42:06,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:06,043 INFO ]: Finished difference Result 22 states and 79 transitions. [2018-06-24 21:42:06,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:06,043 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:42:06,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:06,044 INFO ]: With dead ends: 22 [2018-06-24 21:42:06,044 INFO ]: Without dead ends: 22 [2018-06-24 21:42:06,045 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:06,045 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:42:06,047 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 21:42:06,047 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:42:06,048 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2018-06-24 21:42:06,048 INFO ]: Start accepts. Automaton has 16 states and 54 transitions. Word has length 6 [2018-06-24 21:42:06,048 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:06,048 INFO ]: Abstraction has 16 states and 54 transitions. [2018-06-24 21:42:06,048 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:06,048 INFO ]: Start isEmpty. Operand 16 states and 54 transitions. [2018-06-24 21:42:06,048 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:06,048 INFO ]: Found error trace [2018-06-24 21:42:06,048 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:06,048 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:06,049 INFO ]: Analyzing trace with hash 1713491959, now seen corresponding path program 1 times [2018-06-24 21:42:06,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:06,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:06,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:06,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,057 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:06,076 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:06,076 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:06,076 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:06,077 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:06,077 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:06,077 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:06,077 INFO ]: Start difference. First operand 16 states and 54 transitions. Second operand 3 states. [2018-06-24 21:42:06,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:06,246 INFO ]: Finished difference Result 19 states and 63 transitions. [2018-06-24 21:42:06,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:06,246 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:06,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:06,247 INFO ]: With dead ends: 19 [2018-06-24 21:42:06,247 INFO ]: Without dead ends: 19 [2018-06-24 21:42:06,247 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:06,248 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:42:06,250 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-24 21:42:06,250 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:42:06,250 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-06-24 21:42:06,250 INFO ]: Start accepts. Automaton has 13 states and 42 transitions. Word has length 7 [2018-06-24 21:42:06,250 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:06,250 INFO ]: Abstraction has 13 states and 42 transitions. [2018-06-24 21:42:06,250 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:06,250 INFO ]: Start isEmpty. Operand 13 states and 42 transitions. [2018-06-24 21:42:06,251 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:06,251 INFO ]: Found error trace [2018-06-24 21:42:06,251 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:06,251 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:06,251 INFO ]: Analyzing trace with hash 1727791639, now seen corresponding path program 2 times [2018-06-24 21:42:06,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:06,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:06,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:06,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,261 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:06,527 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:06,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:06,527 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:06,534 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:42:06,553 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:42:06,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:06,555 INFO ]: Computing forward predicates... [2018-06-24 21:42:06,581 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:06,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:06,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:42:06,603 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:42:06,603 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:42:06,603 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:06,603 INFO ]: Start difference. First operand 13 states and 42 transitions. Second operand 6 states. [2018-06-24 21:42:06,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:06,661 INFO ]: Finished difference Result 24 states and 90 transitions. [2018-06-24 21:42:06,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:42:06,661 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:42:06,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:06,662 INFO ]: With dead ends: 24 [2018-06-24 21:42:06,662 INFO ]: Without dead ends: 24 [2018-06-24 21:42:06,663 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:06,663 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:42:06,665 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-06-24 21:42:06,666 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:42:06,666 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2018-06-24 21:42:06,666 INFO ]: Start accepts. Automaton has 21 states and 78 transitions. Word has length 7 [2018-06-24 21:42:06,666 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:06,666 INFO ]: Abstraction has 21 states and 78 transitions. [2018-06-24 21:42:06,666 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:42:06,666 INFO ]: Start isEmpty. Operand 21 states and 78 transitions. [2018-06-24 21:42:06,667 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:06,667 INFO ]: Found error trace [2018-06-24 21:42:06,667 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:06,667 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:06,667 INFO ]: Analyzing trace with hash 1758267832, now seen corresponding path program 1 times [2018-06-24 21:42:06,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:06,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:06,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,668 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:06,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:06,708 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:06,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:06,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:06,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:06,725 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:06,726 INFO ]: Computing forward predicates... [2018-06-24 21:42:06,761 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:06,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:06,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:42:06,780 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:42:06,780 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:42:06,780 INFO ]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:06,780 INFO ]: Start difference. First operand 21 states and 78 transitions. Second operand 8 states. [2018-06-24 21:42:06,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:06,933 INFO ]: Finished difference Result 54 states and 185 transitions. [2018-06-24 21:42:06,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:42:06,933 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:42:06,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:06,935 INFO ]: With dead ends: 54 [2018-06-24 21:42:06,935 INFO ]: Without dead ends: 54 [2018-06-24 21:42:06,935 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:42:06,935 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 21:42:06,941 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-06-24 21:42:06,941 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:42:06,942 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 139 transitions. [2018-06-24 21:42:06,942 INFO ]: Start accepts. Automaton has 41 states and 139 transitions. Word has length 7 [2018-06-24 21:42:06,942 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:06,942 INFO ]: Abstraction has 41 states and 139 transitions. [2018-06-24 21:42:06,942 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:42:06,942 INFO ]: Start isEmpty. Operand 41 states and 139 transitions. [2018-06-24 21:42:06,943 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:42:06,943 INFO ]: Found error trace [2018-06-24 21:42:06,943 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:06,943 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:06,944 INFO ]: Analyzing trace with hash -1767053033, now seen corresponding path program 3 times [2018-06-24 21:42:06,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:06,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:06,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:06,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:06,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:07,010 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:07,010 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:07,010 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:07,018 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:42:07,045 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:42:07,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:07,047 INFO ]: Computing forward predicates... [2018-06-24 21:42:07,071 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:07,093 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:07,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 21:42:07,093 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:42:07,093 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:42:07,093 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:07,094 INFO ]: Start difference. First operand 41 states and 139 transitions. Second operand 8 states. [2018-06-24 21:42:07,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:07,212 INFO ]: Finished difference Result 70 states and 243 transitions. [2018-06-24 21:42:07,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:42:07,212 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:42:07,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:07,214 INFO ]: With dead ends: 70 [2018-06-24 21:42:07,214 INFO ]: Without dead ends: 70 [2018-06-24 21:42:07,214 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:07,214 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:42:07,221 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 61. [2018-06-24 21:42:07,221 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 21:42:07,222 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 211 transitions. [2018-06-24 21:42:07,222 INFO ]: Start accepts. Automaton has 61 states and 211 transitions. Word has length 9 [2018-06-24 21:42:07,222 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:07,222 INFO ]: Abstraction has 61 states and 211 transitions. [2018-06-24 21:42:07,222 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:42:07,222 INFO ]: Start isEmpty. Operand 61 states and 211 transitions. [2018-06-24 21:42:07,223 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:42:07,223 INFO ]: Found error trace [2018-06-24 21:42:07,223 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:07,223 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:07,224 INFO ]: Analyzing trace with hash -1322776328, now seen corresponding path program 2 times [2018-06-24 21:42:07,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:07,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:07,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:07,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:07,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:07,235 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:07,253 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:42:07,254 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:07,254 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:07,254 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:07,254 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:07,254 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:07,254 INFO ]: Start difference. First operand 61 states and 211 transitions. Second operand 3 states. [2018-06-24 21:42:07,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:07,282 INFO ]: Finished difference Result 62 states and 166 transitions. [2018-06-24 21:42:07,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:07,282 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 21:42:07,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:07,282 INFO ]: With dead ends: 62 [2018-06-24 21:42:07,282 INFO ]: Without dead ends: 39 [2018-06-24 21:42:07,283 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:07,283 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:42:07,286 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 25. [2018-06-24 21:42:07,286 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:42:07,286 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 50 transitions. [2018-06-24 21:42:07,286 INFO ]: Start accepts. Automaton has 25 states and 50 transitions. Word has length 9 [2018-06-24 21:42:07,286 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:07,286 INFO ]: Abstraction has 25 states and 50 transitions. [2018-06-24 21:42:07,286 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:07,287 INFO ]: Start isEmpty. Operand 25 states and 50 transitions. [2018-06-24 21:42:07,287 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:42:07,287 INFO ]: Found error trace [2018-06-24 21:42:07,287 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:07,287 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:07,287 INFO ]: Analyzing trace with hash 1750764664, now seen corresponding path program 3 times [2018-06-24 21:42:07,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:07,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:07,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:07,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:07,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:07,298 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:07,479 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:07,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:07,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:07,486 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:42:07,529 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:42:07,529 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:07,531 INFO ]: Computing forward predicates... [2018-06-24 21:42:07,590 INFO ]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:07,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:07,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:42:07,611 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:42:07,611 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:42:07,611 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:42:07,611 INFO ]: Start difference. First operand 25 states and 50 transitions. Second operand 12 states. [2018-06-24 21:42:08,165 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:42:08,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:08,289 INFO ]: Finished difference Result 44 states and 71 transitions. [2018-06-24 21:42:08,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:42:08,289 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:42:08,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:08,289 INFO ]: With dead ends: 44 [2018-06-24 21:42:08,289 INFO ]: Without dead ends: 44 [2018-06-24 21:42:08,290 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:42:08,290 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:42:08,292 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 21. [2018-06-24 21:42:08,293 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:42:08,293 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 41 transitions. [2018-06-24 21:42:08,293 INFO ]: Start accepts. Automaton has 21 states and 41 transitions. Word has length 9 [2018-06-24 21:42:08,293 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:08,293 INFO ]: Abstraction has 21 states and 41 transitions. [2018-06-24 21:42:08,293 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:42:08,293 INFO ]: Start isEmpty. Operand 21 states and 41 transitions. [2018-06-24 21:42:08,294 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:42:08,294 INFO ]: Found error trace [2018-06-24 21:42:08,294 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:08,294 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:08,294 INFO ]: Analyzing trace with hash -1561572594, now seen corresponding path program 4 times [2018-06-24 21:42:08,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:08,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:08,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:08,295 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:08,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:08,307 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:08,365 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:08,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:08,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:08,372 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:42:08,396 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:42:08,396 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:08,398 INFO ]: Computing forward predicates... [2018-06-24 21:42:08,505 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:08,530 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:08,530 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:42:08,530 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:42:08,530 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:42:08,531 INFO ]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:42:08,531 INFO ]: Start difference. First operand 21 states and 41 transitions. Second operand 14 states. [2018-06-24 21:42:08,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:08,801 INFO ]: Finished difference Result 45 states and 70 transitions. [2018-06-24 21:42:08,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:42:08,802 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:42:08,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:08,802 INFO ]: With dead ends: 45 [2018-06-24 21:42:08,802 INFO ]: Without dead ends: 45 [2018-06-24 21:42:08,803 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:42:08,803 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:42:08,805 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-06-24 21:42:08,805 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:42:08,806 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2018-06-24 21:42:08,806 INFO ]: Start accepts. Automaton has 22 states and 42 transitions. Word has length 10 [2018-06-24 21:42:08,806 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:08,806 INFO ]: Abstraction has 22 states and 42 transitions. [2018-06-24 21:42:08,806 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:42:08,806 INFO ]: Start isEmpty. Operand 22 states and 42 transitions. [2018-06-24 21:42:08,806 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:42:08,806 INFO ]: Found error trace [2018-06-24 21:42:08,806 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:08,806 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:08,806 INFO ]: Analyzing trace with hash -1648357353, now seen corresponding path program 4 times [2018-06-24 21:42:08,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:08,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:08,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:08,807 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:08,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:08,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:08,898 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:08,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:08,898 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:08,906 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:42:08,920 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:42:08,920 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:08,921 INFO ]: Computing forward predicates... [2018-06-24 21:42:08,944 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:08,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:08,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:42:08,964 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:42:08,964 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:42:08,964 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:42:08,964 INFO ]: Start difference. First operand 22 states and 42 transitions. Second operand 10 states. [2018-06-24 21:42:09,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:09,062 INFO ]: Finished difference Result 64 states and 109 transitions. [2018-06-24 21:42:09,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:42:09,063 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 21:42:09,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:09,063 INFO ]: With dead ends: 64 [2018-06-24 21:42:09,063 INFO ]: Without dead ends: 64 [2018-06-24 21:42:09,063 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:42:09,066 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 21:42:09,068 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 27. [2018-06-24 21:42:09,068 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:42:09,069 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2018-06-24 21:42:09,069 INFO ]: Start accepts. Automaton has 27 states and 54 transitions. Word has length 11 [2018-06-24 21:42:09,069 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:09,069 INFO ]: Abstraction has 27 states and 54 transitions. [2018-06-24 21:42:09,069 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:42:09,069 INFO ]: Start isEmpty. Operand 27 states and 54 transitions. [2018-06-24 21:42:09,069 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:42:09,069 INFO ]: Found error trace [2018-06-24 21:42:09,070 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:09,070 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:09,070 INFO ]: Analyzing trace with hash -1164812488, now seen corresponding path program 5 times [2018-06-24 21:42:09,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:09,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:09,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:09,070 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:09,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:09,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:09,265 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:09,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:09,265 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:09,271 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:42:09,287 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:42:09,287 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:09,290 INFO ]: Computing forward predicates... [2018-06-24 21:42:09,455 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:09,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:09,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 21:42:09,475 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:42:09,475 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:42:09,475 INFO ]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:42:09,475 INFO ]: Start difference. First operand 27 states and 54 transitions. Second operand 15 states. [2018-06-24 21:42:09,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:09,856 INFO ]: Finished difference Result 65 states and 98 transitions. [2018-06-24 21:42:09,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:42:09,856 INFO ]: Start accepts. Automaton has 15 states. Word has length 11 [2018-06-24 21:42:09,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:09,856 INFO ]: With dead ends: 65 [2018-06-24 21:42:09,856 INFO ]: Without dead ends: 65 [2018-06-24 21:42:09,857 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:42:09,857 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 21:42:09,859 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 25. [2018-06-24 21:42:09,860 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:42:09,860 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-06-24 21:42:09,860 INFO ]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 11 [2018-06-24 21:42:09,860 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:09,860 INFO ]: Abstraction has 25 states and 49 transitions. [2018-06-24 21:42:09,860 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:42:09,860 INFO ]: Start isEmpty. Operand 25 states and 49 transitions. [2018-06-24 21:42:09,861 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:42:09,861 INFO ]: Found error trace [2018-06-24 21:42:09,861 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:09,861 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:09,861 INFO ]: Analyzing trace with hash -1750151090, now seen corresponding path program 6 times [2018-06-24 21:42:09,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:09,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:09,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:09,861 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:09,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:09,872 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:09,937 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:09,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:09,937 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:09,943 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:42:10,027 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:42:10,027 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:10,030 INFO ]: Computing forward predicates... [2018-06-24 21:42:10,279 INFO ]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:10,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:10,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 21:42:10,298 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:42:10,298 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:42:10,298 INFO ]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:42:10,299 INFO ]: Start difference. First operand 25 states and 49 transitions. Second operand 18 states. [2018-06-24 21:42:10,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:10,994 INFO ]: Finished difference Result 66 states and 97 transitions. [2018-06-24 21:42:10,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:42:10,994 INFO ]: Start accepts. Automaton has 18 states. Word has length 12 [2018-06-24 21:42:10,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:10,995 INFO ]: With dead ends: 66 [2018-06-24 21:42:10,995 INFO ]: Without dead ends: 66 [2018-06-24 21:42:10,996 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1858, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 21:42:10,996 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 21:42:10,998 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 26. [2018-06-24 21:42:10,998 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:42:10,998 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 50 transitions. [2018-06-24 21:42:10,998 INFO ]: Start accepts. Automaton has 26 states and 50 transitions. Word has length 12 [2018-06-24 21:42:10,998 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:10,999 INFO ]: Abstraction has 26 states and 50 transitions. [2018-06-24 21:42:10,999 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:42:10,999 INFO ]: Start isEmpty. Operand 26 states and 50 transitions. [2018-06-24 21:42:10,999 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:42:10,999 INFO ]: Found error trace [2018-06-24 21:42:10,999 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:10,999 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:10,999 INFO ]: Analyzing trace with hash 749041431, now seen corresponding path program 5 times [2018-06-24 21:42:10,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:10,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:11,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:11,000 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:11,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:11,011 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:11,114 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:11,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:11,114 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:11,127 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:42:11,162 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:42:11,162 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:11,163 INFO ]: Computing forward predicates... [2018-06-24 21:42:11,179 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:11,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:11,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 21:42:11,200 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:42:11,200 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:42:11,200 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:42:11,200 INFO ]: Start difference. First operand 26 states and 50 transitions. Second operand 12 states. [2018-06-24 21:42:11,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:11,262 INFO ]: Finished difference Result 89 states and 144 transitions. [2018-06-24 21:42:11,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:42:11,262 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 21:42:11,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:11,263 INFO ]: With dead ends: 89 [2018-06-24 21:42:11,263 INFO ]: Without dead ends: 89 [2018-06-24 21:42:11,263 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:42:11,263 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 21:42:11,266 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 31. [2018-06-24 21:42:11,266 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:42:11,266 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 62 transitions. [2018-06-24 21:42:11,266 INFO ]: Start accepts. Automaton has 31 states and 62 transitions. Word has length 13 [2018-06-24 21:42:11,266 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:11,266 INFO ]: Abstraction has 31 states and 62 transitions. [2018-06-24 21:42:11,266 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:42:11,266 INFO ]: Start isEmpty. Operand 31 states and 62 transitions. [2018-06-24 21:42:11,267 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:42:11,267 INFO ]: Found error trace [2018-06-24 21:42:11,267 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:11,267 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:11,267 INFO ]: Analyzing trace with hash 1579188728, now seen corresponding path program 7 times [2018-06-24 21:42:11,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:11,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:11,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:11,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:11,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:11,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:11,383 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:11,383 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:11,383 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:11,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:11,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:11,420 INFO ]: Computing forward predicates... [2018-06-24 21:42:11,520 INFO ]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:11,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:11,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 21:42:11,540 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:42:11,540 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:42:11,540 INFO ]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:42:11,540 INFO ]: Start difference. First operand 31 states and 62 transitions. Second operand 20 states. [2018-06-24 21:42:12,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:12,403 INFO ]: Finished difference Result 90 states and 129 transitions. [2018-06-24 21:42:12,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-24 21:42:12,403 INFO ]: Start accepts. Automaton has 20 states. Word has length 13 [2018-06-24 21:42:12,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:12,404 INFO ]: With dead ends: 90 [2018-06-24 21:42:12,404 INFO ]: Without dead ends: 90 [2018-06-24 21:42:12,405 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=2786, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 21:42:12,405 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-24 21:42:12,407 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 29. [2018-06-24 21:42:12,407 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:42:12,408 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 57 transitions. [2018-06-24 21:42:12,408 INFO ]: Start accepts. Automaton has 29 states and 57 transitions. Word has length 13 [2018-06-24 21:42:12,408 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:12,408 INFO ]: Abstraction has 29 states and 57 transitions. [2018-06-24 21:42:12,408 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:42:12,408 INFO ]: Start isEmpty. Operand 29 states and 57 transitions. [2018-06-24 21:42:12,408 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:42:12,408 INFO ]: Found error trace [2018-06-24 21:42:12,408 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:12,408 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:12,408 INFO ]: Analyzing trace with hash 1709507982, now seen corresponding path program 8 times [2018-06-24 21:42:12,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:12,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:12,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:12,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:12,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:12,420 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:12,643 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:12,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:12,644 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:12,649 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:42:12,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:42:12,668 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:12,670 INFO ]: Computing forward predicates... [2018-06-24 21:42:12,806 INFO ]: Checked inductivity of 45 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:12,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:12,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-24 21:42:12,825 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:42:12,825 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:42:12,825 INFO ]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:42:12,825 INFO ]: Start difference. First operand 29 states and 57 transitions. Second operand 22 states. [2018-06-24 21:42:15,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:15,037 INFO ]: Finished difference Result 91 states and 128 transitions. [2018-06-24 21:42:15,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-24 21:42:15,038 INFO ]: Start accepts. Automaton has 22 states. Word has length 14 [2018-06-24 21:42:15,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:15,038 INFO ]: With dead ends: 91 [2018-06-24 21:42:15,038 INFO ]: Without dead ends: 91 [2018-06-24 21:42:15,039 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=529, Invalid=4027, Unknown=0, NotChecked=0, Total=4556 [2018-06-24 21:42:15,040 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-24 21:42:15,041 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 30. [2018-06-24 21:42:15,041 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:42:15,041 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 58 transitions. [2018-06-24 21:42:15,041 INFO ]: Start accepts. Automaton has 30 states and 58 transitions. Word has length 14 [2018-06-24 21:42:15,041 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:15,041 INFO ]: Abstraction has 30 states and 58 transitions. [2018-06-24 21:42:15,041 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:42:15,042 INFO ]: Start isEmpty. Operand 30 states and 58 transitions. [2018-06-24 21:42:15,042 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:42:15,042 INFO ]: Found error trace [2018-06-24 21:42:15,042 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:15,042 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:15,042 INFO ]: Analyzing trace with hash -1748165097, now seen corresponding path program 6 times [2018-06-24 21:42:15,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:15,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:15,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:15,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:15,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:15,060 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:15,197 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:15,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:15,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:15,202 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:42:15,225 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 21:42:15,225 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:15,227 INFO ]: Computing forward predicates... [2018-06-24 21:42:15,248 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:15,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:15,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 21:42:15,268 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:42:15,268 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:42:15,268 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:42:15,268 INFO ]: Start difference. First operand 30 states and 58 transitions. Second operand 14 states. [2018-06-24 21:42:15,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:15,338 INFO ]: Finished difference Result 106 states and 167 transitions. [2018-06-24 21:42:15,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:42:15,338 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 21:42:15,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:15,338 INFO ]: With dead ends: 106 [2018-06-24 21:42:15,338 INFO ]: Without dead ends: 106 [2018-06-24 21:42:15,338 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:42:15,339 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-24 21:42:15,340 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 31. [2018-06-24 21:42:15,340 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:42:15,341 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 61 transitions. [2018-06-24 21:42:15,341 INFO ]: Start accepts. Automaton has 31 states and 61 transitions. Word has length 15 [2018-06-24 21:42:15,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:15,341 INFO ]: Abstraction has 31 states and 61 transitions. [2018-06-24 21:42:15,341 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:42:15,341 INFO ]: Start isEmpty. Operand 31 states and 61 transitions. [2018-06-24 21:42:15,342 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:42:15,342 INFO ]: Found error trace [2018-06-24 21:42:15,342 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:15,342 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:15,342 INFO ]: Analyzing trace with hash 1454437560, now seen corresponding path program 9 times [2018-06-24 21:42:15,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:15,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:15,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:15,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:15,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:15,352 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:15,541 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:15,541 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:15,541 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:15,547 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:42:15,615 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:42:15,615 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:15,618 INFO ]: Computing forward predicates... [2018-06-24 21:42:15,760 INFO ]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:15,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:15,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-24 21:42:15,780 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:42:15,780 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:42:15,780 INFO ]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:42:15,780 INFO ]: Start difference. First operand 31 states and 61 transitions. Second operand 24 states. [2018-06-24 21:42:16,892 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 21:42:17,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:17,047 INFO ]: Finished difference Result 105 states and 145 transitions. [2018-06-24 21:42:17,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-24 21:42:17,047 INFO ]: Start accepts. Automaton has 24 states. Word has length 15 [2018-06-24 21:42:17,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:17,047 INFO ]: With dead ends: 105 [2018-06-24 21:42:17,047 INFO ]: Without dead ends: 105 [2018-06-24 21:42:17,048 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=675, Invalid=5645, Unknown=0, NotChecked=0, Total=6320 [2018-06-24 21:42:17,049 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-24 21:42:17,050 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 32. [2018-06-24 21:42:17,050 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:42:17,050 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 62 transitions. [2018-06-24 21:42:17,050 INFO ]: Start accepts. Automaton has 32 states and 62 transitions. Word has length 15 [2018-06-24 21:42:17,050 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:17,050 INFO ]: Abstraction has 32 states and 62 transitions. [2018-06-24 21:42:17,050 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:42:17,050 INFO ]: Start isEmpty. Operand 32 states and 62 transitions. [2018-06-24 21:42:17,051 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:42:17,051 INFO ]: Found error trace [2018-06-24 21:42:17,051 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:17,051 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:17,051 INFO ]: Analyzing trace with hash 1640754511, now seen corresponding path program 7 times [2018-06-24 21:42:17,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:17,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:17,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:17,051 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:17,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:17,076 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:17,424 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:17,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:17,424 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:17,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:17,457 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:17,460 INFO ]: Computing forward predicates... [2018-06-24 21:42:17,869 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:17,889 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:17,889 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-24 21:42:17,889 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:42:17,889 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:42:17,889 INFO ]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:42:17,889 INFO ]: Start difference. First operand 32 states and 62 transitions. Second operand 26 states. [2018-06-24 21:42:18,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:18,336 INFO ]: Finished difference Result 126 states and 161 transitions. [2018-06-24 21:42:18,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:42:18,337 INFO ]: Start accepts. Automaton has 26 states. Word has length 16 [2018-06-24 21:42:18,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:18,338 INFO ]: With dead ends: 126 [2018-06-24 21:42:18,338 INFO ]: Without dead ends: 126 [2018-06-24 21:42:18,338 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:42:18,338 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-24 21:42:18,340 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 20. [2018-06-24 21:42:18,340 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:42:18,340 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-24 21:42:18,340 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 [2018-06-24 21:42:18,340 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:18,340 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-24 21:42:18,340 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:42:18,340 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-24 21:42:18,341 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:42:18,341 INFO ]: Found error trace [2018-06-24 21:42:18,341 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:18,341 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:18,341 INFO ]: Analyzing trace with hash 2137189070, now seen corresponding path program 10 times [2018-06-24 21:42:18,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:18,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:18,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:18,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:18,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:18,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:18,425 INFO ]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 21:42:18,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:18,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:18,433 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:42:18,468 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:42:18,468 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:18,473 INFO ]: Computing forward predicates... [2018-06-24 21:42:18,716 INFO ]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:18,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:18,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14] total 17 [2018-06-24 21:42:18,736 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:42:18,736 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:42:18,736 INFO ]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:42:18,736 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 17 states. [2018-06-24 21:42:19,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:19,040 INFO ]: Finished difference Result 40 states and 49 transitions. [2018-06-24 21:42:19,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:42:19,042 INFO ]: Start accepts. Automaton has 17 states. Word has length 16 [2018-06-24 21:42:19,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:19,042 INFO ]: With dead ends: 40 [2018-06-24 21:42:19,042 INFO ]: Without dead ends: 0 [2018-06-24 21:42:19,042 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:42:19,042 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:42:19,042 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:42:19,042 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:42:19,042 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:42:19,042 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-06-24 21:42:19,042 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:19,043 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:42:19,043 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:42:19,043 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:42:19,043 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:42:19,045 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:42:19,046 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:19 BasicIcfg [2018-06-24 21:42:19,046 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:42:19,047 INFO ]: Toolchain (without parser) took 15367.24 ms. Allocated memory was 309.3 MB in the beginning and 551.6 MB in the end (delta: 242.2 MB). Free memory was 265.7 MB in the beginning and 502.0 MB in the end (delta: -236.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:19,048 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:19,048 INFO ]: ChcToBoogie took 59.85 ms. Allocated memory is still 309.3 MB. Free memory was 265.7 MB in the beginning and 263.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:19,048 INFO ]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:19,049 INFO ]: RCFGBuilder took 182.84 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 253.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:19,049 INFO ]: BlockEncodingV2 took 115.61 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:19,049 INFO ]: TraceAbstraction took 14967.24 ms. Allocated memory was 309.3 MB in the beginning and 551.6 MB in the end (delta: 242.2 MB). Free memory was 249.8 MB in the beginning and 502.0 MB in the end (delta: -252.3 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:19,052 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 13 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.85 ms. Allocated memory is still 309.3 MB. Free memory was 265.7 MB in the beginning and 263.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.48 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 182.84 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 253.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 115.61 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14967.24 ms. Allocated memory was 309.3 MB in the beginning and 551.6 MB in the end (delta: 242.2 MB). Free memory was 249.8 MB in the beginning and 502.0 MB in the end (delta: -252.3 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 14.8s OverallTime, 22 OverallIterations, 10 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 3 SDslu, 469 SDs, 0 SdLazy, 2750 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 591 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4972 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=9, 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, 22 MinimizatonAttempts, 649 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 21719 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2287 ConjunctsInSsa, 1007 ConjunctsInUnsatCore, 39 InterpolantComputations, 6 PerfectInterpolantSequences, 73/958 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-42-19-062.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-42-19-062.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-42-19-062.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-42-19-062.csv Received shutdown request...