java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:41:03,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:41:03,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:41:03,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:41:03,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:41:03,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:41:03,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:41:03,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:41:03,511 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:41:03,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:41:03,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:41:03,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:41:03,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:41:03,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:41:03,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:41:03,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:41:03,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:41:03,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:41:03,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:41:03,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:41:03,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:41:03,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:41:03,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:41:03,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:41:03,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:41:03,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:41:03,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:41:03,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:41:03,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:41:03,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:41:03,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:41:03,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:41:03,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:41:03,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:41:03,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:41:03,553 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:41:03,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:41:03,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:41:03,572 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:41:03,572 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:41:03,573 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:41:03,573 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:41:03,574 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:41:03,574 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:41:03,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:41:03,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:41:03,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:41:03,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:41:03,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:41:03,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:41:03,575 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:41:03,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:41:03,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:41:03,576 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:41:03,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:41:03,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:41:03,576 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:41:03,577 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:41:03,578 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:41:03,625 INFO ]: Repository-Root is: /tmp [2018-06-24 20:41:03,644 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:41:03,649 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:41:03,650 INFO ]: Initializing SmtParser... [2018-06-24 20:41:03,651 INFO ]: SmtParser initialized [2018-06-24 20:41:03,651 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 [2018-06-24 20:41:03,653 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:41:03,740 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 unknown [2018-06-24 20:41:04,103 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/23.c.smt2 [2018-06-24 20:41:04,111 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:41:04,119 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:41:04,119 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:41:04,119 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:41:04,119 INFO ]: ChcToBoogie initialized [2018-06-24 20:41:04,123 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,209 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04 Unit [2018-06-24 20:41:04,210 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:41:04,210 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:41:04,210 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:41:04,210 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:41:04,248 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,249 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,264 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,264 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,272 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,274 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,275 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,278 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:41:04,278 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:41:04,278 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:41:04,278 INFO ]: RCFGBuilder initialized [2018-06-24 20:41:04,279 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:41:04,291 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:41:04,291 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:41:04,291 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:41:04,291 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:41:04,291 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:41:04,291 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:41:04,582 INFO ]: Using library mode [2018-06-24 20:41:04,582 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:41:04 BoogieIcfgContainer [2018-06-24 20:41:04,582 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:41:04,582 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:41:04,582 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:41:04,583 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:41:04,584 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:41:04" (1/1) ... [2018-06-24 20:41:04,601 INFO ]: Initial Icfg 25 locations, 25 edges [2018-06-24 20:41:04,602 INFO ]: Using Remove infeasible edges [2018-06-24 20:41:04,602 INFO ]: Using Maximize final states [2018-06-24 20:41:04,602 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:41:04,602 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:41:04,604 INFO ]: Using Remove sink states [2018-06-24 20:41:04,605 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:41:04,605 INFO ]: Using Use SBE [2018-06-24 20:41:04,612 INFO ]: SBE split 0 edges [2018-06-24 20:41:04,618 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:41:04,622 INFO ]: 0 new accepting states [2018-06-24 20:41:04,897 INFO ]: Removed 35 edges and 17 locations by large block encoding [2018-06-24 20:41:04,899 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:41:04,903 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:41:04,903 INFO ]: 0 new accepting states [2018-06-24 20:41:04,903 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:41:04,907 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:41:04,907 INFO ]: Encoded RCFG 6 locations, 6 edges [2018-06-24 20:41:04,907 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:41:04 BasicIcfg [2018-06-24 20:41:04,908 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:41:04,909 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:41:04,909 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:41:04,912 INFO ]: TraceAbstraction initialized [2018-06-24 20:41:04,912 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:41:04" (1/4) ... [2018-06-24 20:41:04,913 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b6e641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:41:04, skipping insertion in model container [2018-06-24 20:41:04,913 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:41:04" (2/4) ... [2018-06-24 20:41:04,913 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b6e641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:41:04, skipping insertion in model container [2018-06-24 20:41:04,913 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:41:04" (3/4) ... [2018-06-24 20:41:04,914 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b6e641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:41:04, skipping insertion in model container [2018-06-24 20:41:04,914 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:41:04" (4/4) ... [2018-06-24 20:41:04,915 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:41:04,926 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:41:04,934 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:41:04,969 INFO ]: Using default assertion order modulation [2018-06-24 20:41:04,969 INFO ]: Interprodecural is true [2018-06-24 20:41:04,969 INFO ]: Hoare is false [2018-06-24 20:41:04,969 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:41:04,969 INFO ]: Backedges is TWOTRACK [2018-06-24 20:41:04,969 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:41:04,970 INFO ]: Difference is false [2018-06-24 20:41:04,970 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:41:04,970 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:41:04,983 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:41:04,999 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:41:04,999 INFO ]: Found error trace [2018-06-24 20:41:05,000 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:41:05,000 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:05,007 INFO ]: Analyzing trace with hash 33317674, now seen corresponding path program 1 times [2018-06-24 20:41:05,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:05,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:05,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:05,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:05,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:05,122 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:05,225 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:05,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:41:05,227 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:41:05,228 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:41:05,238 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:41:05,238 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:41:05,240 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:41:05,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:05,293 INFO ]: Finished difference Result 7 states and 7 transitions. [2018-06-24 20:41:05,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:41:05,294 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:41:05,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:05,300 INFO ]: With dead ends: 7 [2018-06-24 20:41:05,300 INFO ]: Without dead ends: 7 [2018-06-24 20:41:05,302 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:41:05,315 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:41:05,327 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:41:05,328 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:41:05,328 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-24 20:41:05,329 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-06-24 20:41:05,329 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:05,329 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-24 20:41:05,329 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:41:05,329 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-24 20:41:05,329 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:41:05,329 INFO ]: Found error trace [2018-06-24 20:41:05,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:41:05,330 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:05,330 INFO ]: Analyzing trace with hash 1032626978, now seen corresponding path program 1 times [2018-06-24 20:41:05,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:05,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:05,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:05,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:05,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:05,387 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:05,499 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:05,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:05,499 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:05,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:05,631 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:05,640 INFO ]: Computing forward predicates... [2018-06-24 20:41:05,693 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:05,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:05,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:41:05,728 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:41:05,728 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:41:05,728 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:41:05,729 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-06-24 20:41:05,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:05,826 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-24 20:41:05,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:41:05,827 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:41:05,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:05,827 INFO ]: With dead ends: 8 [2018-06-24 20:41:05,827 INFO ]: Without dead ends: 8 [2018-06-24 20:41:05,828 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:41:05,828 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:41:05,829 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:41:05,829 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:41:05,829 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 20:41:05,829 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-24 20:41:05,829 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:05,829 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 20:41:05,829 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:41:05,829 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 20:41:05,830 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:41:05,830 INFO ]: Found error trace [2018-06-24 20:41:05,830 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:41:05,830 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:05,830 INFO ]: Analyzing trace with hash 1946444330, now seen corresponding path program 2 times [2018-06-24 20:41:05,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:05,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:05,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:05,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:05,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:05,864 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:05,995 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:05,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:05,995 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:06,001 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:41:06,101 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:41:06,101 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:06,105 INFO ]: Computing forward predicates... [2018-06-24 20:41:06,154 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:06,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:06,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:41:06,178 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:41:06,178 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:41:06,178 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:41:06,178 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-24 20:41:06,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:06,224 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 20:41:06,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:41:06,224 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:41:06,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:06,224 INFO ]: With dead ends: 9 [2018-06-24 20:41:06,224 INFO ]: Without dead ends: 9 [2018-06-24 20:41:06,225 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:41:06,225 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:41:06,226 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:41:06,226 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:41:06,226 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 20:41:06,226 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 20:41:06,226 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:06,226 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 20:41:06,226 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:41:06,226 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 20:41:06,227 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:41:06,227 INFO ]: Found error trace [2018-06-24 20:41:06,227 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 20:41:06,227 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:06,227 INFO ]: Analyzing trace with hash 210011170, now seen corresponding path program 3 times [2018-06-24 20:41:06,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:06,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:06,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:06,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:06,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:06,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:06,418 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:06,418 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:06,418 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:06,427 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:41:06,525 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:41:06,525 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:06,530 INFO ]: Computing forward predicates... [2018-06-24 20:41:06,794 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:06,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:06,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:41:06,821 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:41:06,821 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:41:06,821 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:41:06,821 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-24 20:41:06,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:06,873 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 20:41:06,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:41:06,873 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:41:06,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:06,874 INFO ]: With dead ends: 10 [2018-06-24 20:41:06,874 INFO ]: Without dead ends: 10 [2018-06-24 20:41:06,874 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:41:06,874 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:41:06,875 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:41:06,875 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:41:06,876 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 20:41:06,876 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 20:41:06,876 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:06,876 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 20:41:06,876 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:41:06,876 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 20:41:06,876 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:41:06,876 INFO ]: Found error trace [2018-06-24 20:41:06,876 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:41:06,876 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:06,876 INFO ]: Analyzing trace with hash -2079809238, now seen corresponding path program 4 times [2018-06-24 20:41:06,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:06,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:06,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:06,877 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:06,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:06,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:07,080 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:07,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:07,080 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) [2018-06-24 20:41:07,098 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:07,178 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:07,178 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:07,183 INFO ]: Computing forward predicates... [2018-06-24 20:41:07,374 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:07,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:07,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:41:07,409 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:41:07,410 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:41:07,410 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:41:07,410 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-24 20:41:07,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:07,445 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 20:41:07,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:41:07,445 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:41:07,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:07,446 INFO ]: With dead ends: 11 [2018-06-24 20:41:07,446 INFO ]: Without dead ends: 11 [2018-06-24 20:41:07,446 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:41:07,446 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:41:07,447 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:41:07,447 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:41:07,447 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 20:41:07,447 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 20:41:07,448 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:07,448 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 20:41:07,448 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:41:07,448 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 20:41:07,448 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:41:07,448 INFO ]: Found error trace [2018-06-24 20:41:07,448 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:41:07,448 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:07,448 INFO ]: Analyzing trace with hash -49797854, now seen corresponding path program 5 times [2018-06-24 20:41:07,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:07,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:07,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:07,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:07,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:07,471 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:07,661 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:07,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:07,661 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:07,677 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:41:07,804 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:41:07,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:07,810 INFO ]: Computing forward predicates... [2018-06-24 20:41:08,044 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:08,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:08,063 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:41:08,064 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:41:08,064 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:41:08,064 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:41:08,064 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-24 20:41:08,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:08,136 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 20:41:08,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:41:08,136 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:41:08,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:08,137 INFO ]: With dead ends: 12 [2018-06-24 20:41:08,137 INFO ]: Without dead ends: 12 [2018-06-24 20:41:08,137 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:41:08,137 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:41:08,138 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:41:08,138 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:41:08,139 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 20:41:08,139 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 20:41:08,139 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:08,139 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 20:41:08,139 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:41:08,139 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 20:41:08,140 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:41:08,140 INFO ]: Found error trace [2018-06-24 20:41:08,140 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:41:08,140 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:08,140 INFO ]: Analyzing trace with hash -1543954390, now seen corresponding path program 6 times [2018-06-24 20:41:08,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:08,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:08,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:08,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:08,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:08,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:08,906 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:08,907 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:08,907 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:08,913 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:41:09,007 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:41:09,007 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:09,012 INFO ]: Computing forward predicates... [2018-06-24 20:41:09,208 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:09,229 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:09,229 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:41:09,229 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:41:09,229 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:41:09,229 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:41:09,229 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-24 20:41:09,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:09,302 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 20:41:09,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:41:09,302 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:41:09,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:09,303 INFO ]: With dead ends: 13 [2018-06-24 20:41:09,303 INFO ]: Without dead ends: 13 [2018-06-24 20:41:09,303 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:41:09,303 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:41:09,304 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:41:09,304 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:41:09,305 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 20:41:09,305 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 20:41:09,305 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:09,305 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 20:41:09,305 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:41:09,305 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 20:41:09,305 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:41:09,305 INFO ]: Found error trace [2018-06-24 20:41:09,305 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:41:09,305 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:09,305 INFO ]: Analyzing trace with hash -618166750, now seen corresponding path program 7 times [2018-06-24 20:41:09,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:09,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:09,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:09,306 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:09,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:09,328 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:09,500 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:09,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:09,500 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:09,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:09,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:09,613 INFO ]: Computing forward predicates... [2018-06-24 20:41:09,748 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:09,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:09,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:41:09,767 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:41:09,767 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:41:09,767 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:41:09,768 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-24 20:41:09,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:09,830 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 20:41:09,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:41:09,830 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:41:09,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:09,831 INFO ]: With dead ends: 14 [2018-06-24 20:41:09,831 INFO ]: Without dead ends: 14 [2018-06-24 20:41:09,831 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:41:09,831 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:41:09,832 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:41:09,832 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:41:09,833 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 20:41:09,833 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 20:41:09,833 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:09,833 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 20:41:09,833 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:41:09,833 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 20:41:09,833 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:41:09,833 INFO ]: Found error trace [2018-06-24 20:41:09,833 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 20:41:09,834 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:09,834 INFO ]: Analyzing trace with hash -1983520982, now seen corresponding path program 8 times [2018-06-24 20:41:09,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:09,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:09,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:09,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:09,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:09,860 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:10,507 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:10,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:10,507 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) [2018-06-24 20:41:10,521 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:10,607 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:41:10,607 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:10,613 INFO ]: Computing forward predicates... [2018-06-24 20:41:10,875 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:10,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:10,897 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:41:10,897 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:41:10,897 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:41:10,897 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:41:10,898 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-24 20:41:10,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:10,996 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:41:10,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:41:10,997 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:41:10,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:10,997 INFO ]: With dead ends: 15 [2018-06-24 20:41:10,997 INFO ]: Without dead ends: 15 [2018-06-24 20:41:10,998 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:41:10,998 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:41:10,999 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:41:10,999 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:41:10,999 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 20:41:10,999 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 20:41:10,999 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:10,999 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 20:41:10,999 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:41:10,999 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 20:41:11,000 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:41:11,000 INFO ]: Found error trace [2018-06-24 20:41:11,000 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 20:41:11,000 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:11,000 INFO ]: Analyzing trace with hash -1359829214, now seen corresponding path program 9 times [2018-06-24 20:41:11,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:11,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:11,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:11,001 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:11,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:11,026 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:11,247 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:11,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:11,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:11,253 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:41:11,425 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:41:11,425 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:11,433 INFO ]: Computing forward predicates... [2018-06-24 20:41:11,679 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:11,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:11,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:41:11,701 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:41:11,701 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:41:11,701 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:41:11,701 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-24 20:41:11,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:11,776 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 20:41:11,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:41:11,776 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:41:11,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:11,776 INFO ]: With dead ends: 16 [2018-06-24 20:41:11,776 INFO ]: Without dead ends: 16 [2018-06-24 20:41:11,777 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:41:11,777 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:41:11,778 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:41:11,778 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:41:11,778 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 20:41:11,778 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 20:41:11,778 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:11,778 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 20:41:11,778 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:41:11,778 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 20:41:11,779 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:41:11,779 INFO ]: Found error trace [2018-06-24 20:41:11,779 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 20:41:11,779 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:11,779 INFO ]: Analyzing trace with hash 794746410, now seen corresponding path program 10 times [2018-06-24 20:41:11,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:11,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:11,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:11,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:11,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:11,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:12,046 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:12,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:12,046 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:12,052 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:41:12,164 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:12,164 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:12,176 INFO ]: Computing forward predicates... [2018-06-24 20:41:12,552 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:12,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:12,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:41:12,571 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:41:12,572 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:41:12,572 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:41:12,572 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-24 20:41:12,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:12,639 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 20:41:12,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:41:12,639 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:41:12,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:12,639 INFO ]: With dead ends: 17 [2018-06-24 20:41:12,640 INFO ]: Without dead ends: 17 [2018-06-24 20:41:12,640 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:41:12,640 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:41:12,641 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:41:12,641 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:41:12,642 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 20:41:12,642 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 20:41:12,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:12,642 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 20:41:12,642 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:41:12,642 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 20:41:12,642 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:41:12,642 INFO ]: Found error trace [2018-06-24 20:41:12,642 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 20:41:12,642 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:12,642 INFO ]: Analyzing trace with hash -1132885982, now seen corresponding path program 11 times [2018-06-24 20:41:12,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:12,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:12,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:12,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:12,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:12,668 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:12,950 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:12,950 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:12,950 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:12,956 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:41:13,123 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:41:13,123 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:13,134 INFO ]: Computing forward predicates... [2018-06-24 20:41:14,523 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:14,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:14,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:41:14,543 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:41:14,543 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:41:14,543 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:41:14,544 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-24 20:41:14,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:14,767 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 20:41:14,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:41:14,767 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:41:14,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:14,768 INFO ]: With dead ends: 18 [2018-06-24 20:41:14,768 INFO ]: Without dead ends: 18 [2018-06-24 20:41:14,768 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:41:14,768 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:41:14,769 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:41:14,769 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:41:14,770 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 20:41:14,770 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 20:41:14,770 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:14,770 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 20:41:14,770 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:41:14,770 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 20:41:14,770 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:41:14,770 INFO ]: Found error trace [2018-06-24 20:41:14,770 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 20:41:14,770 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:14,770 INFO ]: Analyzing trace with hash -759947990, now seen corresponding path program 12 times [2018-06-24 20:41:14,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:14,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:14,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:14,771 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:14,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:14,795 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:15,000 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:15,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:15,000 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:15,006 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:41:15,119 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:41:15,119 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:15,126 INFO ]: Computing forward predicates... [2018-06-24 20:41:15,341 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:15,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:15,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:41:15,374 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:41:15,374 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:41:15,374 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:41:15,374 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-24 20:41:15,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:15,754 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 20:41:15,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:41:15,754 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:41:15,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:15,755 INFO ]: With dead ends: 19 [2018-06-24 20:41:15,755 INFO ]: Without dead ends: 19 [2018-06-24 20:41:15,755 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:41:15,755 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:41:15,756 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:41:15,756 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:41:15,757 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 20:41:15,757 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 20:41:15,757 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:15,757 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 20:41:15,757 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:41:15,757 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 20:41:15,757 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:41:15,757 INFO ]: Found error trace [2018-06-24 20:41:15,757 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 20:41:15,757 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:15,757 INFO ]: Analyzing trace with hash -2083772126, now seen corresponding path program 13 times [2018-06-24 20:41:15,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:15,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:15,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:15,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:15,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:15,789 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:16,225 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:16,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:16,226 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:16,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:16,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:16,342 INFO ]: Computing forward predicates... [2018-06-24 20:41:16,574 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:16,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:16,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:41:16,594 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:41:16,594 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:41:16,594 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:41:16,595 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-24 20:41:16,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:16,690 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 20:41:16,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:41:16,690 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:41:16,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:16,690 INFO ]: With dead ends: 20 [2018-06-24 20:41:16,690 INFO ]: Without dead ends: 20 [2018-06-24 20:41:16,691 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:41:16,691 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:41:16,692 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:41:16,692 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:41:16,692 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 20:41:16,693 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 20:41:16,693 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:16,693 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 20:41:16,693 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:41:16,693 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 20:41:16,693 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:41:16,693 INFO ]: Found error trace [2018-06-24 20:41:16,693 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 20:41:16,693 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:16,693 INFO ]: Analyzing trace with hash -172647382, now seen corresponding path program 14 times [2018-06-24 20:41:16,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:16,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:16,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:16,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:16,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:16,724 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:17,592 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:17,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:17,617 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:17,625 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:41:17,737 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:41:17,737 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:17,745 INFO ]: Computing forward predicates... [2018-06-24 20:41:17,994 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:18,013 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:18,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:41:18,014 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:41:18,014 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:41:18,014 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:41:18,014 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-24 20:41:18,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:18,127 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 20:41:18,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:41:18,127 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:41:18,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:18,128 INFO ]: With dead ends: 21 [2018-06-24 20:41:18,128 INFO ]: Without dead ends: 21 [2018-06-24 20:41:18,128 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:41:18,128 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:41:18,130 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:41:18,130 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:41:18,130 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 20:41:18,130 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 20:41:18,130 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:18,130 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 20:41:18,130 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:41:18,130 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 20:41:18,131 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:41:18,131 INFO ]: Found error trace [2018-06-24 20:41:18,131 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 20:41:18,131 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:18,131 INFO ]: Analyzing trace with hash -1057322462, now seen corresponding path program 15 times [2018-06-24 20:41:18,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:18,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:18,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:18,131 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:18,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:18,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:18,477 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:18,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:18,477 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:18,483 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:41:18,628 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:41:18,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:18,636 INFO ]: Computing forward predicates... [2018-06-24 20:41:18,913 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:18,933 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:18,933 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:41:18,933 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:41:18,934 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:41:18,934 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:41:18,934 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-24 20:41:19,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:19,078 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 20:41:19,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:41:19,078 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:41:19,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:19,078 INFO ]: With dead ends: 22 [2018-06-24 20:41:19,078 INFO ]: Without dead ends: 22 [2018-06-24 20:41:19,079 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 14 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:41:19,079 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:41:19,081 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:41:19,081 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:41:19,081 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 20:41:19,081 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 20:41:19,081 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:19,081 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 20:41:19,081 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:41:19,081 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 20:41:19,082 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:41:19,082 INFO ]: Found error trace [2018-06-24 20:41:19,082 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 20:41:19,082 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:19,082 INFO ]: Analyzing trace with hash 1582521130, now seen corresponding path program 16 times [2018-06-24 20:41:19,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:19,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:19,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:19,083 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:19,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:19,117 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:19,442 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:19,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:19,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:19,448 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:41:19,570 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:19,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:19,583 INFO ]: Computing forward predicates... [2018-06-24 20:41:19,813 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:19,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:19,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:41:19,844 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:41:19,844 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:41:19,845 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:41:19,845 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-24 20:41:20,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:20,029 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 20:41:20,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:41:20,029 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:41:20,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:20,030 INFO ]: With dead ends: 23 [2018-06-24 20:41:20,030 INFO ]: Without dead ends: 23 [2018-06-24 20:41:20,030 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:41:20,030 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:41:20,032 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:41:20,032 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:41:20,032 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 20:41:20,032 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 20:41:20,032 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:20,032 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 20:41:20,032 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:41:20,032 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 20:41:20,033 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:41:20,033 INFO ]: Found error trace [2018-06-24 20:41:20,033 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 20:41:20,033 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:20,033 INFO ]: Analyzing trace with hash 1813293858, now seen corresponding path program 17 times [2018-06-24 20:41:20,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:20,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:20,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:20,034 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:20,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:20,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:20,360 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:20,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:20,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:20,365 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:41:20,556 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:41:20,556 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:20,582 INFO ]: Computing forward predicates... [2018-06-24 20:41:21,496 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:21,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:21,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:41:21,518 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:41:21,518 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:41:21,518 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:41:21,518 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-24 20:41:21,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:21,692 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 20:41:21,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:41:21,694 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:41:21,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:21,695 INFO ]: With dead ends: 24 [2018-06-24 20:41:21,695 INFO ]: Without dead ends: 24 [2018-06-24 20:41:21,695 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 16 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:41:21,695 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:41:21,696 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:41:21,696 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:41:21,697 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 20:41:21,697 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 20:41:21,697 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:21,697 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 20:41:21,697 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:41:21,697 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 20:41:21,697 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:41:21,697 INFO ]: Found error trace [2018-06-24 20:41:21,697 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 20:41:21,697 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:21,697 INFO ]: Analyzing trace with hash 377313834, now seen corresponding path program 18 times [2018-06-24 20:41:21,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:21,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:21,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:21,698 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:21,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:21,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:22,272 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:22,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:22,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:22,285 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:41:22,450 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:41:22,450 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:22,467 INFO ]: Computing forward predicates... [2018-06-24 20:41:22,792 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:22,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:22,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:41:22,821 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:41:22,821 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:41:22,821 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:41:22,821 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-24 20:41:23,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:23,027 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 20:41:23,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:41:23,027 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:41:23,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:23,027 INFO ]: With dead ends: 25 [2018-06-24 20:41:23,027 INFO ]: Without dead ends: 25 [2018-06-24 20:41:23,028 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 17 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:41:23,028 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:41:23,029 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:41:23,029 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:41:23,029 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 20:41:23,029 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 20:41:23,030 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:23,030 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 20:41:23,030 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:41:23,030 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 20:41:23,030 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:41:23,030 INFO ]: Found error trace [2018-06-24 20:41:23,030 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 20:41:23,030 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:23,030 INFO ]: Analyzing trace with hash -1188393950, now seen corresponding path program 19 times [2018-06-24 20:41:23,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:23,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:23,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:23,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:23,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:23,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:23,427 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:23,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:23,428 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:23,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:23,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:23,593 INFO ]: Computing forward predicates... [2018-06-24 20:41:23,936 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:23,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:23,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:41:23,956 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:41:23,956 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:41:23,956 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:41:23,956 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-24 20:41:24,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:24,139 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 20:41:24,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:41:24,142 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:41:24,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:24,142 INFO ]: With dead ends: 26 [2018-06-24 20:41:24,142 INFO ]: Without dead ends: 26 [2018-06-24 20:41:24,143 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:41:24,143 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:41:24,144 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:41:24,144 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:41:24,145 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 20:41:24,145 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 20:41:24,145 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:24,145 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 20:41:24,145 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:41:24,145 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 20:41:24,145 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:41:24,145 INFO ]: Found error trace [2018-06-24 20:41:24,145 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 20:41:24,145 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:24,145 INFO ]: Analyzing trace with hash 1814272298, now seen corresponding path program 20 times [2018-06-24 20:41:24,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:24,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:24,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:24,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:24,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:24,177 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:24,590 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:24,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:24,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:24,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:41:24,746 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:41:24,746 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:24,756 INFO ]: Computing forward predicates... [2018-06-24 20:41:25,460 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:25,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:25,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:41:25,481 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:41:25,481 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:41:25,481 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:41:25,481 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-24 20:41:25,698 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:25,698 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 20:41:25,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:41:25,698 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:41:25,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:25,698 INFO ]: With dead ends: 27 [2018-06-24 20:41:25,698 INFO ]: Without dead ends: 27 [2018-06-24 20:41:25,699 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:41:25,699 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:41:25,700 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:41:25,700 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:41:25,701 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 20:41:25,701 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 20:41:25,701 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:25,701 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 20:41:25,701 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:41:25,701 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 20:41:25,701 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:41:25,701 INFO ]: Found error trace [2018-06-24 20:41:25,701 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 20:41:25,701 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:25,702 INFO ]: Analyzing trace with hash 407645474, now seen corresponding path program 21 times [2018-06-24 20:41:25,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:25,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:25,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:25,702 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:25,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:25,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:26,088 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:26,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:26,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:26,095 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:41:26,330 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:41:26,330 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:26,341 INFO ]: Computing forward predicates... [2018-06-24 20:41:26,694 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:26,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:26,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:41:26,715 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:41:26,715 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:41:26,715 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:41:26,716 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-24 20:41:27,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:27,011 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 20:41:27,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:41:27,015 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:41:27,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:27,015 INFO ]: With dead ends: 28 [2018-06-24 20:41:27,015 INFO ]: Without dead ends: 28 [2018-06-24 20:41:27,016 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 20 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:41:27,016 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:41:27,017 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:41:27,017 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:41:27,018 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 20:41:27,018 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 20:41:27,018 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:27,018 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 20:41:27,018 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:41:27,018 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 20:41:27,018 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:41:27,018 INFO ]: Found error trace [2018-06-24 20:41:27,018 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 20:41:27,018 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:27,019 INFO ]: Analyzing trace with hash -248113110, now seen corresponding path program 22 times [2018-06-24 20:41:27,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:27,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:27,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:27,019 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:27,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:27,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:27,379 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:27,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:27,379 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:27,384 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:41:27,545 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:27,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:27,565 INFO ]: Computing forward predicates... [2018-06-24 20:41:27,947 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:27,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:27,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:41:27,967 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:41:27,967 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:41:27,967 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:41:27,967 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-24 20:41:28,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:28,709 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 20:41:28,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:41:28,712 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:41:28,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:28,712 INFO ]: With dead ends: 29 [2018-06-24 20:41:28,712 INFO ]: Without dead ends: 29 [2018-06-24 20:41:28,713 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 21 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:41:28,713 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:41:28,715 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:41:28,715 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:41:28,716 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:41:28,716 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 20:41:28,716 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:28,716 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:41:28,716 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:41:28,716 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:41:28,716 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:41:28,716 INFO ]: Found error trace [2018-06-24 20:41:28,716 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 20:41:28,717 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:28,717 INFO ]: Analyzing trace with hash 898207266, now seen corresponding path program 23 times [2018-06-24 20:41:28,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:28,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:28,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:28,717 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:28,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:28,752 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:29,510 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:29,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:29,510 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:29,515 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:41:29,745 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:41:29,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:29,787 INFO ]: Computing forward predicates... [2018-06-24 20:41:30,228 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:30,248 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:30,248 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 20:41:30,248 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:41:30,248 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:41:30,249 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:41:30,249 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-24 20:41:30,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:30,613 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 20:41:30,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:41:30,613 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:41:30,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:30,613 INFO ]: With dead ends: 30 [2018-06-24 20:41:30,613 INFO ]: Without dead ends: 30 [2018-06-24 20:41:30,613 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 22 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:41:30,613 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:41:30,615 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:41:30,615 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:41:30,617 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 20:41:30,617 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 20:41:30,617 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:30,617 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 20:41:30,617 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:41:30,617 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 20:41:30,617 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:41:30,617 INFO ]: Found error trace [2018-06-24 20:41:30,617 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-24 20:41:30,617 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:30,618 INFO ]: Analyzing trace with hash 2074400554, now seen corresponding path program 24 times [2018-06-24 20:41:30,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:30,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:30,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:30,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:30,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:30,650 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:31,007 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:31,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:31,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:31,012 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:41:31,246 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-24 20:41:31,246 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:31,263 INFO ]: Computing forward predicates... [2018-06-24 20:41:31,863 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:31,884 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:31,884 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-24 20:41:31,884 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:41:31,884 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:41:31,884 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:41:31,884 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-24 20:41:32,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:32,173 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 20:41:32,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:41:32,174 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 20:41:32,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:32,174 INFO ]: With dead ends: 31 [2018-06-24 20:41:32,174 INFO ]: Without dead ends: 31 [2018-06-24 20:41:32,174 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 23 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:41:32,174 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:41:32,176 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:41:32,176 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:41:32,176 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 20:41:32,176 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 20:41:32,177 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:32,177 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 20:41:32,177 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:41:32,177 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 20:41:32,177 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:41:32,177 INFO ]: Found error trace [2018-06-24 20:41:32,177 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-24 20:41:32,177 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:32,177 INFO ]: Analyzing trace with hash -118313182, now seen corresponding path program 25 times [2018-06-24 20:41:32,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:32,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:32,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:32,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:32,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:32,214 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:33,473 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:33,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:33,473 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:33,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:33,690 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:33,715 INFO ]: Computing forward predicates... [2018-06-24 20:41:34,186 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:34,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:34,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-24 20:41:34,207 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:41:34,207 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:41:34,208 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:41:34,208 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-24 20:41:34,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:34,504 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 20:41:34,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:41:34,504 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-24 20:41:34,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:34,505 INFO ]: With dead ends: 32 [2018-06-24 20:41:34,505 INFO ]: Without dead ends: 32 [2018-06-24 20:41:34,505 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 24 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:41:34,505 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:41:34,507 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:41:34,507 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:41:34,507 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 20:41:34,507 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 20:41:34,507 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:34,507 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 20:41:34,507 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:41:34,507 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 20:41:34,508 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:41:34,508 INFO ]: Found error trace [2018-06-24 20:41:34,508 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-24 20:41:34,508 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:34,508 INFO ]: Analyzing trace with hash 627037738, now seen corresponding path program 26 times [2018-06-24 20:41:34,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:34,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:34,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:34,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:34,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:34,551 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:35,183 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:35,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:35,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:35,196 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:41:35,393 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:41:35,393 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:35,407 INFO ]: Computing forward predicates... [2018-06-24 20:41:36,144 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:36,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:36,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 20:41:36,164 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:41:36,165 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:41:36,165 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:41:36,165 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-24 20:41:36,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:36,488 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 20:41:36,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:41:36,492 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:41:36,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:36,492 INFO ]: With dead ends: 33 [2018-06-24 20:41:36,492 INFO ]: Without dead ends: 33 [2018-06-24 20:41:36,493 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 25 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:41:36,493 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:41:36,495 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:41:36,495 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:41:36,495 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 20:41:36,495 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 20:41:36,495 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:36,495 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 20:41:36,495 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:41:36,495 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 20:41:36,501 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:41:36,501 INFO ]: Found error trace [2018-06-24 20:41:36,501 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-24 20:41:36,501 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:36,501 INFO ]: Analyzing trace with hash -2036887518, now seen corresponding path program 27 times [2018-06-24 20:41:36,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:36,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:36,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:36,501 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:36,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:36,550 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:37,242 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:37,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:37,242 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:37,248 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:41:37,540 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 20:41:37,540 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:37,561 INFO ]: Computing forward predicates... [2018-06-24 20:41:38,516 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:38,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:38,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-24 20:41:38,538 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:41:38,538 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:41:38,538 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:41:38,539 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-24 20:41:38,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:38,892 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 20:41:38,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:41:38,893 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-24 20:41:38,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:38,893 INFO ]: With dead ends: 34 [2018-06-24 20:41:38,893 INFO ]: Without dead ends: 34 [2018-06-24 20:41:38,894 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 26 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:41:38,894 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:41:38,895 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:41:38,895 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:41:38,896 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 20:41:38,896 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 20:41:38,896 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:38,896 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 20:41:38,896 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:41:38,896 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 20:41:38,896 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:41:38,896 INFO ]: Found error trace [2018-06-24 20:41:38,897 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-24 20:41:38,897 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:38,897 INFO ]: Analyzing trace with hash 1280775466, now seen corresponding path program 28 times [2018-06-24 20:41:38,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:38,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:38,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:38,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:38,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:38,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:40,055 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:40,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:40,056 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:40,061 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:41:40,260 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:40,260 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:40,289 INFO ]: Computing forward predicates... [2018-06-24 20:41:40,812 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:40,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:40,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-24 20:41:40,833 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:41:40,833 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:41:40,833 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:41:40,833 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-24 20:41:41,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:41,209 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 20:41:41,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:41:41,209 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 20:41:41,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:41,209 INFO ]: With dead ends: 35 [2018-06-24 20:41:41,209 INFO ]: Without dead ends: 35 [2018-06-24 20:41:41,210 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 27 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:41:41,210 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:41:41,211 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:41:41,211 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:41:41,212 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 20:41:41,212 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 20:41:41,212 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:41,212 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 20:41:41,212 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:41:41,212 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 20:41:41,212 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:41:41,212 INFO ]: Found error trace [2018-06-24 20:41:41,212 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-24 20:41:41,212 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:41,213 INFO ]: Analyzing trace with hash 1049112866, now seen corresponding path program 29 times [2018-06-24 20:41:41,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:41,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:41,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:41,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:41,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:41,267 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:42,515 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:42,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:42,515 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:42,521 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:41:42,867 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 20:41:42,867 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:42,932 INFO ]: Computing forward predicates... [2018-06-24 20:41:43,488 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:43,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:43,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-24 20:41:43,509 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:41:43,509 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:41:43,509 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:41:43,510 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-24 20:41:43,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:43,896 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 20:41:43,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:41:43,896 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-24 20:41:43,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:43,897 INFO ]: With dead ends: 36 [2018-06-24 20:41:43,897 INFO ]: Without dead ends: 36 [2018-06-24 20:41:43,897 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 28 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:41:43,897 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:41:43,899 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:41:43,899 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:41:43,899 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 20:41:43,899 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 20:41:43,899 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:43,899 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 20:41:43,899 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:41:43,899 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 20:41:43,900 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:41:43,900 INFO ]: Found error trace [2018-06-24 20:41:43,900 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-24 20:41:43,900 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:43,900 INFO ]: Analyzing trace with hash -1837460438, now seen corresponding path program 30 times [2018-06-24 20:41:43,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:43,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:43,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:43,900 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:43,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:43,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:44,475 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:44,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:44,475 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:44,480 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:41:44,782 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-24 20:41:44,783 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:44,802 INFO ]: Computing forward predicates... [2018-06-24 20:41:45,482 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:45,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:45,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-24 20:41:45,504 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:41:45,504 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:41:45,504 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:41:45,505 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-24 20:41:45,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:45,919 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 20:41:45,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:41:45,920 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 20:41:45,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:45,920 INFO ]: With dead ends: 37 [2018-06-24 20:41:45,920 INFO ]: Without dead ends: 37 [2018-06-24 20:41:45,920 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 29 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:41:45,920 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:41:45,922 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:41:45,922 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:41:45,922 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 20:41:45,922 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 20:41:45,922 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:45,922 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 20:41:45,922 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:41:45,922 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 20:41:45,922 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:41:45,922 INFO ]: Found error trace [2018-06-24 20:41:45,922 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-24 20:41:45,923 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:45,923 INFO ]: Analyzing trace with hash -1126919646, now seen corresponding path program 31 times [2018-06-24 20:41:45,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:45,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:45,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:45,923 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:45,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:45,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:46,634 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:46,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:46,634 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:46,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:46,860 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:46,895 INFO ]: Computing forward predicates... [2018-06-24 20:41:47,607 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:47,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:47,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-24 20:41:47,629 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:41:47,629 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:41:47,630 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:41:47,630 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-24 20:41:48,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:48,075 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 20:41:48,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:41:48,076 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-24 20:41:48,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:48,076 INFO ]: With dead ends: 38 [2018-06-24 20:41:48,076 INFO ]: Without dead ends: 38 [2018-06-24 20:41:48,076 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 30 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:41:48,076 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:41:48,078 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:41:48,078 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:41:48,078 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 20:41:48,078 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 20:41:48,078 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:48,078 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 20:41:48,078 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:41:48,078 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 20:41:48,079 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:41:48,079 INFO ]: Found error trace [2018-06-24 20:41:48,079 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-24 20:41:48,079 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:48,079 INFO ]: Analyzing trace with hash -574991574, now seen corresponding path program 32 times [2018-06-24 20:41:48,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:48,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:48,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:48,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:41:48,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:48,122 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:48,891 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:48,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:48,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:48,897 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:41:49,135 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:41:49,135 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:49,154 INFO ]: Computing forward predicates... [2018-06-24 20:41:50,335 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:50,357 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:50,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-24 20:41:50,358 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:41:50,358 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:41:50,358 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:41:50,359 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-24 20:41:50,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:50,849 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 20:41:50,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:41:50,849 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 20:41:50,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:50,850 INFO ]: With dead ends: 39 [2018-06-24 20:41:50,850 INFO ]: Without dead ends: 39 [2018-06-24 20:41:50,850 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 31 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:41:50,850 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:41:50,852 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:41:50,852 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:41:50,852 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 20:41:50,852 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 20:41:50,852 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:50,852 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 20:41:50,852 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:41:50,852 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 20:41:50,853 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:41:50,853 INFO ]: Found error trace [2018-06-24 20:41:50,853 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-24 20:41:50,853 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:50,853 INFO ]: Analyzing trace with hash -645090526, now seen corresponding path program 33 times [2018-06-24 20:41:50,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:50,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:50,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:50,854 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:50,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:50,926 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:51,854 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:51,854 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:51,854 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:51,859 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:41:52,259 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 20:41:52,259 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:52,279 INFO ]: Computing forward predicates... [2018-06-24 20:41:53,043 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:53,064 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:53,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-24 20:41:53,064 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:41:53,064 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:41:53,064 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:41:53,064 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-24 20:41:53,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:53,554 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 20:41:53,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:41:53,555 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-24 20:41:53,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:53,555 INFO ]: With dead ends: 40 [2018-06-24 20:41:53,555 INFO ]: Without dead ends: 40 [2018-06-24 20:41:53,555 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 32 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:41:53,555 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:41:53,556 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:41:53,556 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:41:53,557 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 20:41:53,557 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 20:41:53,557 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:53,557 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 20:41:53,557 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:41:53,557 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 20:41:53,557 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:41:53,557 INFO ]: Found error trace [2018-06-24 20:41:53,557 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-24 20:41:53,557 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:53,558 INFO ]: Analyzing trace with hash 1476809258, now seen corresponding path program 34 times [2018-06-24 20:41:53,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:53,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:53,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:53,558 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:53,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:53,602 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:54,503 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:54,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:54,503 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:54,508 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:41:54,751 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:41:54,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:54,792 INFO ]: Computing forward predicates... [2018-06-24 20:41:55,735 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:55,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:55,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-24 20:41:55,756 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:41:55,756 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:41:55,756 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:41:55,756 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-24 20:41:56,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:56,281 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-24 20:41:56,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:41:56,281 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 20:41:56,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:56,281 INFO ]: With dead ends: 41 [2018-06-24 20:41:56,281 INFO ]: Without dead ends: 41 [2018-06-24 20:41:56,281 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:41:56,281 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:41:56,282 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:41:56,282 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:41:56,283 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-24 20:41:56,283 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-24 20:41:56,283 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:56,283 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-24 20:41:56,283 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:41:56,283 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-24 20:41:56,283 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:41:56,283 INFO ]: Found error trace [2018-06-24 20:41:56,283 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-24 20:41:56,283 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:56,283 INFO ]: Analyzing trace with hash -1463774174, now seen corresponding path program 35 times [2018-06-24 20:41:56,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:56,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:56,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:56,283 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:56,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:56,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:57,447 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:57,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:41:57,447 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:41:57,453 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:41:57,912 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 20:41:57,912 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:41:57,987 INFO ]: Computing forward predicates... [2018-06-24 20:41:58,816 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:41:58,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:41:58,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-24 20:41:58,839 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:41:58,839 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:41:58,839 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:41:58,839 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-06-24 20:41:59,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:41:59,446 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-24 20:41:59,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:41:59,446 INFO ]: Start accepts. Automaton has 38 states. Word has length 40 [2018-06-24 20:41:59,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:41:59,446 INFO ]: With dead ends: 42 [2018-06-24 20:41:59,446 INFO ]: Without dead ends: 42 [2018-06-24 20:41:59,446 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 34 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:41:59,446 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:41:59,447 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 20:41:59,447 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:41:59,447 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-24 20:41:59,447 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-24 20:41:59,447 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:41:59,447 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-24 20:41:59,447 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:41:59,447 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-24 20:41:59,448 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:41:59,448 INFO ]: Found error trace [2018-06-24 20:41:59,448 INFO ]: trace histogram [36, 1, 1, 1, 1, 1] [2018-06-24 20:41:59,448 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:41:59,448 INFO ]: Analyzing trace with hash 1867419946, now seen corresponding path program 36 times [2018-06-24 20:41:59,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:41:59,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:41:59,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:59,448 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:41:59,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:41:59,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:00,245 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:00,246 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:42:00,246 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:42:00,251 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:42:00,851 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-24 20:42:00,851 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:42:00,891 INFO ]: Computing forward predicates... [2018-06-24 20:42:01,714 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:42:01,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:42:01,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-24 20:42:01,736 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:42:01,737 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:42:01,737 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:42:01,737 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. Received shutdown request... [2018-06-24 20:42:01,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:42:01,984 WARN ]: Verification canceled [2018-06-24 20:42:01,987 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:42:01,987 WARN ]: Timeout [2018-06-24 20:42:01,988 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:42:01 BasicIcfg [2018-06-24 20:42:01,988 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:42:01,988 INFO ]: Toolchain (without parser) took 57876.70 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 795.9 MB). Free memory was 257.7 MB in the beginning and 467.6 MB in the end (delta: -209.9 MB). Peak memory consumption was 586.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:42:01,989 INFO ]: SmtParser took 0.07 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 20:42:01,989 INFO ]: ChcToBoogie took 90.68 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:42:01,990 INFO ]: Boogie Preprocessor took 67.34 ms. Allocated memory is still 309.3 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:42:01,990 INFO ]: RCFGBuilder took 303.96 ms. Allocated memory is still 309.3 MB. Free memory was 253.8 MB in the beginning and 235.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:42:01,990 INFO ]: BlockEncodingV2 took 325.16 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 215.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:42:01,991 INFO ]: TraceAbstraction took 57078.91 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 795.9 MB). Free memory was 213.8 MB in the beginning and 467.6 MB in the end (delta: -253.8 MB). Peak memory consumption was 542.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:42:01,996 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 25 locations, 25 edges - StatisticsResult: Encoded RCFG 6 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 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 90.68 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.34 ms. Allocated memory is still 309.3 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 303.96 ms. Allocated memory is still 309.3 MB. Free memory was 253.8 MB in the beginning and 235.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 325.16 ms. Allocated memory is still 309.3 MB. Free memory was 235.8 MB in the beginning and 215.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57078.91 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 795.9 MB). Free memory was 213.8 MB in the beginning and 467.6 MB in the end (delta: -253.8 MB). Peak memory consumption was 542.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (42states) and interpolant automaton (currently 18 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (17 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.0s OverallTime, 37 OverallIterations, 36 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 0 SDslu, 2035 SDs, 0 SdLazy, 18129 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1587 GetRequests, 254 SyntacticMatches, 630 SemanticMatches, 703 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 37.8s InterpolantComputationTime, 1697 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 262 NumberOfCheckSat, 1624 ConstructedInterpolants, 0 QuantifiedInterpolants, 311672 SizeOfPredicates, 4608 NumberOfNonLiveVariables, 55494 ConjunctsInSsa, 7272 ConjunctsInUnsatCore, 73 InterpolantComputations, 1 PerfectInterpolantSequences, 0/16872 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-42-02-009.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-42-02-009.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-42-02-009.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/23.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-42-02-009.csv Completed graceful shutdown