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/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:39:39,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:39:39,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:39:39,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:39:39,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:39:39,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:39:39,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:39:39,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:39:39,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:39:39,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:39:39,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:39:39,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:39:39,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:39:39,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:39:39,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:39:39,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:39:39,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:39:39,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:39:39,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:39:39,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:39:39,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:39:39,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:39:39,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:39:39,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:39:39,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:39:39,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:39:39,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:39:39,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:39:39,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:39:39,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:39:39,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:39:39,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:39:39,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:39:39,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:39:39,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:39:39,573 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:39:39,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:39:39,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:39:39,594 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:39:39,596 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:39:39,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:39:39,597 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:39:39,597 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:39:39,598 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:39:39,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:39:39,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:39:39,598 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:39:39,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:39:39,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:39:39,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:39:39,599 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:39:39,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:39:39,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:39:39,600 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:39:39,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:39:39,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:39:39,602 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:39:39,604 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:39:39,604 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:39:39,651 INFO ]: Repository-Root is: /tmp [2018-06-25 00:39:39,667 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:39:39,672 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:39:39,674 INFO ]: Initializing SmtParser... [2018-06-25 00:39:39,674 INFO ]: SmtParser initialized [2018-06-25 00:39:39,675 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 [2018-06-25 00:39:39,676 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-25 00:39:39,752 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 unknown [2018-06-25 00:39:39,901 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v1.smt2 [2018-06-25 00:39:39,906 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:39:39,912 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:39:39,912 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:39:39,912 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:39:39,912 INFO ]: ChcToBoogie initialized [2018-06-25 00:39:39,916 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:39,972 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39 Unit [2018-06-25 00:39:39,972 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:39:39,973 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:39:39,973 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:39:39,973 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:39:39,993 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:39,993 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:39,998 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:39,998 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:40,002 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:40,004 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:40,005 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... [2018-06-25 00:39:40,006 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:39:40,010 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:39:40,010 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:39:40,010 INFO ]: RCFGBuilder initialized [2018-06-25 00:39:40,011 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:39:40,025 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:39:40,025 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:39:40,025 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:39:40,025 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:39:40,025 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:39:40,025 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:39:40,264 INFO ]: Using library mode [2018-06-25 00:39:40,264 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:39:40 BoogieIcfgContainer [2018-06-25 00:39:40,264 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:39:40,265 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:39:40,265 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:39:40,271 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:39:40,271 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:39:40" (1/1) ... [2018-06-25 00:39:40,297 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:39:40,298 INFO ]: Using Remove infeasible edges [2018-06-25 00:39:40,299 INFO ]: Using Maximize final states [2018-06-25 00:39:40,299 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:39:40,300 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:39:40,301 INFO ]: Using Remove sink states [2018-06-25 00:39:40,302 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:39:40,302 INFO ]: Using Use SBE [2018-06-25 00:39:40,329 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 00:39:40,348 INFO ]: SBE split 2 edges [2018-06-25 00:39:40,359 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:39:40,361 INFO ]: 0 new accepting states [2018-06-25 00:39:40,433 INFO ]: Removed 5 edges and 2 locations by large block encoding [2018-06-25 00:39:40,435 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:39:40,436 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:39:40,436 INFO ]: 0 new accepting states [2018-06-25 00:39:40,436 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:39:40,436 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:39:40,436 INFO ]: Encoded RCFG 6 locations, 13 edges [2018-06-25 00:39:40,437 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:39:40 BasicIcfg [2018-06-25 00:39:40,437 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:39:40,438 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:39:40,438 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:39:40,441 INFO ]: TraceAbstraction initialized [2018-06-25 00:39:40,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:39:39" (1/4) ... [2018-06-25 00:39:40,443 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741bb48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:39:40, skipping insertion in model container [2018-06-25 00:39:40,443 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:39:39" (2/4) ... [2018-06-25 00:39:40,443 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741bb48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:39:40, skipping insertion in model container [2018-06-25 00:39:40,443 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:39:40" (3/4) ... [2018-06-25 00:39:40,444 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741bb48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:39:40, skipping insertion in model container [2018-06-25 00:39:40,444 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:39:40" (4/4) ... [2018-06-25 00:39:40,445 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:39:40,452 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:39:40,458 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:39:40,496 INFO ]: Using default assertion order modulation [2018-06-25 00:39:40,497 INFO ]: Interprodecural is true [2018-06-25 00:39:40,497 INFO ]: Hoare is false [2018-06-25 00:39:40,497 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:39:40,497 INFO ]: Backedges is TWOTRACK [2018-06-25 00:39:40,497 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:39:40,497 INFO ]: Difference is false [2018-06-25 00:39:40,497 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:39:40,497 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:39:40,505 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:39:40,515 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:39:40,515 INFO ]: Found error trace [2018-06-25 00:39:40,516 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:39:40,516 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:40,520 INFO ]: Analyzing trace with hash 35680291, now seen corresponding path program 1 times [2018-06-25 00:39:40,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:40,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:40,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:40,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:40,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:40,599 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:40,672 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:40,675 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:39:40,675 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:39:40,676 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:39:40,695 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:39:40,695 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:39:40,697 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:39:40,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:40,859 INFO ]: Finished difference Result 7 states and 16 transitions. [2018-06-25 00:39:40,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:39:40,861 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:39:40,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:40,869 INFO ]: With dead ends: 7 [2018-06-25 00:39:40,869 INFO ]: Without dead ends: 7 [2018-06-25 00:39:40,871 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-25 00:39:40,887 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:39:40,903 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:39:40,904 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:39:40,905 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-06-25 00:39:40,906 INFO ]: Start accepts. Automaton has 7 states and 16 transitions. Word has length 5 [2018-06-25 00:39:40,907 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:40,907 INFO ]: Abstraction has 7 states and 16 transitions. [2018-06-25 00:39:40,907 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:39:40,907 INFO ]: Start isEmpty. Operand 7 states and 16 transitions. [2018-06-25 00:39:40,907 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:39:40,907 INFO ]: Found error trace [2018-06-25 00:39:40,907 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:39:40,907 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:40,907 INFO ]: Analyzing trace with hash 35710082, now seen corresponding path program 1 times [2018-06-25 00:39:40,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:40,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:40,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:40,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:40,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:40,916 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:40,941 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:40,941 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:39:40,941 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:39:40,942 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:39:40,942 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:39:40,942 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:39:40,942 INFO ]: Start difference. First operand 7 states and 16 transitions. Second operand 3 states. [2018-06-25 00:39:41,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:41,027 INFO ]: Finished difference Result 8 states and 21 transitions. [2018-06-25 00:39:41,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:39:41,027 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:39:41,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:41,027 INFO ]: With dead ends: 8 [2018-06-25 00:39:41,027 INFO ]: Without dead ends: 8 [2018-06-25 00:39:41,028 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-25 00:39:41,028 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:39:41,030 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:39:41,030 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:39:41,030 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 00:39:41,030 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 5 [2018-06-25 00:39:41,030 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:41,030 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 00:39:41,030 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:39:41,030 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 00:39:41,031 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:39:41,031 INFO ]: Found error trace [2018-06-25 00:39:41,031 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:39:41,031 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:41,031 INFO ]: Analyzing trace with hash 1105832593, now seen corresponding path program 1 times [2018-06-25 00:39:41,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:41,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:41,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:41,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:41,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:41,042 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:41,088 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:41,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:41,088 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-25 00:39:41,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:41,119 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:41,126 INFO ]: Computing forward predicates... [2018-06-25 00:39:41,150 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:41,170 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:41,170 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:39:41,170 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:39:41,170 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:39:41,171 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:39:41,171 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 5 states. [2018-06-25 00:39:41,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:41,507 INFO ]: Finished difference Result 10 states and 31 transitions. [2018-06-25 00:39:41,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:39:41,507 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:39:41,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:41,508 INFO ]: With dead ends: 10 [2018-06-25 00:39:41,508 INFO ]: Without dead ends: 10 [2018-06-25 00:39:41,508 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:39:41,508 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:39:41,510 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 00:39:41,510 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:39:41,510 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-25 00:39:41,510 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 6 [2018-06-25 00:39:41,510 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:41,510 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-25 00:39:41,510 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:39:41,511 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-25 00:39:41,512 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:39:41,512 INFO ]: Found error trace [2018-06-25 00:39:41,512 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:39:41,512 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:41,512 INFO ]: Analyzing trace with hash 1106905069, now seen corresponding path program 1 times [2018-06-25 00:39:41,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:41,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:41,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:41,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:41,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:41,521 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:41,573 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:41,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:41,573 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-25 00:39:41,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:41,597 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:41,598 INFO ]: Computing forward predicates... [2018-06-25 00:39:41,626 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:41,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:41,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 00:39:41,646 INFO ]: Interpolant automaton has 5 states [2018-06-25 00:39:41,646 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 00:39:41,646 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:39:41,646 INFO ]: Start difference. First operand 9 states and 26 transitions. Second operand 5 states. [2018-06-25 00:39:41,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:41,888 INFO ]: Finished difference Result 11 states and 36 transitions. [2018-06-25 00:39:41,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:39:41,889 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 00:39:41,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:41,889 INFO ]: With dead ends: 11 [2018-06-25 00:39:41,889 INFO ]: Without dead ends: 11 [2018-06-25 00:39:41,890 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 00:39:41,890 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:39:41,891 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-25 00:39:41,891 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:39:41,892 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-25 00:39:41,892 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 6 [2018-06-25 00:39:41,892 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:41,892 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-25 00:39:41,892 INFO ]: Interpolant automaton has 5 states. [2018-06-25 00:39:41,892 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-25 00:39:41,892 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:39:41,892 INFO ]: Found error trace [2018-06-25 00:39:41,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:41,892 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:41,892 INFO ]: Analyzing trace with hash -79035458, now seen corresponding path program 1 times [2018-06-25 00:39:41,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:41,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:41,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:41,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:41,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:41,911 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:41,960 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:41,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:41,960 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-25 00:39:41,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:41,996 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:41,997 INFO ]: Computing forward predicates... [2018-06-25 00:39:42,045 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:42,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:42,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 00:39:42,065 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:39:42,065 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:39:42,065 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:42,065 INFO ]: Start difference. First operand 9 states and 26 transitions. Second operand 7 states. [2018-06-25 00:39:42,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:42,504 INFO ]: Finished difference Result 13 states and 46 transitions. [2018-06-25 00:39:42,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:39:42,504 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 00:39:42,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:42,505 INFO ]: With dead ends: 13 [2018-06-25 00:39:42,505 INFO ]: Without dead ends: 13 [2018-06-25 00:39:42,505 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:42,505 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:39:42,507 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-25 00:39:42,507 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:39:42,508 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 00:39:42,508 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 7 [2018-06-25 00:39:42,508 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:42,508 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 00:39:42,508 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:39:42,508 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 00:39:42,508 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:39:42,508 INFO ]: Found error trace [2018-06-25 00:39:42,508 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:39:42,508 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:42,508 INFO ]: Analyzing trace with hash -79184413, now seen corresponding path program 2 times [2018-06-25 00:39:42,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:42,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:42,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:42,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:42,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:42,519 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:42,719 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:42,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:42,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:39:42,727 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:39:42,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:39:42,740 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:42,742 INFO ]: Computing forward predicates... [2018-06-25 00:39:42,796 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:42,817 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:42,817 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:39:42,817 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:39:42,818 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:39:42,818 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:39:42,818 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 6 states. [2018-06-25 00:39:42,908 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:42,909 INFO ]: Finished difference Result 13 states and 46 transitions. [2018-06-25 00:39:42,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:39:42,909 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:39:42,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:42,910 INFO ]: With dead ends: 13 [2018-06-25 00:39:42,910 INFO ]: Without dead ends: 13 [2018-06-25 00:39:42,910 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:39:42,910 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:39:42,912 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-25 00:39:42,912 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:39:42,912 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 00:39:42,912 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 7 [2018-06-25 00:39:42,912 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:42,912 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 00:39:42,912 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:39:42,912 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 00:39:42,913 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:39:42,913 INFO ]: Found error trace [2018-06-25 00:39:42,913 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 00:39:42,913 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:42,913 INFO ]: Analyzing trace with hash -45788702, now seen corresponding path program 2 times [2018-06-25 00:39:42,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:42,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:42,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:42,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:42,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:42,932 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:42,978 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:42,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:42,978 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-25 00:39:42,990 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:39:43,009 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:39:43,009 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:43,011 INFO ]: Computing forward predicates... [2018-06-25 00:39:43,033 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:43,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:43,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 00:39:43,052 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:39:43,052 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:39:43,052 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:43,053 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 7 states. [2018-06-25 00:39:43,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:43,155 INFO ]: Finished difference Result 14 states and 51 transitions. [2018-06-25 00:39:43,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:39:43,155 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 00:39:43,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:43,156 INFO ]: With dead ends: 14 [2018-06-25 00:39:43,156 INFO ]: Without dead ends: 14 [2018-06-25 00:39:43,156 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:43,156 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:39:43,158 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 00:39:43,158 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:39:43,159 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-06-25 00:39:43,159 INFO ]: Start accepts. Automaton has 11 states and 36 transitions. Word has length 7 [2018-06-25 00:39:43,159 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:43,159 INFO ]: Abstraction has 11 states and 36 transitions. [2018-06-25 00:39:43,159 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:39:43,159 INFO ]: Start isEmpty. Operand 11 states and 36 transitions. [2018-06-25 00:39:43,159 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:39:43,159 INFO ]: Found error trace [2018-06-25 00:39:43,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:43,159 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:43,160 INFO ]: Analyzing trace with hash -45937657, now seen corresponding path program 1 times [2018-06-25 00:39:43,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:43,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:43,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:43,160 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:43,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:43,168 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:43,214 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:43,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:43,214 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-25 00:39:43,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:43,238 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:43,240 INFO ]: Computing forward predicates... [2018-06-25 00:39:43,267 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:43,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:43,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 00:39:43,286 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:39:43,286 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:39:43,286 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:39:43,286 INFO ]: Start difference. First operand 11 states and 36 transitions. Second operand 6 states. [2018-06-25 00:39:43,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:43,371 INFO ]: Finished difference Result 14 states and 51 transitions. [2018-06-25 00:39:43,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:39:43,371 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 00:39:43,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:43,372 INFO ]: With dead ends: 14 [2018-06-25 00:39:43,372 INFO ]: Without dead ends: 14 [2018-06-25 00:39:43,372 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:39:43,372 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:39:43,374 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-25 00:39:43,374 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:39:43,374 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 00:39:43,374 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 7 [2018-06-25 00:39:43,374 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:43,374 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 00:39:43,374 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:39:43,374 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 00:39:43,374 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:43,374 INFO ]: Found error trace [2018-06-25 00:39:43,375 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:43,375 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:43,375 INFO ]: Analyzing trace with hash 1844760625, now seen corresponding path program 2 times [2018-06-25 00:39:43,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:43,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:43,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:43,375 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:43,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:43,384 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:43,595 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:43,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:43,595 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-25 00:39:43,605 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:39:43,635 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:39:43,635 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:43,637 INFO ]: Computing forward predicates... [2018-06-25 00:39:43,684 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:43,705 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:43,705 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-25 00:39:43,705 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:39:43,705 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:39:43,706 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:39:43,706 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 9 states. [2018-06-25 00:39:43,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:43,976 INFO ]: Finished difference Result 16 states and 61 transitions. [2018-06-25 00:39:43,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:39:43,976 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-25 00:39:43,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:43,977 INFO ]: With dead ends: 16 [2018-06-25 00:39:43,977 INFO ]: Without dead ends: 16 [2018-06-25 00:39:43,977 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:39:43,977 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:39:43,979 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 00:39:43,979 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:39:43,980 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-25 00:39:43,980 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 8 [2018-06-25 00:39:43,980 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:43,980 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-25 00:39:43,980 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:39:43,980 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-25 00:39:43,980 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:43,980 INFO ]: Found error trace [2018-06-25 00:39:43,980 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:43,980 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:43,980 INFO ]: Analyzing trace with hash 1844611670, now seen corresponding path program 3 times [2018-06-25 00:39:43,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:43,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:43,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:43,981 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:43,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:43,991 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,047 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,047 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:44,047 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:39:44,065 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:39:44,080 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:39:44,080 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,081 INFO ]: Computing forward predicates... [2018-06-25 00:39:44,101 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:44,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:39:44,121 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:39:44,121 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:39:44,121 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:44,121 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 7 states. [2018-06-25 00:39:44,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:44,247 INFO ]: Finished difference Result 15 states and 56 transitions. [2018-06-25 00:39:44,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:39:44,248 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:39:44,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:44,248 INFO ]: With dead ends: 15 [2018-06-25 00:39:44,248 INFO ]: Without dead ends: 15 [2018-06-25 00:39:44,248 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:44,248 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:39:44,250 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-25 00:39:44,250 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:39:44,251 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-06-25 00:39:44,251 INFO ]: Start accepts. Automaton has 11 states and 36 transitions. Word has length 8 [2018-06-25 00:39:44,251 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:44,251 INFO ]: Abstraction has 11 states and 36 transitions. [2018-06-25 00:39:44,251 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:39:44,251 INFO ]: Start isEmpty. Operand 11 states and 36 transitions. [2018-06-25 00:39:44,251 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:44,251 INFO ]: Found error trace [2018-06-25 00:39:44,251 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:44,251 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:44,251 INFO ]: Analyzing trace with hash 1840143020, now seen corresponding path program 4 times [2018-06-25 00:39:44,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:44,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:44,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:44,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:44,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:44,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,309 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:44,309 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-25 00:39:44,316 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:39:44,329 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:39:44,329 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,330 INFO ]: Computing forward predicates... [2018-06-25 00:39:44,359 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:44,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 00:39:44,378 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:44,378 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:44,378 INFO ]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:44,378 INFO ]: Start difference. First operand 11 states and 36 transitions. Second operand 8 states. [2018-06-25 00:39:44,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:44,677 INFO ]: Finished difference Result 17 states and 66 transitions. [2018-06-25 00:39:44,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:44,677 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-25 00:39:44,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:44,678 INFO ]: With dead ends: 17 [2018-06-25 00:39:44,678 INFO ]: Without dead ends: 17 [2018-06-25 00:39:44,678 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:44,678 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:39:44,680 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-25 00:39:44,680 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:39:44,681 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-25 00:39:44,681 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 8 [2018-06-25 00:39:44,681 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:44,681 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-25 00:39:44,681 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:44,681 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-25 00:39:44,681 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:44,681 INFO ]: Found error trace [2018-06-25 00:39:44,681 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:39:44,681 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:44,681 INFO ]: Analyzing trace with hash 1839994065, now seen corresponding path program 3 times [2018-06-25 00:39:44,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:44,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:44,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:44,682 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:44,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:44,689 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,735 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:44,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:39:44,741 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:39:44,759 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:39:44,759 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,760 INFO ]: Computing forward predicates... [2018-06-25 00:39:44,785 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:44,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:39:44,804 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:39:44,805 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:39:44,805 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:44,805 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 7 states. [2018-06-25 00:39:44,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:44,928 INFO ]: Finished difference Result 16 states and 61 transitions. [2018-06-25 00:39:44,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:39:44,928 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:39:44,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:44,929 INFO ]: With dead ends: 16 [2018-06-25 00:39:44,929 INFO ]: Without dead ends: 16 [2018-06-25 00:39:44,929 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:44,929 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:39:44,930 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-06-25 00:39:44,931 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:39:44,931 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-06-25 00:39:44,931 INFO ]: Start accepts. Automaton has 11 states and 36 transitions. Word has length 8 [2018-06-25 00:39:44,931 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:44,931 INFO ]: Abstraction has 11 states and 36 transitions. [2018-06-25 00:39:44,931 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:39:44,931 INFO ]: Start isEmpty. Operand 11 states and 36 transitions. [2018-06-25 00:39:44,932 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:44,932 INFO ]: Found error trace [2018-06-25 00:39:44,932 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 00:39:44,932 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:44,932 INFO ]: Analyzing trace with hash -1419557235, now seen corresponding path program 3 times [2018-06-25 00:39:44,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:44,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:44,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:44,932 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:44,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:44,939 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:44,987 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:44,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:44,987 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-25 00:39:44,995 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:39:45,007 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:39:45,007 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:45,008 INFO ]: Computing forward predicates... [2018-06-25 00:39:45,053 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:45,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:45,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-25 00:39:45,073 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:39:45,073 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:39:45,073 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:39:45,073 INFO ]: Start difference. First operand 11 states and 36 transitions. Second operand 9 states. [2018-06-25 00:39:45,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:45,215 INFO ]: Finished difference Result 17 states and 66 transitions. [2018-06-25 00:39:45,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:39:45,216 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-25 00:39:45,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:45,216 INFO ]: With dead ends: 17 [2018-06-25 00:39:45,216 INFO ]: Without dead ends: 17 [2018-06-25 00:39:45,216 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:39:45,216 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:39:45,218 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-25 00:39:45,218 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:39:45,219 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:39:45,219 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 8 [2018-06-25 00:39:45,219 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:45,219 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:39:45,219 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:39:45,219 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:39:45,219 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:45,219 INFO ]: Found error trace [2018-06-25 00:39:45,219 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:45,219 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:45,219 INFO ]: Analyzing trace with hash -1419706190, now seen corresponding path program 2 times [2018-06-25 00:39:45,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:45,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:45,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:45,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:45,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:45,226 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:45,267 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:45,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:45,267 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-25 00:39:45,274 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:39:45,309 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:39:45,309 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:45,311 INFO ]: Computing forward predicates... [2018-06-25 00:39:45,559 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:45,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:45,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:39:45,591 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:39:45,591 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:39:45,591 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:45,592 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 7 states. [2018-06-25 00:39:45,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:45,822 INFO ]: Finished difference Result 16 states and 61 transitions. [2018-06-25 00:39:45,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:39:45,822 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:39:45,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:45,822 INFO ]: With dead ends: 16 [2018-06-25 00:39:45,822 INFO ]: Without dead ends: 16 [2018-06-25 00:39:45,823 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:45,823 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:39:45,824 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 00:39:45,824 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:39:45,825 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-25 00:39:45,825 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 8 [2018-06-25 00:39:45,825 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:45,825 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-25 00:39:45,825 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:39:45,825 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-25 00:39:45,825 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:45,825 INFO ]: Found error trace [2018-06-25 00:39:45,825 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:45,825 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:45,826 INFO ]: Analyzing trace with hash -1424174840, now seen corresponding path program 3 times [2018-06-25 00:39:45,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:45,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:45,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:45,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:45,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:45,833 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:45,961 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:45,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:45,961 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-25 00:39:45,966 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:39:45,984 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:39:45,984 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:45,985 INFO ]: Computing forward predicates... [2018-06-25 00:39:46,030 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:46,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:46,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 00:39:46,052 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:46,052 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:46,052 INFO ]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:46,052 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 8 states. [2018-06-25 00:39:46,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:46,687 INFO ]: Finished difference Result 18 states and 71 transitions. [2018-06-25 00:39:46,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:46,727 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-25 00:39:46,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:46,728 INFO ]: With dead ends: 18 [2018-06-25 00:39:46,728 INFO ]: Without dead ends: 18 [2018-06-25 00:39:46,728 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:46,728 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:39:46,731 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-25 00:39:46,731 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:39:46,731 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:39:46,731 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 8 [2018-06-25 00:39:46,731 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:46,731 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:39:46,731 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:46,731 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:39:46,732 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:39:46,732 INFO ]: Found error trace [2018-06-25 00:39:46,732 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:46,732 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:46,732 INFO ]: Analyzing trace with hash -1424323795, now seen corresponding path program 4 times [2018-06-25 00:39:46,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:46,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:46,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:46,733 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:46,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:46,738 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:47,009 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:47,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:47,010 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-25 00:39:47,015 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:39:47,045 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:39:47,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:47,046 INFO ]: Computing forward predicates... [2018-06-25 00:39:47,061 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:47,080 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:47,081 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 00:39:47,081 INFO ]: Interpolant automaton has 7 states [2018-06-25 00:39:47,081 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 00:39:47,081 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:47,081 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 7 states. [2018-06-25 00:39:47,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:47,202 INFO ]: Finished difference Result 17 states and 66 transitions. [2018-06-25 00:39:47,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:39:47,202 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 00:39:47,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:47,203 INFO ]: With dead ends: 17 [2018-06-25 00:39:47,203 INFO ]: Without dead ends: 17 [2018-06-25 00:39:47,203 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 00:39:47,203 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:39:47,204 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-06-25 00:39:47,204 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:39:47,204 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-06-25 00:39:47,205 INFO ]: Start accepts. Automaton has 11 states and 36 transitions. Word has length 8 [2018-06-25 00:39:47,205 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:47,205 INFO ]: Abstraction has 11 states and 36 transitions. [2018-06-25 00:39:47,205 INFO ]: Interpolant automaton has 7 states. [2018-06-25 00:39:47,205 INFO ]: Start isEmpty. Operand 11 states and 36 transitions. [2018-06-25 00:39:47,205 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:47,205 INFO ]: Found error trace [2018-06-25 00:39:47,205 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:47,205 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:47,205 INFO ]: Analyzing trace with hash 1352897054, now seen corresponding path program 5 times [2018-06-25 00:39:47,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:47,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:47,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:47,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:47,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:47,212 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:47,266 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:47,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:47,266 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-25 00:39:47,272 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:39:47,312 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 00:39:47,312 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:47,314 INFO ]: Computing forward predicates... [2018-06-25 00:39:47,365 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:47,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:47,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 00:39:47,385 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:39:47,385 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:39:47,385 INFO ]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:39:47,385 INFO ]: Start difference. First operand 11 states and 36 transitions. Second operand 11 states. [2018-06-25 00:39:47,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:47,644 INFO ]: Finished difference Result 19 states and 76 transitions. [2018-06-25 00:39:47,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:39:47,644 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-25 00:39:47,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:47,644 INFO ]: With dead ends: 19 [2018-06-25 00:39:47,644 INFO ]: Without dead ends: 19 [2018-06-25 00:39:47,644 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:39:47,644 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:39:47,646 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 00:39:47,646 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:39:47,646 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:39:47,646 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 9 [2018-06-25 00:39:47,646 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:47,646 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:39:47,646 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:39:47,646 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:39:47,647 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:47,647 INFO ]: Found error trace [2018-06-25 00:39:47,647 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-25 00:39:47,647 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:47,647 INFO ]: Analyzing trace with hash 1352748099, now seen corresponding path program 6 times [2018-06-25 00:39:47,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:47,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:47,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:47,648 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:47,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:47,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:47,696 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:47,696 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:47,696 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-25 00:39:47,706 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:39:47,751 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 00:39:47,751 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:47,752 INFO ]: Computing forward predicates... [2018-06-25 00:39:47,856 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:47,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:47,877 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:39:47,877 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:47,877 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:47,877 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:47,878 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 8 states. [2018-06-25 00:39:48,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:48,138 INFO ]: Finished difference Result 18 states and 71 transitions. [2018-06-25 00:39:48,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:48,139 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:39:48,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:48,139 INFO ]: With dead ends: 18 [2018-06-25 00:39:48,139 INFO ]: Without dead ends: 18 [2018-06-25 00:39:48,139 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:48,140 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:39:48,141 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-25 00:39:48,141 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:39:48,142 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:39:48,142 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 9 [2018-06-25 00:39:48,142 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:48,142 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:39:48,142 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:48,142 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:39:48,142 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:48,142 INFO ]: Found error trace [2018-06-25 00:39:48,142 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-25 00:39:48,142 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:48,142 INFO ]: Analyzing trace with hash 1348279449, now seen corresponding path program 7 times [2018-06-25 00:39:48,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:48,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:48,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:48,143 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:48,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:48,154 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:48,251 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:48,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:48,251 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) [2018-06-25 00:39:48,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:39:48,280 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:48,282 INFO ]: Computing forward predicates... [2018-06-25 00:39:48,809 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:48,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:48,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:39:48,830 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:39:48,830 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:39:48,830 INFO ]: CoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2018-06-25 00:39:48,830 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 9 states. [2018-06-25 00:39:50,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:50,077 INFO ]: Finished difference Result 19 states and 76 transitions. [2018-06-25 00:39:50,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:39:50,078 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:39:50,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:50,079 INFO ]: With dead ends: 19 [2018-06-25 00:39:50,079 INFO ]: Without dead ends: 19 [2018-06-25 00:39:50,079 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2018-06-25 00:39:50,079 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:39:50,080 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 00:39:50,080 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:39:50,081 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:39:50,081 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 9 [2018-06-25 00:39:50,081 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:50,081 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:39:50,081 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:39:50,081 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:39:50,081 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:50,081 INFO ]: Found error trace [2018-06-25 00:39:50,081 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:50,081 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:50,081 INFO ]: Analyzing trace with hash 1348130494, now seen corresponding path program 8 times [2018-06-25 00:39:50,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:50,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:50,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:50,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:39:50,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:50,087 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:50,143 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:50,143 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:50,143 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-25 00:39:50,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:39:50,171 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:39:50,171 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:50,173 INFO ]: Computing forward predicates... [2018-06-25 00:39:50,238 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:50,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:50,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:39:50,257 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:50,257 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:50,257 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:50,257 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 8 states. [2018-06-25 00:39:50,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:50,485 INFO ]: Finished difference Result 18 states and 71 transitions. [2018-06-25 00:39:50,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:50,485 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:39:50,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:50,486 INFO ]: With dead ends: 18 [2018-06-25 00:39:50,486 INFO ]: Without dead ends: 18 [2018-06-25 00:39:50,486 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:50,486 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:39:50,487 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-25 00:39:50,487 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:39:50,488 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-25 00:39:50,488 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 9 [2018-06-25 00:39:50,488 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:50,488 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-25 00:39:50,488 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:50,488 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-25 00:39:50,488 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:50,488 INFO ]: Found error trace [2018-06-25 00:39:50,488 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-25 00:39:50,488 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:50,488 INFO ]: Analyzing trace with hash 1209751299, now seen corresponding path program 9 times [2018-06-25 00:39:50,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:50,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:50,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:50,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:50,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:50,494 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:50,571 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:50,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:50,571 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-25 00:39:50,577 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:39:50,611 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:39:50,611 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:50,612 INFO ]: Computing forward predicates... [2018-06-25 00:39:50,833 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:50,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:50,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 00:39:50,853 INFO ]: Interpolant automaton has 10 states [2018-06-25 00:39:50,853 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 00:39:50,853 INFO ]: CoverageRelationStatistics Valid=32, Invalid=57, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:39:50,853 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 10 states. [2018-06-25 00:39:52,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:52,435 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:39:52,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:39:52,435 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-25 00:39:52,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:52,436 INFO ]: With dead ends: 21 [2018-06-25 00:39:52,436 INFO ]: Without dead ends: 21 [2018-06-25 00:39:52,436 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=57, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:39:52,436 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:39:52,437 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-25 00:39:52,437 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:39:52,438 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:39:52,438 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 9 [2018-06-25 00:39:52,438 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:52,438 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:39:52,438 INFO ]: Interpolant automaton has 10 states. [2018-06-25 00:39:52,438 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:39:52,438 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:52,438 INFO ]: Found error trace [2018-06-25 00:39:52,438 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:52,438 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:52,438 INFO ]: Analyzing trace with hash 1209602344, now seen corresponding path program 10 times [2018-06-25 00:39:52,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:52,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:52,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:52,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:52,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:52,443 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:52,591 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:52,591 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:52,591 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-25 00:39:52,598 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:39:52,613 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:39:52,613 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:52,614 INFO ]: Computing forward predicates... [2018-06-25 00:39:52,714 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:52,732 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:52,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:39:52,732 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:52,732 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:52,733 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:52,733 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 8 states. [2018-06-25 00:39:56,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:56,292 INFO ]: Finished difference Result 18 states and 71 transitions. [2018-06-25 00:39:56,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:56,293 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:39:56,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:56,293 INFO ]: With dead ends: 18 [2018-06-25 00:39:56,293 INFO ]: Without dead ends: 18 [2018-06-25 00:39:56,294 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:56,294 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:39:56,295 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-25 00:39:56,295 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:39:56,295 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:39:56,295 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 9 [2018-06-25 00:39:56,295 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:56,295 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:39:56,295 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:56,295 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:39:56,296 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:56,296 INFO ]: Found error trace [2018-06-25 00:39:56,296 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:56,296 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:56,296 INFO ]: Analyzing trace with hash 1205133694, now seen corresponding path program 11 times [2018-06-25 00:39:56,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:56,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:56,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:56,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:56,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:56,301 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:56,359 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:56,359 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:56,359 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-25 00:39:56,364 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:39:56,379 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 00:39:56,379 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:56,380 INFO ]: Computing forward predicates... [2018-06-25 00:39:56,441 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:56,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:56,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:39:56,461 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:39:56,461 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:39:56,461 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:39:56,461 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 9 states. [2018-06-25 00:39:56,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:56,756 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:39:56,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:39:56,757 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:39:56,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:56,757 INFO ]: With dead ends: 21 [2018-06-25 00:39:56,757 INFO ]: Without dead ends: 21 [2018-06-25 00:39:56,757 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:39:56,757 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:39:56,759 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-25 00:39:56,759 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:39:56,759 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:39:56,759 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 9 [2018-06-25 00:39:56,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:56,759 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:39:56,759 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:39:56,759 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:39:56,760 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:56,760 INFO ]: Found error trace [2018-06-25 00:39:56,760 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 00:39:56,760 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:56,760 INFO ]: Analyzing trace with hash 1204984739, now seen corresponding path program 4 times [2018-06-25 00:39:56,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:56,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:56,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:56,760 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:56,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:56,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:56,822 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:56,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:56,822 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-25 00:39:56,827 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:39:56,839 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:39:56,839 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:56,841 INFO ]: Computing forward predicates... [2018-06-25 00:39:56,896 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:56,915 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:56,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:39:56,915 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:56,915 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:56,915 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:56,915 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 8 states. [2018-06-25 00:39:57,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:57,629 INFO ]: Finished difference Result 19 states and 76 transitions. [2018-06-25 00:39:57,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:57,629 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:39:57,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:57,629 INFO ]: With dead ends: 19 [2018-06-25 00:39:57,629 INFO ]: Without dead ends: 19 [2018-06-25 00:39:57,629 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:57,630 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:39:57,630 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-06-25 00:39:57,630 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:39:57,630 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-25 00:39:57,631 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 9 [2018-06-25 00:39:57,631 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:57,631 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-25 00:39:57,631 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:57,631 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-25 00:39:57,631 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:57,631 INFO ]: Found error trace [2018-06-25 00:39:57,631 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 00:39:57,631 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:57,631 INFO ]: Analyzing trace with hash -1056708798, now seen corresponding path program 4 times [2018-06-25 00:39:57,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:57,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:57,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:57,632 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:57,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:57,638 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:57,941 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:57,941 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:57,941 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-25 00:39:57,946 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:39:57,958 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:39:57,958 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:57,959 INFO ]: Computing forward predicates... [2018-06-25 00:39:57,992 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:58,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:58,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 00:39:58,011 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:39:58,011 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:39:58,011 INFO ]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:39:58,011 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 11 states. [2018-06-25 00:39:58,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:58,158 INFO ]: Finished difference Result 20 states and 81 transitions. [2018-06-25 00:39:58,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:39:58,158 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-25 00:39:58,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:58,159 INFO ]: With dead ends: 20 [2018-06-25 00:39:58,159 INFO ]: Without dead ends: 20 [2018-06-25 00:39:58,159 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:39:58,159 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:39:58,160 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-25 00:39:58,160 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:39:58,160 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:39:58,161 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 9 [2018-06-25 00:39:58,161 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:58,161 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:39:58,161 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:39:58,161 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:39:58,161 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:58,161 INFO ]: Found error trace [2018-06-25 00:39:58,161 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:58,161 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:58,161 INFO ]: Analyzing trace with hash -1056857753, now seen corresponding path program 5 times [2018-06-25 00:39:58,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:58,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:58,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:58,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:58,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:58,167 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:58,702 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:58,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:58,702 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-25 00:39:58,855 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:39:58,903 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 00:39:58,903 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:58,905 INFO ]: Computing forward predicates... [2018-06-25 00:39:59,017 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:59,037 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:39:59,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:39:59,037 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:39:59,037 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:39:59,037 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:59,037 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 8 states. [2018-06-25 00:39:59,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:39:59,667 INFO ]: Finished difference Result 19 states and 76 transitions. [2018-06-25 00:39:59,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:39:59,667 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:39:59,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:39:59,667 INFO ]: With dead ends: 19 [2018-06-25 00:39:59,667 INFO ]: Without dead ends: 19 [2018-06-25 00:39:59,667 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:39:59,667 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:39:59,669 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 00:39:59,669 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:39:59,669 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:39:59,669 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 9 [2018-06-25 00:39:59,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:39:59,669 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:39:59,669 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:39:59,669 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:39:59,669 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:39:59,669 INFO ]: Found error trace [2018-06-25 00:39:59,670 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:39:59,670 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:39:59,670 INFO ]: Analyzing trace with hash -1061326403, now seen corresponding path program 6 times [2018-06-25 00:39:59,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:39:59,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:39:59,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:59,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:39:59,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:39:59,675 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:59,862 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:39:59,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:39:59,862 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-25 00:39:59,869 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:39:59,883 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 00:39:59,883 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:39:59,884 INFO ]: Computing forward predicates... [2018-06-25 00:40:00,142 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:00,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:00,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:40:00,162 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:00,162 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:00,162 INFO ]: CoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:00,163 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 9 states. [2018-06-25 00:40:01,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:01,384 INFO ]: Finished difference Result 20 states and 81 transitions. [2018-06-25 00:40:01,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:01,384 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:40:01,384 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:01,384 INFO ]: With dead ends: 20 [2018-06-25 00:40:01,384 INFO ]: Without dead ends: 20 [2018-06-25 00:40:01,384 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:01,385 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:40:01,386 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-25 00:40:01,386 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:01,386 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:01,386 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 9 [2018-06-25 00:40:01,386 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:01,386 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:01,386 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:01,386 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:01,387 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:40:01,387 INFO ]: Found error trace [2018-06-25 00:40:01,387 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:01,387 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:01,387 INFO ]: Analyzing trace with hash -1061475358, now seen corresponding path program 7 times [2018-06-25 00:40:01,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:01,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:01,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:01,388 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:01,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:01,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:01,501 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:01,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:01,501 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-25 00:40:01,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:01,521 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:01,522 INFO ]: Computing forward predicates... [2018-06-25 00:40:01,548 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:01,567 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:01,567 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:40:01,567 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:40:01,567 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:40:01,567 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:40:01,567 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 8 states. [2018-06-25 00:40:01,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:01,689 INFO ]: Finished difference Result 19 states and 76 transitions. [2018-06-25 00:40:01,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:40:01,689 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:40:01,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:01,689 INFO ]: With dead ends: 19 [2018-06-25 00:40:01,689 INFO ]: Without dead ends: 19 [2018-06-25 00:40:01,689 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:40:01,689 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:40:01,690 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-25 00:40:01,690 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:40:01,691 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:40:01,691 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 9 [2018-06-25 00:40:01,691 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:01,691 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:40:01,691 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:40:01,691 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:40:01,691 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:40:01,691 INFO ]: Found error trace [2018-06-25 00:40:01,691 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:01,691 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:01,691 INFO ]: Analyzing trace with hash -1199854553, now seen corresponding path program 8 times [2018-06-25 00:40:01,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:01,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:01,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:01,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:01,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:01,696 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:01,761 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:01,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:01,761 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-25 00:40:01,768 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:40:01,780 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:40:01,780 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:01,781 INFO ]: Computing forward predicates... [2018-06-25 00:40:01,854 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:01,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:01,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 00:40:01,873 INFO ]: Interpolant automaton has 10 states [2018-06-25 00:40:01,873 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 00:40:01,873 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:40:01,874 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 10 states. [2018-06-25 00:40:02,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:02,495 INFO ]: Finished difference Result 22 states and 91 transitions. [2018-06-25 00:40:02,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:40:02,495 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-25 00:40:02,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:02,495 INFO ]: With dead ends: 22 [2018-06-25 00:40:02,495 INFO ]: Without dead ends: 22 [2018-06-25 00:40:02,495 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:40:02,495 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:40:02,496 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-25 00:40:02,496 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:02,497 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:02,497 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 9 [2018-06-25 00:40:02,497 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:02,497 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:02,497 INFO ]: Interpolant automaton has 10 states. [2018-06-25 00:40:02,497 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:02,497 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:40:02,497 INFO ]: Found error trace [2018-06-25 00:40:02,497 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:02,497 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:02,497 INFO ]: Analyzing trace with hash -1200003508, now seen corresponding path program 9 times [2018-06-25 00:40:02,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:02,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:02,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:02,498 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:02,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:02,503 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:02,657 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:02,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:02,658 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-25 00:40:02,663 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:40:02,675 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 00:40:02,675 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:02,676 INFO ]: Computing forward predicates... [2018-06-25 00:40:02,864 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:02,883 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:02,883 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:40:02,883 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:40:02,883 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:40:02,883 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:40:02,883 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 8 states. [2018-06-25 00:40:06,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:06,971 INFO ]: Finished difference Result 19 states and 76 transitions. [2018-06-25 00:40:06,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:40:06,971 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:40:06,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:06,972 INFO ]: With dead ends: 19 [2018-06-25 00:40:06,972 INFO ]: Without dead ends: 19 [2018-06-25 00:40:06,972 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:40:06,972 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:40:06,973 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 00:40:06,973 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:40:06,973 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:40:06,974 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 9 [2018-06-25 00:40:06,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:06,974 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:40:06,974 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:40:06,974 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:40:06,974 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:40:06,974 INFO ]: Found error trace [2018-06-25 00:40:06,974 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:06,974 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:06,974 INFO ]: Analyzing trace with hash -1204472158, now seen corresponding path program 10 times [2018-06-25 00:40:06,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:06,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:06,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:06,975 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:06,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:06,981 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:07,388 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:07,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:07,388 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-25 00:40:07,395 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:40:07,407 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:40:07,407 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:07,409 INFO ]: Computing forward predicates... [2018-06-25 00:40:07,434 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:07,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:07,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 00:40:07,454 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:07,454 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:07,454 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:07,455 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 9 states. [2018-06-25 00:40:08,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:08,052 INFO ]: Finished difference Result 22 states and 91 transitions. [2018-06-25 00:40:08,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:08,052 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-25 00:40:08,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:08,052 INFO ]: With dead ends: 22 [2018-06-25 00:40:08,052 INFO ]: Without dead ends: 22 [2018-06-25 00:40:08,053 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:08,053 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:40:08,054 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-25 00:40:08,054 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:08,054 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:08,054 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 9 [2018-06-25 00:40:08,054 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:08,054 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:08,054 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:08,054 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:08,054 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:40:08,054 INFO ]: Found error trace [2018-06-25 00:40:08,054 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:08,055 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:08,055 INFO ]: Analyzing trace with hash -1204621113, now seen corresponding path program 11 times [2018-06-25 00:40:08,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:08,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:08,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:08,055 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:08,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:08,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:08,104 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:08,104 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:08,104 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-25 00:40:08,109 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:40:08,123 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 00:40:08,123 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:08,124 INFO ]: Computing forward predicates... [2018-06-25 00:40:08,148 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:08,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:08,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 00:40:08,167 INFO ]: Interpolant automaton has 8 states [2018-06-25 00:40:08,167 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 00:40:08,167 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:40:08,167 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 8 states. [2018-06-25 00:40:08,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:08,355 INFO ]: Finished difference Result 20 states and 81 transitions. [2018-06-25 00:40:08,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 00:40:08,355 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 00:40:08,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:08,356 INFO ]: With dead ends: 20 [2018-06-25 00:40:08,356 INFO ]: Without dead ends: 20 [2018-06-25 00:40:08,356 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:40:08,356 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:40:08,357 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-06-25 00:40:08,357 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:40:08,357 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-25 00:40:08,358 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 9 [2018-06-25 00:40:08,358 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:08,358 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-25 00:40:08,358 INFO ]: Interpolant automaton has 8 states. [2018-06-25 00:40:08,358 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-25 00:40:08,358 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:08,358 INFO ]: Found error trace [2018-06-25 00:40:08,358 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:08,358 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:08,358 INFO ]: Analyzing trace with hash -1009971759, now seen corresponding path program 12 times [2018-06-25 00:40:08,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:08,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:08,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:08,359 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:08,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:08,363 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:08,421 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:08,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:08,421 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-25 00:40:08,427 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:40:08,442 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 00:40:08,442 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:08,443 INFO ]: Computing forward predicates... [2018-06-25 00:40:08,592 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:08,611 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:08,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 00:40:08,611 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:40:08,611 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:40:08,611 INFO ]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:40:08,611 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 13 states. [2018-06-25 00:40:08,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:08,950 INFO ]: Finished difference Result 22 states and 91 transitions. [2018-06-25 00:40:08,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 00:40:08,950 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-25 00:40:08,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:08,950 INFO ]: With dead ends: 22 [2018-06-25 00:40:08,950 INFO ]: Without dead ends: 22 [2018-06-25 00:40:08,950 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:40:08,950 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:40:08,952 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-25 00:40:08,952 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:08,952 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:08,952 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:08,952 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:08,952 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:08,953 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:40:08,953 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:08,953 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:08,953 INFO ]: Found error trace [2018-06-25 00:40:08,953 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:08,953 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:08,953 INFO ]: Analyzing trace with hash -1010120714, now seen corresponding path program 13 times [2018-06-25 00:40:08,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:08,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:08,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:08,953 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:08,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:08,958 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:08,994 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:08,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:08,994 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-25 00:40:09,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:09,012 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:09,013 INFO ]: Computing forward predicates... [2018-06-25 00:40:09,054 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:09,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:09,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:09,073 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:09,073 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:09,073 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:09,073 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:09,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:09,357 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:40:09,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:09,357 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:09,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:09,357 INFO ]: With dead ends: 21 [2018-06-25 00:40:09,357 INFO ]: Without dead ends: 21 [2018-06-25 00:40:09,357 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:09,357 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:40:09,358 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-25 00:40:09,358 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:09,359 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:09,359 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 10 [2018-06-25 00:40:09,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:09,359 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:09,359 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:09,359 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:09,359 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:09,359 INFO ]: Found error trace [2018-06-25 00:40:09,359 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:09,359 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:09,359 INFO ]: Analyzing trace with hash -1014589364, now seen corresponding path program 14 times [2018-06-25 00:40:09,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:09,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:09,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:09,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:09,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:09,365 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:09,443 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:09,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:09,443 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-25 00:40:09,448 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:40:09,461 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:40:09,461 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:09,463 INFO ]: Computing forward predicates... [2018-06-25 00:40:09,732 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:09,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:09,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 00:40:09,751 INFO ]: Interpolant automaton has 10 states [2018-06-25 00:40:09,751 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 00:40:09,751 INFO ]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:40:09,751 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 10 states. [2018-06-25 00:40:11,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:11,262 INFO ]: Finished difference Result 23 states and 96 transitions. [2018-06-25 00:40:11,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:40:11,263 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 00:40:11,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:11,264 INFO ]: With dead ends: 23 [2018-06-25 00:40:11,264 INFO ]: Without dead ends: 23 [2018-06-25 00:40:11,264 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:40:11,264 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:40:11,264 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-25 00:40:11,264 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:11,265 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:11,265 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:11,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:11,265 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:11,265 INFO ]: Interpolant automaton has 10 states. [2018-06-25 00:40:11,265 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:11,265 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:11,265 INFO ]: Found error trace [2018-06-25 00:40:11,265 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:11,265 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:11,265 INFO ]: Analyzing trace with hash -1014738319, now seen corresponding path program 15 times [2018-06-25 00:40:11,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:11,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:11,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:11,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:11,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:11,272 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:11,336 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:11,336 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:11,336 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-25 00:40:11,341 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:40:11,395 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 00:40:11,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:11,397 INFO ]: Computing forward predicates... [2018-06-25 00:40:11,433 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:11,452 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:11,452 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:11,452 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:11,452 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:11,452 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:11,452 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:13,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:13,222 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:40:13,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:13,258 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:13,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:13,258 INFO ]: With dead ends: 21 [2018-06-25 00:40:13,258 INFO ]: Without dead ends: 21 [2018-06-25 00:40:13,259 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:13,259 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:40:13,259 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-25 00:40:13,259 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:40:13,260 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:40:13,260 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 10 [2018-06-25 00:40:13,260 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:13,260 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:40:13,260 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:13,260 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:40:13,260 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:13,260 INFO ]: Found error trace [2018-06-25 00:40:13,260 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:13,260 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:13,260 INFO ]: Analyzing trace with hash -1153117514, now seen corresponding path program 16 times [2018-06-25 00:40:13,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:13,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:13,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:13,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:13,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:13,264 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:13,314 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:13,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:13,314 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-25 00:40:13,320 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:40:13,334 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:40:13,334 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:13,335 INFO ]: Computing forward predicates... [2018-06-25 00:40:13,908 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:13,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:13,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 00:40:13,928 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:40:13,928 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:40:13,928 INFO ]: CoverageRelationStatistics Valid=37, Invalid=71, Unknown=2, NotChecked=0, Total=110 [2018-06-25 00:40:13,928 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 11 states. [2018-06-25 00:40:16,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:16,606 INFO ]: Finished difference Result 23 states and 96 transitions. [2018-06-25 00:40:16,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:40:16,607 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-25 00:40:16,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:16,607 INFO ]: With dead ends: 23 [2018-06-25 00:40:16,607 INFO ]: Without dead ends: 23 [2018-06-25 00:40:16,608 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=71, Unknown=2, NotChecked=0, Total=110 [2018-06-25 00:40:16,608 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:40:16,608 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-25 00:40:16,608 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:16,609 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:16,609 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:16,609 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:16,609 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:16,609 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:40:16,609 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:16,609 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:16,609 INFO ]: Found error trace [2018-06-25 00:40:16,609 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:16,609 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:16,609 INFO ]: Analyzing trace with hash -1153266469, now seen corresponding path program 17 times [2018-06-25 00:40:16,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:16,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:16,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:16,610 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:16,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:16,614 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:16,761 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:16,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:16,761 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-25 00:40:16,767 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:40:16,782 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 00:40:16,782 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:16,783 INFO ]: Computing forward predicates... [2018-06-25 00:40:18,397 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:18,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:18,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:18,425 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:18,425 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:18,425 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:18,425 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:22,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:22,128 INFO ]: Finished difference Result 20 states and 81 transitions. [2018-06-25 00:40:22,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:22,128 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:22,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:22,128 INFO ]: With dead ends: 20 [2018-06-25 00:40:22,128 INFO ]: Without dead ends: 20 [2018-06-25 00:40:22,128 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:22,128 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 00:40:22,129 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-25 00:40:22,129 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:22,129 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:22,130 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 10 [2018-06-25 00:40:22,130 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:22,130 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:22,130 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:22,130 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:22,130 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:22,130 INFO ]: Found error trace [2018-06-25 00:40:22,130 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:22,130 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:22,130 INFO ]: Analyzing trace with hash -1157735119, now seen corresponding path program 18 times [2018-06-25 00:40:22,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:22,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:22,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:22,130 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:22,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:22,135 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:22,177 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:22,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:22,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:22,183 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:40:22,199 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 00:40:22,199 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:22,200 INFO ]: Computing forward predicates... [2018-06-25 00:40:22,623 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:22,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:22,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 00:40:22,642 INFO ]: Interpolant automaton has 10 states [2018-06-25 00:40:22,642 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 00:40:22,642 INFO ]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:40:22,642 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 10 states. [2018-06-25 00:40:25,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:25,438 INFO ]: Finished difference Result 23 states and 96 transitions. [2018-06-25 00:40:25,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:40:25,438 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 00:40:25,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:25,438 INFO ]: With dead ends: 23 [2018-06-25 00:40:25,438 INFO ]: Without dead ends: 23 [2018-06-25 00:40:25,438 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:40:25,438 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:40:25,439 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-25 00:40:25,439 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:25,440 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:25,440 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:25,440 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:25,440 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:25,440 INFO ]: Interpolant automaton has 10 states. [2018-06-25 00:40:25,440 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:25,440 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:25,440 INFO ]: Found error trace [2018-06-25 00:40:25,440 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:25,440 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:25,440 INFO ]: Analyzing trace with hash -1157884074, now seen corresponding path program 19 times [2018-06-25 00:40:25,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:25,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:25,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:25,441 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:25,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:25,448 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:25,711 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:25,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:25,711 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:25,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:25,731 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:25,732 INFO ]: Computing forward predicates... [2018-06-25 00:40:27,821 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:27,840 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:27,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:27,840 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:27,840 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:27,840 INFO ]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:27,840 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:27,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:27,979 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:40:27,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:27,979 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:27,979 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:27,979 INFO ]: With dead ends: 21 [2018-06-25 00:40:27,979 INFO ]: Without dead ends: 21 [2018-06-25 00:40:27,979 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:27,979 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:40:27,980 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-06-25 00:40:27,980 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:40:27,981 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:40:27,981 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 10 [2018-06-25 00:40:27,981 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:27,981 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:40:27,981 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:27,981 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:40:27,981 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:27,981 INFO ]: Found error trace [2018-06-25 00:40:27,981 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:27,981 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:27,981 INFO ]: Analyzing trace with hash -1152522868, now seen corresponding path program 20 times [2018-06-25 00:40:27,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:27,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:27,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:27,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:27,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:27,986 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:28,092 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:28,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:28,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:28,098 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:40:28,111 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:40:28,111 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:28,112 INFO ]: Computing forward predicates... [2018-06-25 00:40:28,998 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:29,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:29,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-25 00:40:29,017 INFO ]: Interpolant automaton has 12 states [2018-06-25 00:40:29,017 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 00:40:29,017 INFO ]: CoverageRelationStatistics Valid=45, Invalid=84, Unknown=3, NotChecked=0, Total=132 [2018-06-25 00:40:29,017 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 12 states. [2018-06-25 00:40:31,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:31,680 INFO ]: Finished difference Result 25 states and 106 transitions. [2018-06-25 00:40:31,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:40:31,680 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-25 00:40:31,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:31,681 INFO ]: With dead ends: 25 [2018-06-25 00:40:31,681 INFO ]: Without dead ends: 25 [2018-06-25 00:40:31,681 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=84, Unknown=3, NotChecked=0, Total=132 [2018-06-25 00:40:31,681 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 00:40:31,682 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-25 00:40:31,682 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:31,683 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:31,683 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:31,683 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:31,683 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:31,683 INFO ]: Interpolant automaton has 12 states. [2018-06-25 00:40:31,683 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:31,683 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:31,683 INFO ]: Found error trace [2018-06-25 00:40:31,683 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:31,683 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:31,684 INFO ]: Analyzing trace with hash -1152671823, now seen corresponding path program 21 times [2018-06-25 00:40:31,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:31,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:31,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:31,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:31,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:31,689 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:31,774 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:31,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:31,774 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:31,779 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 00:40:31,793 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 00:40:31,793 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:31,794 INFO ]: Computing forward predicates... [2018-06-25 00:40:33,847 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:33,866 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:33,866 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:33,866 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:33,866 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:33,866 INFO ]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:33,867 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:36,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:36,087 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:40:36,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:36,087 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:36,088 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:36,088 INFO ]: With dead ends: 21 [2018-06-25 00:40:36,088 INFO ]: Without dead ends: 21 [2018-06-25 00:40:36,088 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:36,088 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:40:36,089 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-25 00:40:36,089 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:36,089 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:36,089 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 10 [2018-06-25 00:40:36,090 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:36,090 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:36,090 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:36,090 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:36,090 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:36,090 INFO ]: Found error trace [2018-06-25 00:40:36,090 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:36,090 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:36,090 INFO ]: Analyzing trace with hash -1157140473, now seen corresponding path program 22 times [2018-06-25 00:40:36,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:36,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:36,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:36,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:36,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:36,097 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:36,274 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:36,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:36,274 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:36,279 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 00:40:36,293 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 00:40:36,293 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:36,294 INFO ]: Computing forward predicates... [2018-06-25 00:40:36,870 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:36,890 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:37,044 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 00:40:37,044 INFO ]: Interpolant automaton has 10 states [2018-06-25 00:40:37,044 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 00:40:37,044 INFO ]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:40:37,044 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 10 states. [2018-06-25 00:40:42,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:42,382 INFO ]: Finished difference Result 23 states and 96 transitions. [2018-06-25 00:40:42,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:40:42,392 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 00:40:42,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:42,393 INFO ]: With dead ends: 23 [2018-06-25 00:40:42,393 INFO ]: Without dead ends: 23 [2018-06-25 00:40:42,393 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-06-25 00:40:42,393 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:40:42,394 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-25 00:40:42,394 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:42,394 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:42,394 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:42,394 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:42,394 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:42,394 INFO ]: Interpolant automaton has 10 states. [2018-06-25 00:40:42,394 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:42,394 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:42,394 INFO ]: Found error trace [2018-06-25 00:40:42,394 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:42,395 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:42,395 INFO ]: Analyzing trace with hash -1157289428, now seen corresponding path program 23 times [2018-06-25 00:40:42,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:42,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:42,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:42,395 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:42,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:42,399 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:42,453 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:42,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:42,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:42,460 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:40:42,476 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 00:40:42,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:42,477 INFO ]: Computing forward predicates... [2018-06-25 00:40:45,049 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:45,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:45,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:45,072 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:45,072 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:45,072 INFO ]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:45,072 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:47,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:47,272 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:40:47,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:47,273 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:47,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:47,273 INFO ]: With dead ends: 21 [2018-06-25 00:40:47,273 INFO ]: Without dead ends: 21 [2018-06-25 00:40:47,274 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2018-06-25 00:40:47,274 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:40:47,274 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-25 00:40:47,275 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:40:47,275 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-06-25 00:40:47,275 INFO ]: Start accepts. Automaton has 14 states and 51 transitions. Word has length 10 [2018-06-25 00:40:47,275 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:47,275 INFO ]: Abstraction has 14 states and 51 transitions. [2018-06-25 00:40:47,275 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:47,275 INFO ]: Start isEmpty. Operand 14 states and 51 transitions. [2018-06-25 00:40:47,275 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:47,275 INFO ]: Found error trace [2018-06-25 00:40:47,275 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-25 00:40:47,275 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:47,275 INFO ]: Analyzing trace with hash -1295668623, now seen corresponding path program 24 times [2018-06-25 00:40:47,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:47,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:47,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:47,276 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:47,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:47,282 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:47,332 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:47,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:47,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:47,339 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:40:47,353 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 00:40:47,353 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:47,354 INFO ]: Computing forward predicates... [2018-06-25 00:40:47,405 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:47,424 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:47,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 00:40:47,426 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:40:47,426 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:40:47,426 INFO ]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:40:47,426 INFO ]: Start difference. First operand 14 states and 51 transitions. Second operand 11 states. [2018-06-25 00:40:48,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:48,249 INFO ]: Finished difference Result 26 states and 111 transitions. [2018-06-25 00:40:48,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 00:40:48,249 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-25 00:40:48,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:48,250 INFO ]: With dead ends: 26 [2018-06-25 00:40:48,250 INFO ]: Without dead ends: 26 [2018-06-25 00:40:48,250 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:40:48,250 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 00:40:48,251 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-06-25 00:40:48,251 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:48,251 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:48,251 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:48,251 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:48,251 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:48,251 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:40:48,251 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:48,252 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:48,252 INFO ]: Found error trace [2018-06-25 00:40:48,252 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:48,252 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:48,252 INFO ]: Analyzing trace with hash -1295817578, now seen corresponding path program 25 times [2018-06-25 00:40:48,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:48,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:48,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:48,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:48,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:48,256 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:48,299 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:48,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:48,299 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 00:40:48,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:48,330 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:48,332 INFO ]: Computing forward predicates... [2018-06-25 00:40:48,418 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:48,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:48,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:48,437 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:48,437 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:48,437 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:48,437 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:50,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:50,699 INFO ]: Finished difference Result 21 states and 86 transitions. [2018-06-25 00:40:50,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:50,700 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:50,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:50,700 INFO ]: With dead ends: 21 [2018-06-25 00:40:50,700 INFO ]: Without dead ends: 21 [2018-06-25 00:40:50,700 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:50,700 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:40:50,700 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-25 00:40:50,701 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:40:50,701 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2018-06-25 00:40:50,701 INFO ]: Start accepts. Automaton has 15 states and 56 transitions. Word has length 10 [2018-06-25 00:40:50,701 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:50,701 INFO ]: Abstraction has 15 states and 56 transitions. [2018-06-25 00:40:50,701 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:50,701 INFO ]: Start isEmpty. Operand 15 states and 56 transitions. [2018-06-25 00:40:50,701 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:50,701 INFO ]: Found error trace [2018-06-25 00:40:50,701 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:50,701 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:50,701 INFO ]: Analyzing trace with hash -1300286228, now seen corresponding path program 26 times [2018-06-25 00:40:50,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:50,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:50,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:50,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:40:50,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:50,707 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:50,866 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:50,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:50,866 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:50,872 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:40:50,887 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:40:50,887 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:50,888 INFO ]: Computing forward predicates... [2018-06-25 00:40:50,919 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:50,938 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:50,938 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 00:40:50,938 INFO ]: Interpolant automaton has 10 states [2018-06-25 00:40:50,939 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 00:40:50,939 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:40:50,939 INFO ]: Start difference. First operand 15 states and 56 transitions. Second operand 10 states. [2018-06-25 00:40:51,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:51,665 INFO ]: Finished difference Result 25 states and 106 transitions. [2018-06-25 00:40:51,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:40:51,666 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 00:40:51,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:51,666 INFO ]: With dead ends: 25 [2018-06-25 00:40:51,666 INFO ]: Without dead ends: 25 [2018-06-25 00:40:51,666 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:40:51,666 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 00:40:51,667 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-25 00:40:51,667 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:40:51,667 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-06-25 00:40:51,667 INFO ]: Start accepts. Automaton has 16 states and 61 transitions. Word has length 10 [2018-06-25 00:40:51,668 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:51,668 INFO ]: Abstraction has 16 states and 61 transitions. [2018-06-25 00:40:51,668 INFO ]: Interpolant automaton has 10 states. [2018-06-25 00:40:51,668 INFO ]: Start isEmpty. Operand 16 states and 61 transitions. [2018-06-25 00:40:51,668 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:51,668 INFO ]: Found error trace [2018-06-25 00:40:51,668 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 00:40:51,668 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:51,668 INFO ]: Analyzing trace with hash -1300435183, now seen corresponding path program 5 times [2018-06-25 00:40:51,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:51,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:51,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:51,669 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:51,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:51,673 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:51,751 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:51,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:51,751 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:51,756 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:40:51,770 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 00:40:51,770 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:51,771 INFO ]: Computing forward predicates... [2018-06-25 00:40:51,806 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:51,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:51,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:51,825 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:51,825 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:51,825 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:51,825 INFO ]: Start difference. First operand 16 states and 61 transitions. Second operand 9 states. [2018-06-25 00:40:51,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:51,953 INFO ]: Finished difference Result 22 states and 91 transitions. [2018-06-25 00:40:51,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 00:40:51,954 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 00:40:51,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:51,954 INFO ]: With dead ends: 22 [2018-06-25 00:40:51,954 INFO ]: Without dead ends: 22 [2018-06-25 00:40:51,954 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:51,954 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 00:40:51,955 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 13. [2018-06-25 00:40:51,955 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:40:51,955 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-06-25 00:40:51,955 INFO ]: Start accepts. Automaton has 13 states and 46 transitions. Word has length 10 [2018-06-25 00:40:51,955 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:51,955 INFO ]: Abstraction has 13 states and 46 transitions. [2018-06-25 00:40:51,955 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:40:51,955 INFO ]: Start isEmpty. Operand 13 states and 46 transitions. [2018-06-25 00:40:51,956 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:51,956 INFO ]: Found error trace [2018-06-25 00:40:51,956 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 00:40:51,956 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:51,956 INFO ]: Analyzing trace with hash 1601658157, now seen corresponding path program 5 times [2018-06-25 00:40:51,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:51,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:51,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:51,956 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:51,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:51,959 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:52,025 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:52,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:52,025 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:52,036 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 00:40:52,051 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 00:40:52,051 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:52,052 INFO ]: Computing forward predicates... [2018-06-25 00:40:52,095 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:52,114 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:52,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 00:40:52,114 INFO ]: Interpolant automaton has 13 states [2018-06-25 00:40:52,114 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 00:40:52,114 INFO ]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:40:52,114 INFO ]: Start difference. First operand 13 states and 46 transitions. Second operand 13 states. [2018-06-25 00:40:52,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:40:52,348 INFO ]: Finished difference Result 23 states and 96 transitions. [2018-06-25 00:40:52,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 00:40:52,348 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-25 00:40:52,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:40:52,348 INFO ]: With dead ends: 23 [2018-06-25 00:40:52,348 INFO ]: Without dead ends: 23 [2018-06-25 00:40:52,349 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:40:52,349 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:40:52,349 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-25 00:40:52,349 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:40:52,350 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2018-06-25 00:40:52,350 INFO ]: Start accepts. Automaton has 17 states and 66 transitions. Word has length 10 [2018-06-25 00:40:52,350 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:40:52,350 INFO ]: Abstraction has 17 states and 66 transitions. [2018-06-25 00:40:52,350 INFO ]: Interpolant automaton has 13 states. [2018-06-25 00:40:52,350 INFO ]: Start isEmpty. Operand 17 states and 66 transitions. [2018-06-25 00:40:52,350 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:40:52,350 INFO ]: Found error trace [2018-06-25 00:40:52,350 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-25 00:40:52,350 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:40:52,350 INFO ]: Analyzing trace with hash 1601509202, now seen corresponding path program 12 times [2018-06-25 00:40:52,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:40:52,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:40:52,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:52,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:40:52,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:40:52,354 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:52,651 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:52,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:40:52,659 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:40:52,664 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 00:40:52,679 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 00:40:52,679 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:40:52,680 INFO ]: Computing forward predicates... [2018-06-25 00:40:52,710 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:40:52,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:40:52,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 00:40:52,729 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:40:52,729 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:40:52,729 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:40:52,729 INFO ]: Start difference. First operand 17 states and 66 transitions. Second operand 9 states. Received shutdown request... [2018-06-25 00:40:53,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 00:40:53,238 WARN ]: Verification canceled [2018-06-25 00:40:53,241 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:40:53,242 WARN ]: Timeout [2018-06-25 00:40:53,242 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:40:53 BasicIcfg [2018-06-25 00:40:53,242 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:40:53,243 INFO ]: Toolchain (without parser) took 73336.58 ms. Allocated memory was 306.2 MB in the beginning and 582.0 MB in the end (delta: 275.8 MB). Free memory was 262.6 MB in the beginning and 472.6 MB in the end (delta: -210.0 MB). Peak memory consumption was 65.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:40:53,244 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:40:53,244 INFO ]: ChcToBoogie took 60.49 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:40:53,245 INFO ]: Boogie Preprocessor took 33.25 ms. Allocated memory is still 306.2 MB. Free memory was 260.5 MB in the beginning and 259.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:40:53,245 INFO ]: RCFGBuilder took 254.16 ms. Allocated memory is still 306.2 MB. Free memory was 259.5 MB in the beginning and 252.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:40:53,245 INFO ]: BlockEncodingV2 took 172.09 ms. Allocated memory is still 306.2 MB. Free memory was 252.4 MB in the beginning and 248.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:40:53,246 INFO ]: TraceAbstraction took 72804.03 ms. Allocated memory was 306.2 MB in the beginning and 582.0 MB in the end (delta: 275.8 MB). Free memory was 248.5 MB in the beginning and 472.6 MB in the end (delta: -224.1 MB). Peak memory consumption was 51.6 MB. Max. memory is 3.6 GB. [2018-06-25 00:40:53,248 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 13 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.49 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.25 ms. Allocated memory is still 306.2 MB. Free memory was 260.5 MB in the beginning and 259.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 254.16 ms. Allocated memory is still 306.2 MB. Free memory was 259.5 MB in the beginning and 252.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 172.09 ms. Allocated memory is still 306.2 MB. Free memory was 252.4 MB in the beginning and 248.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 72804.03 ms. Allocated memory was 306.2 MB in the beginning and 582.0 MB in the end (delta: 275.8 MB). Free memory was 248.5 MB in the beginning and 472.6 MB in the end (delta: -224.1 MB). Peak memory consumption was 51.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (17states) and interpolant automaton (currently 5 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (6 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 72.7s OverallTime, 50 OverallIterations, 5 TraceHistogramMax, 49.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 297 SDtfs, 0 SDslu, 663 SDs, 0 SdLazy, 7918 SolverSat, 1404 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 48.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 718 GetRequests, 352 SyntacticMatches, 39 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=49, 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, 49 MinimizatonAttempts, 270 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 768 ConstructedInterpolants, 73 QuantifiedInterpolants, 32368 SizeOfPredicates, 96 NumberOfNonLiveVariables, 5252 ConjunctsInSsa, 896 ConjunctsInUnsatCore, 98 InterpolantComputations, 2 PerfectInterpolantSequences, 0/984 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/fib_bench_safe_v1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-40-53-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-40-53-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-40-53-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-40-53-259.csv Completed graceful shutdown