java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:42:24,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:42:24,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:42:24,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:42:24,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:42:24,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:42:24,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:42:24,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:42:24,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:42:24,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:42:24,494 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:42:24,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:42:24,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:42:24,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:42:24,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:42:24,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:42:24,500 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:42:24,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:42:24,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:42:24,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:42:24,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:42:24,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:42:24,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:42:24,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:42:24,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:42:24,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:42:24,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:42:24,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:42:24,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:42:24,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:42:24,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:42:24,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:42:24,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:42:24,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:42:24,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:42:24,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:42:24,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:42:24,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:42:24,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:42:24,537 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:42:24,537 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:42:24,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:42:24,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:42:24,539 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:42:24,539 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:42:24,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:42:24,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:42:24,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:42:24,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:42:24,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:42:24,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:42:24,541 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:42:24,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:42:24,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:42:24,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:42:24,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:42:24,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:42:24,543 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:42:24,544 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:42:24,545 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:42:24,591 INFO ]: Repository-Root is: /tmp [2018-06-26 18:42:24,605 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:42:24,608 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:42:24,609 INFO ]: Initializing SmtParser... [2018-06-26 18:42:24,610 INFO ]: SmtParser initialized [2018-06-26 18:42:24,610 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-26 18:42:24,611 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:42:24,705 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@4d7a0263 [2018-06-26 18:42:24,946 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-26 18:42:24,950 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:42:24,961 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:42:24,962 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:42:24,962 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:42:24,962 INFO ]: ChcToBoogie initialized [2018-06-26 18:42:24,969 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:42:24" (1/1) ... [2018-06-26 18:42:25,039 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25 Unit [2018-06-26 18:42:25,039 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:42:25,040 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:42:25,040 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:42:25,040 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:42:25,063 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,063 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,071 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,071 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,076 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,078 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,079 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,081 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:42:25,081 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:42:25,081 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:42:25,081 INFO ]: RCFGBuilder initialized [2018-06-26 18:42:25,082 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:42:25,094 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:42:25,094 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:42:25,094 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:42:25,094 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:42:25,094 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:42:25,094 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:42:25,483 INFO ]: Using library mode [2018-06-26 18:42:25,484 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:42:25 BoogieIcfgContainer [2018-06-26 18:42:25,484 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:42:25,484 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:42:25,485 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:42:25,485 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:42:25,486 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:42:25" (1/1) ... [2018-06-26 18:42:25,500 INFO ]: Initial Icfg 13 locations, 24 edges [2018-06-26 18:42:25,501 INFO ]: Using Remove infeasible edges [2018-06-26 18:42:25,502 INFO ]: Using Maximize final states [2018-06-26 18:42:25,502 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:42:25,503 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:42:25,506 INFO ]: Using Remove sink states [2018-06-26 18:42:25,506 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:42:25,507 INFO ]: Using Use SBE [2018-06-26 18:42:25,514 INFO ]: SBE split 0 edges [2018-06-26 18:42:25,519 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:42:25,520 INFO ]: 0 new accepting states [2018-06-26 18:42:25,540 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:42:25,542 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:42:25,546 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:42:25,546 INFO ]: 0 new accepting states [2018-06-26 18:42:25,546 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:42:25,546 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:42:25,548 INFO ]: Encoded RCFG 9 locations, 20 edges [2018-06-26 18:42:25,548 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:42:25 BasicIcfg [2018-06-26 18:42:25,548 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:42:25,549 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:42:25,549 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:42:25,552 INFO ]: TraceAbstraction initialized [2018-06-26 18:42:25,552 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:42:24" (1/4) ... [2018-06-26 18:42:25,554 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e10363e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:42:25, skipping insertion in model container [2018-06-26 18:42:25,554 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:42:25" (2/4) ... [2018-06-26 18:42:25,554 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e10363e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:42:25, skipping insertion in model container [2018-06-26 18:42:25,554 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:42:25" (3/4) ... [2018-06-26 18:42:25,554 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e10363e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:42:25, skipping insertion in model container [2018-06-26 18:42:25,554 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:42:25" (4/4) ... [2018-06-26 18:42:25,556 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:42:25,566 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:42:25,573 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:42:25,607 INFO ]: Using default assertion order modulation [2018-06-26 18:42:25,608 INFO ]: Interprodecural is true [2018-06-26 18:42:25,608 INFO ]: Hoare is false [2018-06-26 18:42:25,608 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:42:25,608 INFO ]: Backedges is TWOTRACK [2018-06-26 18:42:25,608 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:42:25,608 INFO ]: Difference is false [2018-06-26 18:42:25,608 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:42:25,608 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:42:25,616 INFO ]: Start isEmpty. Operand 9 states. [2018-06-26 18:42:25,625 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:42:25,626 INFO ]: Found error trace [2018-06-26 18:42:25,626 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:25,627 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:25,631 INFO ]: Analyzing trace with hash -110759759, now seen corresponding path program 1 times [2018-06-26 18:42:25,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:25,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:25,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:25,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:25,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:25,722 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:25,860 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:25,862 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:25,862 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 18:42:25,864 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:25,879 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:25,880 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:25,882 INFO ]: Start difference. First operand 9 states. Second operand 6 states. [2018-06-26 18:42:26,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:26,374 INFO ]: Finished difference Result 20 states and 57 transitions. [2018-06-26 18:42:26,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:42:26,375 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 18:42:26,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:26,383 INFO ]: With dead ends: 20 [2018-06-26 18:42:26,383 INFO ]: Without dead ends: 19 [2018-06-26 18:42:26,385 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:26,399 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 18:42:26,420 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-06-26 18:42:26,421 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:42:26,421 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-06-26 18:42:26,422 INFO ]: Start accepts. Automaton has 12 states and 31 transitions. Word has length 8 [2018-06-26 18:42:26,423 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:26,423 INFO ]: Abstraction has 12 states and 31 transitions. [2018-06-26 18:42:26,423 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:26,423 INFO ]: Start isEmpty. Operand 12 states and 31 transitions. [2018-06-26 18:42:26,424 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:26,424 INFO ]: Found error trace [2018-06-26 18:42:26,424 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:26,424 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:26,424 INFO ]: Analyzing trace with hash -335049340, now seen corresponding path program 1 times [2018-06-26 18:42:26,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:26,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:26,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:26,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,443 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:26,480 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:26,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:26,480 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:42:26,482 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:42:26,482 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:42:26,482 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:42:26,482 INFO ]: Start difference. First operand 12 states and 31 transitions. Second operand 4 states. [2018-06-26 18:42:26,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:26,644 INFO ]: Finished difference Result 18 states and 50 transitions. [2018-06-26 18:42:26,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:42:26,645 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-26 18:42:26,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:26,645 INFO ]: With dead ends: 18 [2018-06-26 18:42:26,645 INFO ]: Without dead ends: 18 [2018-06-26 18:42:26,646 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:26,647 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 18:42:26,649 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-26 18:42:26,649 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:42:26,650 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-06-26 18:42:26,652 INFO ]: Start accepts. Automaton has 14 states and 37 transitions. Word has length 9 [2018-06-26 18:42:26,652 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:26,652 INFO ]: Abstraction has 14 states and 37 transitions. [2018-06-26 18:42:26,652 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:42:26,652 INFO ]: Start isEmpty. Operand 14 states and 37 transitions. [2018-06-26 18:42:26,652 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:26,652 INFO ]: Found error trace [2018-06-26 18:42:26,652 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:26,652 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:26,653 INFO ]: Analyzing trace with hash 810116700, now seen corresponding path program 1 times [2018-06-26 18:42:26,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:26,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:26,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:26,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,671 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:26,738 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:26,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:26,738 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:26,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:26,792 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:26,798 INFO ]: Computing forward predicates... [2018-06-26 18:42:26,840 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:26,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:26,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:42:26,867 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:26,867 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:26,867 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:26,867 INFO ]: Start difference. First operand 14 states and 37 transitions. Second operand 5 states. [2018-06-26 18:42:26,951 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:26,951 INFO ]: Finished difference Result 23 states and 65 transitions. [2018-06-26 18:42:26,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:26,951 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 18:42:26,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:26,952 INFO ]: With dead ends: 23 [2018-06-26 18:42:26,952 INFO ]: Without dead ends: 20 [2018-06-26 18:42:26,952 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:26,952 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 18:42:26,955 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-26 18:42:26,955 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:42:26,955 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-06-26 18:42:26,956 INFO ]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 9 [2018-06-26 18:42:26,956 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:26,956 INFO ]: Abstraction has 17 states and 41 transitions. [2018-06-26 18:42:26,956 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:26,956 INFO ]: Start isEmpty. Operand 17 states and 41 transitions. [2018-06-26 18:42:26,956 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:26,956 INFO ]: Found error trace [2018-06-26 18:42:26,956 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:26,956 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:26,956 INFO ]: Analyzing trace with hash 838745851, now seen corresponding path program 1 times [2018-06-26 18:42:26,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:26,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:26,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:26,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,972 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,024 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:27,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:27,024 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:27,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:27,069 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,071 INFO ]: Computing forward predicates... [2018-06-26 18:42:27,078 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:27,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:27,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:42:27,111 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:27,112 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:27,112 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:27,112 INFO ]: Start difference. First operand 17 states and 41 transitions. Second operand 5 states. [2018-06-26 18:42:27,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:27,498 INFO ]: Finished difference Result 23 states and 58 transitions. [2018-06-26 18:42:27,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:27,498 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 18:42:27,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:27,499 INFO ]: With dead ends: 23 [2018-06-26 18:42:27,499 INFO ]: Without dead ends: 21 [2018-06-26 18:42:27,500 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:27,500 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:42:27,502 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-26 18:42:27,502 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:42:27,503 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2018-06-26 18:42:27,503 INFO ]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 9 [2018-06-26 18:42:27,503 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:27,503 INFO ]: Abstraction has 18 states and 42 transitions. [2018-06-26 18:42:27,503 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:27,503 INFO ]: Start isEmpty. Operand 18 states and 42 transitions. [2018-06-26 18:42:27,504 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:27,504 INFO ]: Found error trace [2018-06-26 18:42:27,504 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:27,504 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:27,504 INFO ]: Analyzing trace with hash 861833876, now seen corresponding path program 1 times [2018-06-26 18:42:27,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:27,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:27,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:27,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:27,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:27,518 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,558 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:27,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:27,558 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:27,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:27,598 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,600 INFO ]: Computing forward predicates... [2018-06-26 18:42:27,607 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:27,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:27,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:42:27,646 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:27,646 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:27,646 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:27,646 INFO ]: Start difference. First operand 18 states and 42 transitions. Second operand 6 states. [2018-06-26 18:42:27,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:27,733 INFO ]: Finished difference Result 22 states and 54 transitions. [2018-06-26 18:42:27,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:42:27,734 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 18:42:27,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:27,734 INFO ]: With dead ends: 22 [2018-06-26 18:42:27,735 INFO ]: Without dead ends: 21 [2018-06-26 18:42:27,735 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:27,735 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:42:27,737 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-26 18:42:27,737 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:42:27,737 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 42 transitions. [2018-06-26 18:42:27,738 INFO ]: Start accepts. Automaton has 19 states and 42 transitions. Word has length 9 [2018-06-26 18:42:27,738 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:27,738 INFO ]: Abstraction has 19 states and 42 transitions. [2018-06-26 18:42:27,738 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:27,738 INFO ]: Start isEmpty. Operand 19 states and 42 transitions. [2018-06-26 18:42:27,738 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:27,738 INFO ]: Found error trace [2018-06-26 18:42:27,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:27,738 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:27,738 INFO ]: Analyzing trace with hash 862757397, now seen corresponding path program 1 times [2018-06-26 18:42:27,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:27,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:27,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:27,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:27,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:27,755 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,824 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:27,824 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:27,824 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:27,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:27,853 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,854 INFO ]: Computing forward predicates... [2018-06-26 18:42:27,998 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:28,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:28,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-26 18:42:28,017 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:28,017 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:28,017 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:28,017 INFO ]: Start difference. First operand 19 states and 42 transitions. Second operand 8 states. [2018-06-26 18:42:28,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:28,196 INFO ]: Finished difference Result 29 states and 71 transitions. [2018-06-26 18:42:28,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:42:28,198 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 18:42:28,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:28,198 INFO ]: With dead ends: 29 [2018-06-26 18:42:28,198 INFO ]: Without dead ends: 24 [2018-06-26 18:42:28,199 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:28,199 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:42:28,201 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-06-26 18:42:28,201 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:42:28,202 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2018-06-26 18:42:28,202 INFO ]: Start accepts. Automaton has 19 states and 45 transitions. Word has length 9 [2018-06-26 18:42:28,202 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:28,202 INFO ]: Abstraction has 19 states and 45 transitions. [2018-06-26 18:42:28,202 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:28,202 INFO ]: Start isEmpty. Operand 19 states and 45 transitions. [2018-06-26 18:42:28,202 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:28,202 INFO ]: Found error trace [2018-06-26 18:42:28,203 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:28,203 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:28,203 INFO ]: Analyzing trace with hash -1967505593, now seen corresponding path program 1 times [2018-06-26 18:42:28,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:28,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:28,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:28,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,213 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:28,389 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:28,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:28,389 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:28,389 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:28,389 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:28,389 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:28,389 INFO ]: Start difference. First operand 19 states and 45 transitions. Second operand 5 states. [2018-06-26 18:42:28,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:28,482 INFO ]: Finished difference Result 23 states and 52 transitions. [2018-06-26 18:42:28,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:28,483 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 18:42:28,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:28,483 INFO ]: With dead ends: 23 [2018-06-26 18:42:28,483 INFO ]: Without dead ends: 23 [2018-06-26 18:42:28,483 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:28,483 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:42:28,487 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-26 18:42:28,487 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:42:28,487 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. [2018-06-26 18:42:28,487 INFO ]: Start accepts. Automaton has 21 states and 47 transitions. Word has length 9 [2018-06-26 18:42:28,487 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:28,487 INFO ]: Abstraction has 21 states and 47 transitions. [2018-06-26 18:42:28,487 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:28,487 INFO ]: Start isEmpty. Operand 21 states and 47 transitions. [2018-06-26 18:42:28,488 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:42:28,488 INFO ]: Found error trace [2018-06-26 18:42:28,488 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:28,488 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:28,488 INFO ]: Analyzing trace with hash 1666356806, now seen corresponding path program 1 times [2018-06-26 18:42:28,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:28,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:28,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:28,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,498 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:28,536 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:28,536 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:28,536 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:28,537 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:28,537 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:28,537 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:28,537 INFO ]: Start difference. First operand 21 states and 47 transitions. Second operand 5 states. [2018-06-26 18:42:28,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:28,601 INFO ]: Finished difference Result 28 states and 61 transitions. [2018-06-26 18:42:28,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:28,602 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-26 18:42:28,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:28,603 INFO ]: With dead ends: 28 [2018-06-26 18:42:28,603 INFO ]: Without dead ends: 26 [2018-06-26 18:42:28,603 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:28,603 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:42:28,606 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-26 18:42:28,606 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:42:28,606 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2018-06-26 18:42:28,606 INFO ]: Start accepts. Automaton has 23 states and 50 transitions. Word has length 10 [2018-06-26 18:42:28,606 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:28,606 INFO ]: Abstraction has 23 states and 50 transitions. [2018-06-26 18:42:28,606 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:28,607 INFO ]: Start isEmpty. Operand 23 states and 50 transitions. [2018-06-26 18:42:28,607 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:42:28,607 INFO ]: Found error trace [2018-06-26 18:42:28,607 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:28,607 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:28,607 INFO ]: Analyzing trace with hash -862712130, now seen corresponding path program 1 times [2018-06-26 18:42:28,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:28,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:28,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:28,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,626 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:28,783 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:28,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:28,783 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:28,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:28,820 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:28,824 INFO ]: Computing forward predicates... [2018-06-26 18:42:29,218 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:29,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:29,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:42:29,237 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:42:29,237 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:42:29,238 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:42:29,238 INFO ]: Start difference. First operand 23 states and 50 transitions. Second operand 14 states. [2018-06-26 18:42:29,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:29,773 INFO ]: Finished difference Result 53 states and 123 transitions. [2018-06-26 18:42:29,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:42:29,773 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-26 18:42:29,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:29,774 INFO ]: With dead ends: 53 [2018-06-26 18:42:29,774 INFO ]: Without dead ends: 51 [2018-06-26 18:42:29,774 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:29,775 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:42:29,778 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 25. [2018-06-26 18:42:29,778 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:42:29,779 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2018-06-26 18:42:29,779 INFO ]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 10 [2018-06-26 18:42:29,779 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:29,779 INFO ]: Abstraction has 25 states and 53 transitions. [2018-06-26 18:42:29,779 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:42:29,779 INFO ]: Start isEmpty. Operand 25 states and 53 transitions. [2018-06-26 18:42:29,780 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:42:29,780 INFO ]: Found error trace [2018-06-26 18:42:29,780 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:29,780 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:29,780 INFO ]: Analyzing trace with hash 1959621149, now seen corresponding path program 1 times [2018-06-26 18:42:29,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:29,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:29,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:29,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:29,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:29,796 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:29,837 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:29,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:29,837 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:42:29,837 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:42:29,837 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:42:29,837 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:42:29,837 INFO ]: Start difference. First operand 25 states and 53 transitions. Second operand 4 states. [2018-06-26 18:42:29,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:29,866 INFO ]: Finished difference Result 28 states and 61 transitions. [2018-06-26 18:42:29,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:42:29,869 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-26 18:42:29,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:29,870 INFO ]: With dead ends: 28 [2018-06-26 18:42:29,870 INFO ]: Without dead ends: 28 [2018-06-26 18:42:29,870 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:29,870 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:42:29,872 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-26 18:42:29,872 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:42:29,874 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2018-06-26 18:42:29,875 INFO ]: Start accepts. Automaton has 26 states and 56 transitions. Word has length 11 [2018-06-26 18:42:29,875 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:29,875 INFO ]: Abstraction has 26 states and 56 transitions. [2018-06-26 18:42:29,875 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:42:29,875 INFO ]: Start isEmpty. Operand 26 states and 56 transitions. [2018-06-26 18:42:29,875 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:42:29,875 INFO ]: Found error trace [2018-06-26 18:42:29,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:29,875 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:29,875 INFO ]: Analyzing trace with hash 1717881695, now seen corresponding path program 1 times [2018-06-26 18:42:29,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:29,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:29,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:29,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:29,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:29,885 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:29,916 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:29,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:29,917 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:29,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:29,945 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:29,946 INFO ]: Computing forward predicates... [2018-06-26 18:42:29,952 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:29,972 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:29,972 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:42:29,973 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:29,973 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:29,973 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:29,973 INFO ]: Start difference. First operand 26 states and 56 transitions. Second operand 6 states. [2018-06-26 18:42:30,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:30,029 INFO ]: Finished difference Result 47 states and 110 transitions. [2018-06-26 18:42:30,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:42:30,030 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-26 18:42:30,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:30,031 INFO ]: With dead ends: 47 [2018-06-26 18:42:30,031 INFO ]: Without dead ends: 44 [2018-06-26 18:42:30,031 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:30,031 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 18:42:30,034 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-26 18:42:30,034 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:42:30,035 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 65 transitions. [2018-06-26 18:42:30,035 INFO ]: Start accepts. Automaton has 31 states and 65 transitions. Word has length 11 [2018-06-26 18:42:30,035 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:30,035 INFO ]: Abstraction has 31 states and 65 transitions. [2018-06-26 18:42:30,035 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:30,035 INFO ]: Start isEmpty. Operand 31 states and 65 transitions. [2018-06-26 18:42:30,036 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:42:30,036 INFO ]: Found error trace [2018-06-26 18:42:30,036 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:30,036 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:30,036 INFO ]: Analyzing trace with hash -973853145, now seen corresponding path program 2 times [2018-06-26 18:42:30,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:30,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:30,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:30,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,046 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,118 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:30,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:30,118 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:30,125 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:30,165 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:30,165 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,166 INFO ]: Computing forward predicates... [2018-06-26 18:42:30,172 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:30,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:30,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:42:30,204 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:30,204 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:30,204 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:30,205 INFO ]: Start difference. First operand 31 states and 65 transitions. Second operand 6 states. [2018-06-26 18:42:30,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:30,273 INFO ]: Finished difference Result 44 states and 101 transitions. [2018-06-26 18:42:30,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:42:30,275 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-26 18:42:30,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:30,275 INFO ]: With dead ends: 44 [2018-06-26 18:42:30,275 INFO ]: Without dead ends: 38 [2018-06-26 18:42:30,276 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:30,276 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 18:42:30,280 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-26 18:42:30,280 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:42:30,280 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 71 transitions. [2018-06-26 18:42:30,281 INFO ]: Start accepts. Automaton has 32 states and 71 transitions. Word has length 11 [2018-06-26 18:42:30,281 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:30,281 INFO ]: Abstraction has 32 states and 71 transitions. [2018-06-26 18:42:30,281 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:30,281 INFO ]: Start isEmpty. Operand 32 states and 71 transitions. [2018-06-26 18:42:30,281 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:42:30,281 INFO ]: Found error trace [2018-06-26 18:42:30,281 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:30,281 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:30,281 INFO ]: Analyzing trace with hash -190899235, now seen corresponding path program 1 times [2018-06-26 18:42:30,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:30,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:30,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,282 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:30,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,293 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,414 INFO ]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:30,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:30,414 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:30,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:30,439 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,440 INFO ]: Computing forward predicates... [2018-06-26 18:42:30,472 INFO ]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:30,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:30,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-06-26 18:42:30,506 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:42:30,506 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:42:30,506 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:30,507 INFO ]: Start difference. First operand 32 states and 71 transitions. Second operand 9 states. [2018-06-26 18:42:30,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:30,785 INFO ]: Finished difference Result 54 states and 128 transitions. [2018-06-26 18:42:30,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:42:30,785 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-26 18:42:30,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:30,786 INFO ]: With dead ends: 54 [2018-06-26 18:42:30,786 INFO ]: Without dead ends: 48 [2018-06-26 18:42:30,786 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:42:30,786 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 18:42:30,791 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-26 18:42:30,791 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:42:30,791 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 74 transitions. [2018-06-26 18:42:30,791 INFO ]: Start accepts. Automaton has 34 states and 74 transitions. Word has length 12 [2018-06-26 18:42:30,791 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:30,791 INFO ]: Abstraction has 34 states and 74 transitions. [2018-06-26 18:42:30,791 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:42:30,791 INFO ]: Start isEmpty. Operand 34 states and 74 transitions. [2018-06-26 18:42:30,792 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:42:30,792 INFO ]: Found error trace [2018-06-26 18:42:30,792 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:30,792 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:30,792 INFO ]: Analyzing trace with hash -190839653, now seen corresponding path program 1 times [2018-06-26 18:42:30,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:30,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:30,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:30,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,802 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,847 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:30,847 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:30,847 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:42:30,847 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:42:30,847 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:42:30,847 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:42:30,847 INFO ]: Start difference. First operand 34 states and 74 transitions. Second operand 3 states. [2018-06-26 18:42:30,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:30,894 INFO ]: Finished difference Result 35 states and 75 transitions. [2018-06-26 18:42:30,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:42:30,895 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 18:42:30,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:30,895 INFO ]: With dead ends: 35 [2018-06-26 18:42:30,895 INFO ]: Without dead ends: 24 [2018-06-26 18:42:30,896 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:42:30,896 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:42:30,897 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-26 18:42:30,897 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:42:30,898 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2018-06-26 18:42:30,898 INFO ]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 12 [2018-06-26 18:42:30,898 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:30,898 INFO ]: Abstraction has 23 states and 48 transitions. [2018-06-26 18:42:30,898 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:42:30,898 INFO ]: Start isEmpty. Operand 23 states and 48 transitions. [2018-06-26 18:42:30,898 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:42:30,898 INFO ]: Found error trace [2018-06-26 18:42:30,899 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:30,899 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:30,899 INFO ]: Analyzing trace with hash -2008421111, now seen corresponding path program 2 times [2018-06-26 18:42:30,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:30,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:30,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:30,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,908 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,969 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:30,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:30,970 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:30,970 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:30,970 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:30,970 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:30,970 INFO ]: Start difference. First operand 23 states and 48 transitions. Second operand 5 states. [2018-06-26 18:42:30,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:30,999 INFO ]: Finished difference Result 26 states and 53 transitions. [2018-06-26 18:42:31,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:31,002 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-26 18:42:31,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:31,002 INFO ]: With dead ends: 26 [2018-06-26 18:42:31,002 INFO ]: Without dead ends: 26 [2018-06-26 18:42:31,003 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:31,003 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:42:31,004 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-26 18:42:31,004 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:42:31,005 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-26 18:42:31,005 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 12 [2018-06-26 18:42:31,005 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:31,005 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-26 18:42:31,005 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:31,005 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-26 18:42:31,005 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:42:31,005 INFO ]: Found error trace [2018-06-26 18:42:31,005 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:31,005 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:31,005 INFO ]: Analyzing trace with hash -2131903118, now seen corresponding path program 1 times [2018-06-26 18:42:31,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:31,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:31,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,006 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:31,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,015 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,131 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:31,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:31,131 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:31,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:31,171 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,172 INFO ]: Computing forward predicates... [2018-06-26 18:42:31,178 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:31,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:31,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:42:31,198 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:31,198 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:31,198 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:31,198 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 6 states. [2018-06-26 18:42:31,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:31,258 INFO ]: Finished difference Result 47 states and 104 transitions. [2018-06-26 18:42:31,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:42:31,259 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-26 18:42:31,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:31,260 INFO ]: With dead ends: 47 [2018-06-26 18:42:31,260 INFO ]: Without dead ends: 47 [2018-06-26 18:42:31,260 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:31,260 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 18:42:31,266 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-06-26 18:42:31,266 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:42:31,266 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2018-06-26 18:42:31,266 INFO ]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 13 [2018-06-26 18:42:31,266 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:31,266 INFO ]: Abstraction has 28 states and 58 transitions. [2018-06-26 18:42:31,266 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:31,266 INFO ]: Start isEmpty. Operand 28 states and 58 transitions. [2018-06-26 18:42:31,267 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:42:31,267 INFO ]: Found error trace [2018-06-26 18:42:31,267 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:31,267 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:31,267 INFO ]: Analyzing trace with hash 1067177397, now seen corresponding path program 1 times [2018-06-26 18:42:31,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:31,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:31,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:31,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,380 INFO ]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:31,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:31,380 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-26 18:42:31,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:31,412 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,413 INFO ]: Computing forward predicates... [2018-06-26 18:42:31,431 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:31,451 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:31,451 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-06-26 18:42:31,451 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:31,451 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:31,451 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:31,451 INFO ]: Start difference. First operand 28 states and 58 transitions. Second operand 8 states. [2018-06-26 18:42:31,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:31,521 INFO ]: Finished difference Result 31 states and 65 transitions. [2018-06-26 18:42:31,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:42:31,521 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-26 18:42:31,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:31,521 INFO ]: With dead ends: 31 [2018-06-26 18:42:31,521 INFO ]: Without dead ends: 31 [2018-06-26 18:42:31,522 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:31,522 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 18:42:31,523 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 18:42:31,524 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:42:31,524 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 65 transitions. [2018-06-26 18:42:31,524 INFO ]: Start accepts. Automaton has 31 states and 65 transitions. Word has length 13 [2018-06-26 18:42:31,524 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:31,524 INFO ]: Abstraction has 31 states and 65 transitions. [2018-06-26 18:42:31,524 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:31,524 INFO ]: Start isEmpty. Operand 31 states and 65 transitions. [2018-06-26 18:42:31,525 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:31,525 INFO ]: Found error trace [2018-06-26 18:42:31,525 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:31,525 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:31,525 INFO ]: Analyzing trace with hash 1320954074, now seen corresponding path program 1 times [2018-06-26 18:42:31,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:31,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:31,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:31,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,539 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,738 INFO ]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:31,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:31,738 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:31,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:31,779 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,783 INFO ]: Computing forward predicates... [2018-06-26 18:42:32,140 WARN ]: Spent 193.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-06-26 18:42:32,468 INFO ]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:32,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:32,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-26 18:42:32,489 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:42:32,489 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:42:32,489 INFO ]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:42:32,489 INFO ]: Start difference. First operand 31 states and 65 transitions. Second operand 19 states. [2018-06-26 18:42:34,538 WARN ]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-06-26 18:42:34,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:34,656 INFO ]: Finished difference Result 122 states and 304 transitions. [2018-06-26 18:42:34,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:42:34,657 INFO ]: Start accepts. Automaton has 19 states. Word has length 14 [2018-06-26 18:42:34,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:34,658 INFO ]: With dead ends: 122 [2018-06-26 18:42:34,658 INFO ]: Without dead ends: 116 [2018-06-26 18:42:34,659 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:42:34,659 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-26 18:42:34,663 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 45. [2018-06-26 18:42:34,663 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:42:34,667 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 105 transitions. [2018-06-26 18:42:34,667 INFO ]: Start accepts. Automaton has 45 states and 105 transitions. Word has length 14 [2018-06-26 18:42:34,667 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:34,667 INFO ]: Abstraction has 45 states and 105 transitions. [2018-06-26 18:42:34,667 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:42:34,667 INFO ]: Start isEmpty. Operand 45 states and 105 transitions. [2018-06-26 18:42:34,668 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:34,668 INFO ]: Found error trace [2018-06-26 18:42:34,668 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:34,668 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:34,668 INFO ]: Analyzing trace with hash -1199005860, now seen corresponding path program 2 times [2018-06-26 18:42:34,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:34,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:34,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:34,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:34,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:34,680 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:34,807 INFO ]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:34,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:34,834 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:34,839 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:34,861 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:34,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:34,863 INFO ]: Computing forward predicates... [2018-06-26 18:42:34,876 INFO ]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:34,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:34,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-26 18:42:34,895 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:42:34,896 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:42:34,896 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:34,896 INFO ]: Start difference. First operand 45 states and 105 transitions. Second operand 10 states. [2018-06-26 18:42:35,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:35,008 INFO ]: Finished difference Result 65 states and 157 transitions. [2018-06-26 18:42:35,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:42:35,008 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-26 18:42:35,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:35,009 INFO ]: With dead ends: 65 [2018-06-26 18:42:35,009 INFO ]: Without dead ends: 61 [2018-06-26 18:42:35,009 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:35,009 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 18:42:35,014 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-06-26 18:42:35,014 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:42:35,015 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 117 transitions. [2018-06-26 18:42:35,015 INFO ]: Start accepts. Automaton has 51 states and 117 transitions. Word has length 14 [2018-06-26 18:42:35,015 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:35,015 INFO ]: Abstraction has 51 states and 117 transitions. [2018-06-26 18:42:35,015 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:42:35,015 INFO ]: Start isEmpty. Operand 51 states and 117 transitions. [2018-06-26 18:42:35,015 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:35,015 INFO ]: Found error trace [2018-06-26 18:42:35,016 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:35,016 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:35,016 INFO ]: Analyzing trace with hash -1639645472, now seen corresponding path program 1 times [2018-06-26 18:42:35,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:35,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:35,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:35,016 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:35,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:35,025 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:35,392 INFO ]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:35,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:35,392 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:35,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:35,417 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:35,418 INFO ]: Computing forward predicates... [2018-06-26 18:42:35,422 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:42:35,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:35,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 18:42:35,443 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:42:35,443 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:42:35,443 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:35,443 INFO ]: Start difference. First operand 51 states and 117 transitions. Second operand 7 states. [2018-06-26 18:42:35,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:35,498 INFO ]: Finished difference Result 54 states and 123 transitions. [2018-06-26 18:42:35,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:42:35,499 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-26 18:42:35,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:35,500 INFO ]: With dead ends: 54 [2018-06-26 18:42:35,500 INFO ]: Without dead ends: 53 [2018-06-26 18:42:35,500 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:35,500 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 18:42:35,503 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-06-26 18:42:35,503 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-26 18:42:35,504 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2018-06-26 18:42:35,504 INFO ]: Start accepts. Automaton has 52 states and 118 transitions. Word has length 14 [2018-06-26 18:42:35,504 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:35,504 INFO ]: Abstraction has 52 states and 118 transitions. [2018-06-26 18:42:35,504 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:42:35,505 INFO ]: Start isEmpty. Operand 52 states and 118 transitions. [2018-06-26 18:42:35,505 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:35,505 INFO ]: Found error trace [2018-06-26 18:42:35,505 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:35,505 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:35,505 INFO ]: Analyzing trace with hash -1639615681, now seen corresponding path program 1 times [2018-06-26 18:42:35,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:35,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:35,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:35,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:35,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:35,514 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:35,858 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-26 18:42:36,055 INFO ]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:36,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:36,055 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:36,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:36,098 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:36,100 INFO ]: Computing forward predicates... [2018-06-26 18:42:36,405 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:42:36,424 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:42:36,424 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-06-26 18:42:36,425 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:42:36,425 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:42:36,425 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:42:36,425 INFO ]: Start difference. First operand 52 states and 118 transitions. Second operand 12 states. [2018-06-26 18:42:36,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:36,682 INFO ]: Finished difference Result 54 states and 122 transitions. [2018-06-26 18:42:36,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:42:36,682 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 18:42:36,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:36,682 INFO ]: With dead ends: 54 [2018-06-26 18:42:36,682 INFO ]: Without dead ends: 47 [2018-06-26 18:42:36,682 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:36,683 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 18:42:36,685 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-26 18:42:36,685 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:42:36,685 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2018-06-26 18:42:36,686 INFO ]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 14 [2018-06-26 18:42:36,686 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:36,686 INFO ]: Abstraction has 45 states and 106 transitions. [2018-06-26 18:42:36,686 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:42:36,686 INFO ]: Start isEmpty. Operand 45 states and 106 transitions. [2018-06-26 18:42:36,686 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:42:36,686 INFO ]: Found error trace [2018-06-26 18:42:36,686 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:36,686 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:36,687 INFO ]: Analyzing trace with hash 177661705, now seen corresponding path program 1 times [2018-06-26 18:42:36,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:36,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:36,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:36,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:36,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:36,699 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:37,088 INFO ]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:42:37,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:37,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:37,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:37,128 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:37,130 INFO ]: Computing forward predicates... [2018-06-26 18:42:37,169 INFO ]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:37,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:37,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-26 18:42:37,188 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:42:37,189 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:42:37,189 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:42:37,189 INFO ]: Start difference. First operand 45 states and 106 transitions. Second operand 12 states. [2018-06-26 18:42:37,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:37,545 INFO ]: Finished difference Result 103 states and 224 transitions. [2018-06-26 18:42:37,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:42:37,546 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-26 18:42:37,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:37,547 INFO ]: With dead ends: 103 [2018-06-26 18:42:37,547 INFO ]: Without dead ends: 76 [2018-06-26 18:42:37,547 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:42:37,547 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-26 18:42:37,549 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 51. [2018-06-26 18:42:37,549 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:42:37,549 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 106 transitions. [2018-06-26 18:42:37,549 INFO ]: Start accepts. Automaton has 51 states and 106 transitions. Word has length 15 [2018-06-26 18:42:37,550 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:37,550 INFO ]: Abstraction has 51 states and 106 transitions. [2018-06-26 18:42:37,550 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:42:37,550 INFO ]: Start isEmpty. Operand 51 states and 106 transitions. [2018-06-26 18:42:37,550 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:42:37,550 INFO ]: Found error trace [2018-06-26 18:42:37,550 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:37,550 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:37,550 INFO ]: Analyzing trace with hash 1559642057, now seen corresponding path program 1 times [2018-06-26 18:42:37,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:37,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:37,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:37,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:37,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:37,570 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:37,994 INFO ]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:37,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:37,994 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) [2018-06-26 18:42:38,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:38,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:38,049 INFO ]: Computing forward predicates... [2018-06-26 18:42:38,378 INFO ]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:38,409 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:38,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-06-26 18:42:38,410 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:42:38,410 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:42:38,410 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:38,410 INFO ]: Start difference. First operand 51 states and 106 transitions. Second operand 10 states. [2018-06-26 18:42:38,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:38,552 INFO ]: Finished difference Result 57 states and 108 transitions. [2018-06-26 18:42:38,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:42:38,552 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-26 18:42:38,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:38,552 INFO ]: With dead ends: 57 [2018-06-26 18:42:38,552 INFO ]: Without dead ends: 55 [2018-06-26 18:42:38,553 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:38,553 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 18:42:38,554 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-06-26 18:42:38,554 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 18:42:38,555 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 81 transitions. [2018-06-26 18:42:38,555 INFO ]: Start accepts. Automaton has 45 states and 81 transitions. Word has length 15 [2018-06-26 18:42:38,555 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:38,555 INFO ]: Abstraction has 45 states and 81 transitions. [2018-06-26 18:42:38,555 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:42:38,555 INFO ]: Start isEmpty. Operand 45 states and 81 transitions. [2018-06-26 18:42:38,556 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:42:38,556 INFO ]: Found error trace [2018-06-26 18:42:38,556 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:38,556 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:38,556 INFO ]: Analyzing trace with hash 569467318, now seen corresponding path program 1 times [2018-06-26 18:42:38,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:38,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:38,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:38,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:38,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:38,565 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:38,603 INFO ]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:38,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:38,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:38,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:38,633 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:38,635 INFO ]: Computing forward predicates... [2018-06-26 18:42:38,650 INFO ]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:42:38,668 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:42:38,669 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-26 18:42:38,669 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:42:38,669 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:42:38,669 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:38,669 INFO ]: Start difference. First operand 45 states and 81 transitions. Second operand 7 states. [2018-06-26 18:42:38,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:38,720 INFO ]: Finished difference Result 46 states and 77 transitions. [2018-06-26 18:42:38,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:42:38,721 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-26 18:42:38,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:38,721 INFO ]: With dead ends: 46 [2018-06-26 18:42:38,721 INFO ]: Without dead ends: 46 [2018-06-26 18:42:38,721 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:38,721 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 18:42:38,723 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-06-26 18:42:38,723 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:42:38,723 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2018-06-26 18:42:38,723 INFO ]: Start accepts. Automaton has 41 states and 69 transitions. Word has length 15 [2018-06-26 18:42:38,723 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:38,723 INFO ]: Abstraction has 41 states and 69 transitions. [2018-06-26 18:42:38,723 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:42:38,724 INFO ]: Start isEmpty. Operand 41 states and 69 transitions. [2018-06-26 18:42:38,724 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:42:38,724 INFO ]: Found error trace [2018-06-26 18:42:38,724 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:38,724 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:38,724 INFO ]: Analyzing trace with hash 598096469, now seen corresponding path program 2 times [2018-06-26 18:42:38,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:38,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:38,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:38,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:38,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:38,736 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:39,109 INFO ]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:39,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:39,110 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:39,116 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:39,138 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:39,138 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:39,140 INFO ]: Computing forward predicates... [2018-06-26 18:42:39,285 INFO ]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:39,316 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:39,316 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2018-06-26 18:42:39,316 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:42:39,317 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:42:39,317 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:42:39,317 INFO ]: Start difference. First operand 41 states and 69 transitions. Second operand 12 states. [2018-06-26 18:42:39,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:39,463 INFO ]: Finished difference Result 88 states and 145 transitions. [2018-06-26 18:42:39,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:42:39,464 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-26 18:42:39,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:39,464 INFO ]: With dead ends: 88 [2018-06-26 18:42:39,464 INFO ]: Without dead ends: 63 [2018-06-26 18:42:39,464 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:39,464 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-26 18:42:39,466 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-06-26 18:42:39,466 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-26 18:42:39,466 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-06-26 18:42:39,466 INFO ]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 15 [2018-06-26 18:42:39,466 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:39,466 INFO ]: Abstraction has 46 states and 75 transitions. [2018-06-26 18:42:39,466 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:42:39,466 INFO ]: Start isEmpty. Operand 46 states and 75 transitions. [2018-06-26 18:42:39,467 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:42:39,467 INFO ]: Found error trace [2018-06-26 18:42:39,467 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:39,467 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:39,467 INFO ]: Analyzing trace with hash 1103997427, now seen corresponding path program 2 times [2018-06-26 18:42:39,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:39,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:39,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:39,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:39,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:39,478 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:39,880 INFO ]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:39,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:39,938 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:39,944 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:39,969 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:39,969 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:39,971 INFO ]: Computing forward predicates... [2018-06-26 18:42:40,060 INFO ]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:40,078 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:40,078 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-06-26 18:42:40,079 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:42:40,079 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:42:40,079 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:40,079 INFO ]: Start difference. First operand 46 states and 75 transitions. Second operand 13 states. [2018-06-26 18:42:40,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:40,321 INFO ]: Finished difference Result 72 states and 122 transitions. [2018-06-26 18:42:40,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:42:40,321 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-26 18:42:40,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:40,322 INFO ]: With dead ends: 72 [2018-06-26 18:42:40,322 INFO ]: Without dead ends: 51 [2018-06-26 18:42:40,322 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:42:40,322 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:42:40,324 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-26 18:42:40,324 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 18:42:40,324 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2018-06-26 18:42:40,324 INFO ]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 16 [2018-06-26 18:42:40,324 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:40,324 INFO ]: Abstraction has 43 states and 69 transitions. [2018-06-26 18:42:40,324 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:42:40,324 INFO ]: Start isEmpty. Operand 43 states and 69 transitions. [2018-06-26 18:42:40,325 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:42:40,325 INFO ]: Found error trace [2018-06-26 18:42:40,325 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:40,325 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:40,325 INFO ]: Analyzing trace with hash 1278322773, now seen corresponding path program 1 times [2018-06-26 18:42:40,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:40,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:40,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:40,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,334 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:40,397 INFO ]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:40,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:40,397 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-26 18:42:40,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:40,425 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:40,426 INFO ]: Computing forward predicates... [2018-06-26 18:42:40,450 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:40,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:40,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-26 18:42:40,470 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:40,470 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:40,470 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:40,470 INFO ]: Start difference. First operand 43 states and 69 transitions. Second operand 11 states. [2018-06-26 18:42:40,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:40,576 INFO ]: Finished difference Result 45 states and 73 transitions. [2018-06-26 18:42:40,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:42:40,576 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-26 18:42:40,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:40,577 INFO ]: With dead ends: 45 [2018-06-26 18:42:40,577 INFO ]: Without dead ends: 41 [2018-06-26 18:42:40,577 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:42:40,577 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 18:42:40,578 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-06-26 18:42:40,578 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:42:40,578 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 56 transitions. [2018-06-26 18:42:40,578 INFO ]: Start accepts. Automaton has 34 states and 56 transitions. Word has length 16 [2018-06-26 18:42:40,578 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:40,578 INFO ]: Abstraction has 34 states and 56 transitions. [2018-06-26 18:42:40,578 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:40,578 INFO ]: Start isEmpty. Operand 34 states and 56 transitions. [2018-06-26 18:42:40,579 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:42:40,579 INFO ]: Found error trace [2018-06-26 18:42:40,579 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:40,579 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:40,579 INFO ]: Analyzing trace with hash -723473862, now seen corresponding path program 2 times [2018-06-26 18:42:40,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:40,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:40,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:40,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:40,764 INFO ]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 18:42:40,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:40,764 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:40,769 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:40,795 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:40,795 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:40,797 INFO ]: Computing forward predicates... [2018-06-26 18:42:40,831 INFO ]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:40,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:40,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-26 18:42:40,850 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:40,851 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:40,851 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:40,851 INFO ]: Start difference. First operand 34 states and 56 transitions. Second operand 11 states. [2018-06-26 18:42:40,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:40,947 INFO ]: Finished difference Result 40 states and 68 transitions. [2018-06-26 18:42:40,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:42:40,948 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-26 18:42:40,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:40,948 INFO ]: With dead ends: 40 [2018-06-26 18:42:40,948 INFO ]: Without dead ends: 40 [2018-06-26 18:42:40,948 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:42:40,948 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 18:42:40,949 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-26 18:42:40,949 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 18:42:40,949 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-06-26 18:42:40,950 INFO ]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 17 [2018-06-26 18:42:40,950 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:40,950 INFO ]: Abstraction has 36 states and 60 transitions. [2018-06-26 18:42:40,950 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:40,950 INFO ]: Start isEmpty. Operand 36 states and 60 transitions. [2018-06-26 18:42:40,950 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:42:40,950 INFO ]: Found error trace [2018-06-26 18:42:40,950 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:40,950 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:40,950 INFO ]: Analyzing trace with hash -587634271, now seen corresponding path program 2 times [2018-06-26 18:42:40,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:40,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:40,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,951 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:40,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,964 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:41,044 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:41,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:41,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:41,049 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:41,082 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:41,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:41,084 INFO ]: Computing forward predicates... [2018-06-26 18:42:41,089 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:41,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:41,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:42:41,110 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:41,110 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:41,110 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:41,110 INFO ]: Start difference. First operand 36 states and 60 transitions. Second operand 8 states. [2018-06-26 18:42:41,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:41,187 INFO ]: Finished difference Result 68 states and 115 transitions. [2018-06-26 18:42:41,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:42:41,187 INFO ]: Start accepts. Automaton has 8 states. Word has length 18 [2018-06-26 18:42:41,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:41,188 INFO ]: With dead ends: 68 [2018-06-26 18:42:41,188 INFO ]: Without dead ends: 68 [2018-06-26 18:42:41,188 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:42:41,188 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 18:42:41,190 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-06-26 18:42:41,190 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:42:41,190 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2018-06-26 18:42:41,190 INFO ]: Start accepts. Automaton has 41 states and 69 transitions. Word has length 18 [2018-06-26 18:42:41,190 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:41,191 INFO ]: Abstraction has 41 states and 69 transitions. [2018-06-26 18:42:41,191 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:41,191 INFO ]: Start isEmpty. Operand 41 states and 69 transitions. [2018-06-26 18:42:41,191 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:42:41,191 INFO ]: Found error trace [2018-06-26 18:42:41,191 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:41,191 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:41,191 INFO ]: Analyzing trace with hash -2119236802, now seen corresponding path program 3 times [2018-06-26 18:42:41,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:41,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:41,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:41,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:41,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:41,204 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:41,424 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:41,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:41,424 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:41,430 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:41,463 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:41,463 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:41,467 INFO ]: Computing forward predicates... [2018-06-26 18:42:42,187 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:42,206 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:42,206 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-26 18:42:42,206 INFO ]: Interpolant automaton has 23 states [2018-06-26 18:42:42,206 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 18:42:42,206 INFO ]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:42:42,206 INFO ]: Start difference. First operand 41 states and 69 transitions. Second operand 23 states. [2018-06-26 18:42:43,130 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-06-26 18:42:44,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:44,145 INFO ]: Finished difference Result 135 states and 239 transitions. [2018-06-26 18:42:44,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:42:44,147 INFO ]: Start accepts. Automaton has 23 states. Word has length 18 [2018-06-26 18:42:44,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:44,147 INFO ]: With dead ends: 135 [2018-06-26 18:42:44,147 INFO ]: Without dead ends: 129 [2018-06-26 18:42:44,148 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:42:44,148 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-26 18:42:44,151 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 56. [2018-06-26 18:42:44,151 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-26 18:42:44,152 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 100 transitions. [2018-06-26 18:42:44,152 INFO ]: Start accepts. Automaton has 56 states and 100 transitions. Word has length 18 [2018-06-26 18:42:44,152 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:44,152 INFO ]: Abstraction has 56 states and 100 transitions. [2018-06-26 18:42:44,152 INFO ]: Interpolant automaton has 23 states. [2018-06-26 18:42:44,152 INFO ]: Start isEmpty. Operand 56 states and 100 transitions. [2018-06-26 18:42:44,152 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:42:44,152 INFO ]: Found error trace [2018-06-26 18:42:44,152 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:44,152 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:44,153 INFO ]: Analyzing trace with hash -1439178432, now seen corresponding path program 3 times [2018-06-26 18:42:44,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:44,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:44,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:44,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:44,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:44,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:44,273 INFO ]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:44,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:44,273 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:44,279 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:44,354 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:44,354 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:44,356 INFO ]: Computing forward predicates... [2018-06-26 18:42:44,551 INFO ]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:44,569 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:44,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-26 18:42:44,570 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:42:44,570 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:42:44,570 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:42:44,570 INFO ]: Start difference. First operand 56 states and 100 transitions. Second operand 15 states. [2018-06-26 18:42:44,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:44,900 INFO ]: Finished difference Result 93 states and 162 transitions. [2018-06-26 18:42:44,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:42:44,902 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-26 18:42:44,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:44,902 INFO ]: With dead ends: 93 [2018-06-26 18:42:44,902 INFO ]: Without dead ends: 83 [2018-06-26 18:42:44,903 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 18:42:44,903 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-26 18:42:44,904 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 57. [2018-06-26 18:42:44,904 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-26 18:42:44,905 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 95 transitions. [2018-06-26 18:42:44,905 INFO ]: Start accepts. Automaton has 57 states and 95 transitions. Word has length 18 [2018-06-26 18:42:44,905 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:44,905 INFO ]: Abstraction has 57 states and 95 transitions. [2018-06-26 18:42:44,905 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:42:44,905 INFO ]: Start isEmpty. Operand 57 states and 95 transitions. [2018-06-26 18:42:44,905 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:42:44,905 INFO ]: Found error trace [2018-06-26 18:42:44,905 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:44,905 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:44,905 INFO ]: Analyzing trace with hash -953119326, now seen corresponding path program 3 times [2018-06-26 18:42:44,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:44,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:44,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:44,906 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:44,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:44,914 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:44,978 INFO ]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:44,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:44,978 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:44,986 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:45,019 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:45,020 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:45,021 INFO ]: Computing forward predicates... [2018-06-26 18:42:45,487 INFO ]: Checked inductivity of 18 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:42:45,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:45,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-26 18:42:45,507 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:42:45,507 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:42:45,507 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:42:45,507 INFO ]: Start difference. First operand 57 states and 95 transitions. Second operand 12 states. [2018-06-26 18:42:45,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:45,640 INFO ]: Finished difference Result 64 states and 108 transitions. [2018-06-26 18:42:45,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:42:45,642 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-26 18:42:45,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:45,643 INFO ]: With dead ends: 64 [2018-06-26 18:42:45,643 INFO ]: Without dead ends: 51 [2018-06-26 18:42:45,643 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:42:45,643 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:42:45,644 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-26 18:42:45,644 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 18:42:45,645 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2018-06-26 18:42:45,645 INFO ]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 18 [2018-06-26 18:42:45,645 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:45,645 INFO ]: Abstraction has 47 states and 79 transitions. [2018-06-26 18:42:45,645 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:42:45,645 INFO ]: Start isEmpty. Operand 47 states and 79 transitions. [2018-06-26 18:42:45,645 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:42:45,645 INFO ]: Found error trace [2018-06-26 18:42:45,645 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:45,645 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:45,645 INFO ]: Analyzing trace with hash 633165915, now seen corresponding path program 3 times [2018-06-26 18:42:45,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:45,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:45,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:45,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:45,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:45,658 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:45,803 INFO ]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:45,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:45,803 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:45,809 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:45,840 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:45,840 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:45,842 INFO ]: Computing forward predicates... [2018-06-26 18:42:45,850 INFO ]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:45,869 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:45,869 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 18:42:45,869 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:45,869 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:45,869 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:45,870 INFO ]: Start difference. First operand 47 states and 79 transitions. Second operand 11 states. [2018-06-26 18:42:45,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:45,957 INFO ]: Finished difference Result 91 states and 151 transitions. [2018-06-26 18:42:45,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:42:45,957 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-26 18:42:45,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:45,957 INFO ]: With dead ends: 91 [2018-06-26 18:42:45,957 INFO ]: Without dead ends: 76 [2018-06-26 18:42:45,957 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:42:45,957 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-26 18:42:45,959 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 57. [2018-06-26 18:42:45,959 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-26 18:42:45,960 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 93 transitions. [2018-06-26 18:42:45,960 INFO ]: Start accepts. Automaton has 57 states and 93 transitions. Word has length 19 [2018-06-26 18:42:45,960 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:45,960 INFO ]: Abstraction has 57 states and 93 transitions. [2018-06-26 18:42:45,960 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:45,960 INFO ]: Start isEmpty. Operand 57 states and 93 transitions. [2018-06-26 18:42:45,960 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:42:45,960 INFO ]: Found error trace [2018-06-26 18:42:45,960 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:45,960 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:45,960 INFO ]: Analyzing trace with hash 46359901, now seen corresponding path program 1 times [2018-06-26 18:42:45,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:45,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:45,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:45,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:45,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:45,972 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:46,144 INFO ]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:46,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:46,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:46,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:46,182 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:46,183 INFO ]: Computing forward predicates... [2018-06-26 18:42:46,303 INFO ]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:46,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:46,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-06-26 18:42:46,323 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:46,323 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:46,323 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:46,323 INFO ]: Start difference. First operand 57 states and 93 transitions. Second operand 11 states. [2018-06-26 18:42:46,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:46,458 INFO ]: Finished difference Result 86 states and 139 transitions. [2018-06-26 18:42:46,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:42:46,459 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-26 18:42:46,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:46,459 INFO ]: With dead ends: 86 [2018-06-26 18:42:46,459 INFO ]: Without dead ends: 86 [2018-06-26 18:42:46,459 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:42:46,459 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 18:42:46,461 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-06-26 18:42:46,461 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-26 18:42:46,462 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 107 transitions. [2018-06-26 18:42:46,462 INFO ]: Start accepts. Automaton has 65 states and 107 transitions. Word has length 19 [2018-06-26 18:42:46,462 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:46,462 INFO ]: Abstraction has 65 states and 107 transitions. [2018-06-26 18:42:46,462 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:46,462 INFO ]: Start isEmpty. Operand 65 states and 107 transitions. [2018-06-26 18:42:46,462 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:42:46,462 INFO ]: Found error trace [2018-06-26 18:42:46,462 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:46,462 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:46,463 INFO ]: Analyzing trace with hash 481321959, now seen corresponding path program 4 times [2018-06-26 18:42:46,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:46,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:46,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:46,464 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:46,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:46,473 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:46,627 INFO ]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:46,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:46,627 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:46,632 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:46,661 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:46,661 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:46,663 INFO ]: Computing forward predicates... [2018-06-26 18:42:46,768 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:46,786 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:46,787 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-06-26 18:42:46,787 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:42:46,787 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:42:46,787 INFO ]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:42:46,787 INFO ]: Start difference. First operand 65 states and 107 transitions. Second operand 19 states. [2018-06-26 18:42:47,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:47,131 INFO ]: Finished difference Result 150 states and 250 transitions. [2018-06-26 18:42:47,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:42:47,131 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-26 18:42:47,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:47,132 INFO ]: With dead ends: 150 [2018-06-26 18:42:47,132 INFO ]: Without dead ends: 124 [2018-06-26 18:42:47,132 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:42:47,132 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-26 18:42:47,136 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 79. [2018-06-26 18:42:47,136 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-26 18:42:47,136 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 129 transitions. [2018-06-26 18:42:47,136 INFO ]: Start accepts. Automaton has 79 states and 129 transitions. Word has length 19 [2018-06-26 18:42:47,136 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:47,136 INFO ]: Abstraction has 79 states and 129 transitions. [2018-06-26 18:42:47,136 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:42:47,136 INFO ]: Start isEmpty. Operand 79 states and 129 transitions. [2018-06-26 18:42:47,137 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:42:47,137 INFO ]: Found error trace [2018-06-26 18:42:47,137 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:47,137 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:47,137 INFO ]: Analyzing trace with hash -188678304, now seen corresponding path program 1 times [2018-06-26 18:42:47,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:47,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:47,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:47,137 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:47,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:47,147 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:47,929 INFO ]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:47,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:47,929 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) [2018-06-26 18:42:47,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:47,986 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:47,988 INFO ]: Computing forward predicates... [2018-06-26 18:42:47,991 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:48,025 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:48,025 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 18:42:48,025 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:42:48,025 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:42:48,025 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:42:48,026 INFO ]: Start difference. First operand 79 states and 129 transitions. Second operand 9 states. [2018-06-26 18:42:48,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:48,146 INFO ]: Finished difference Result 85 states and 135 transitions. [2018-06-26 18:42:48,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:42:48,146 INFO ]: Start accepts. Automaton has 9 states. Word has length 19 [2018-06-26 18:42:48,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:48,146 INFO ]: With dead ends: 85 [2018-06-26 18:42:48,147 INFO ]: Without dead ends: 72 [2018-06-26 18:42:48,147 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:48,147 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 18:42:48,148 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-06-26 18:42:48,148 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 18:42:48,148 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2018-06-26 18:42:48,148 INFO ]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 19 [2018-06-26 18:42:48,148 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:48,148 INFO ]: Abstraction has 62 states and 95 transitions. [2018-06-26 18:42:48,148 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:42:48,148 INFO ]: Start isEmpty. Operand 62 states and 95 transitions. [2018-06-26 18:42:48,148 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:42:48,148 INFO ]: Found error trace [2018-06-26 18:42:48,149 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:48,149 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:48,149 INFO ]: Analyzing trace with hash 1043863837, now seen corresponding path program 3 times [2018-06-26 18:42:48,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:48,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:48,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:48,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:48,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:48,160 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:48,252 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 18:42:48,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:48,252 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:48,260 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:48,294 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:48,295 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:48,296 INFO ]: Computing forward predicates... [2018-06-26 18:42:48,342 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 18:42:48,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:48,361 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2018-06-26 18:42:48,361 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:42:48,361 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:42:48,361 INFO ]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:42:48,361 INFO ]: Start difference. First operand 62 states and 95 transitions. Second operand 16 states. [2018-06-26 18:42:48,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:48,671 INFO ]: Finished difference Result 99 states and 163 transitions. [2018-06-26 18:42:48,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:42:48,672 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-26 18:42:48,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:48,672 INFO ]: With dead ends: 99 [2018-06-26 18:42:48,672 INFO ]: Without dead ends: 71 [2018-06-26 18:42:48,672 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:42:48,672 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-26 18:42:48,674 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 56. [2018-06-26 18:42:48,674 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-26 18:42:48,674 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2018-06-26 18:42:48,674 INFO ]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 20 [2018-06-26 18:42:48,674 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:48,674 INFO ]: Abstraction has 56 states and 86 transitions. [2018-06-26 18:42:48,674 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:42:48,674 INFO ]: Start isEmpty. Operand 56 states and 86 transitions. [2018-06-26 18:42:48,674 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:42:48,674 INFO ]: Found error trace [2018-06-26 18:42:48,675 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:48,675 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:48,675 INFO ]: Analyzing trace with hash -1159475063, now seen corresponding path program 4 times [2018-06-26 18:42:48,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:48,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:48,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:48,675 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:48,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:48,684 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:48,840 INFO ]: Checked inductivity of 25 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:42:48,840 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:48,840 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:48,848 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:48,878 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:48,878 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:48,880 INFO ]: Computing forward predicates... [2018-06-26 18:42:48,917 INFO ]: Checked inductivity of 25 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 18:42:48,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:48,938 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2018-06-26 18:42:48,938 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:42:48,938 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:42:48,938 INFO ]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:42:48,938 INFO ]: Start difference. First operand 56 states and 86 transitions. Second operand 14 states. [2018-06-26 18:42:49,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:49,102 INFO ]: Finished difference Result 69 states and 107 transitions. [2018-06-26 18:42:49,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:42:49,103 INFO ]: Start accepts. Automaton has 14 states. Word has length 20 [2018-06-26 18:42:49,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:49,103 INFO ]: With dead ends: 69 [2018-06-26 18:42:49,103 INFO ]: Without dead ends: 67 [2018-06-26 18:42:49,104 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:42:49,104 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 18:42:49,105 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-06-26 18:42:49,105 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 18:42:49,106 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2018-06-26 18:42:49,106 INFO ]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 20 [2018-06-26 18:42:49,106 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:49,106 INFO ]: Abstraction has 43 states and 69 transitions. [2018-06-26 18:42:49,106 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:42:49,106 INFO ]: Start isEmpty. Operand 43 states and 69 transitions. [2018-06-26 18:42:49,106 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:42:49,106 INFO ]: Found error trace [2018-06-26 18:42:49,106 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:49,106 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:49,106 INFO ]: Analyzing trace with hash 1500325675, now seen corresponding path program 5 times [2018-06-26 18:42:49,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:49,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:49,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:49,107 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:49,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:49,116 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:49,217 INFO ]: Checked inductivity of 29 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:42:49,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:49,217 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:49,222 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:49,264 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 18:42:49,264 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:49,266 INFO ]: Computing forward predicates... [2018-06-26 18:42:49,278 INFO ]: Checked inductivity of 29 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:42:49,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:49,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 18:42:49,298 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:42:49,298 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:42:49,298 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:49,299 INFO ]: Start difference. First operand 43 states and 69 transitions. Second operand 10 states. [2018-06-26 18:42:49,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:49,537 INFO ]: Finished difference Result 59 states and 91 transitions. [2018-06-26 18:42:49,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:42:49,537 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-26 18:42:49,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:49,538 INFO ]: With dead ends: 59 [2018-06-26 18:42:49,538 INFO ]: Without dead ends: 57 [2018-06-26 18:42:49,538 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:49,538 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 18:42:49,539 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-26 18:42:49,539 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 18:42:49,540 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2018-06-26 18:42:49,540 INFO ]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 21 [2018-06-26 18:42:49,540 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:49,540 INFO ]: Abstraction has 44 states and 70 transitions. [2018-06-26 18:42:49,540 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:42:49,540 INFO ]: Start isEmpty. Operand 44 states and 70 transitions. [2018-06-26 18:42:49,540 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:42:49,540 INFO ]: Found error trace [2018-06-26 18:42:49,540 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:49,540 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:49,540 INFO ]: Analyzing trace with hash -1486782531, now seen corresponding path program 4 times [2018-06-26 18:42:49,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:49,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:49,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:49,543 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:49,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:49,554 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:50,080 INFO ]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:42:50,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:50,123 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:50,128 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:50,173 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:50,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:50,174 INFO ]: Computing forward predicates... [2018-06-26 18:42:50,177 INFO ]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:42:50,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:50,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 18:42:50,196 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:42:50,196 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:42:50,196 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:50,196 INFO ]: Start difference. First operand 44 states and 70 transitions. Second operand 10 states. [2018-06-26 18:42:50,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:50,308 INFO ]: Finished difference Result 92 states and 146 transitions. [2018-06-26 18:42:50,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:42:50,308 INFO ]: Start accepts. Automaton has 10 states. Word has length 22 [2018-06-26 18:42:50,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:50,309 INFO ]: With dead ends: 92 [2018-06-26 18:42:50,309 INFO ]: Without dead ends: 92 [2018-06-26 18:42:50,309 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:42:50,309 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-26 18:42:50,311 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 50. [2018-06-26 18:42:50,311 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:42:50,311 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2018-06-26 18:42:50,311 INFO ]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 22 [2018-06-26 18:42:50,311 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:50,311 INFO ]: Abstraction has 50 states and 80 transitions. [2018-06-26 18:42:50,311 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:42:50,311 INFO ]: Start isEmpty. Operand 50 states and 80 transitions. [2018-06-26 18:42:50,312 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:42:50,312 INFO ]: Found error trace [2018-06-26 18:42:50,312 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:50,312 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:50,312 INFO ]: Analyzing trace with hash 1581712090, now seen corresponding path program 6 times [2018-06-26 18:42:50,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:50,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:50,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:50,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:50,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:50,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:50,764 INFO ]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:50,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:50,764 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:50,769 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:50,812 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 18:42:50,812 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:50,817 INFO ]: Computing forward predicates... [2018-06-26 18:42:57,844 INFO ]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 18:42:57,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:57,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-06-26 18:42:57,864 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:42:57,864 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:42:57,864 INFO ]: CoverageRelationStatistics Valid=82, Invalid=661, Unknown=13, NotChecked=0, Total=756 [2018-06-26 18:42:57,864 INFO ]: Start difference. First operand 50 states and 80 transitions. Second operand 28 states. Received shutdown request... [2018-06-26 18:43:33,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:43:33,858 WARN ]: Verification canceled [2018-06-26 18:43:33,860 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:43:33,861 WARN ]: Timeout [2018-06-26 18:43:33,861 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:43:33 BasicIcfg [2018-06-26 18:43:33,861 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:43:33,861 INFO ]: Toolchain (without parser) took 68910.61 ms. Allocated memory was 303.6 MB in the beginning and 631.2 MB in the end (delta: 327.7 MB). Free memory was 256.9 MB in the beginning and 364.0 MB in the end (delta: -107.1 MB). Peak memory consumption was 220.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:33,862 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:43:33,862 INFO ]: ChcToBoogie took 77.53 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:33,862 INFO ]: Boogie Preprocessor took 41.17 ms. Allocated memory is still 303.6 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:33,863 INFO ]: RCFGBuilder took 402.74 ms. Allocated memory is still 303.6 MB. Free memory was 252.9 MB in the beginning and 239.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:33,863 INFO ]: BlockEncodingV2 took 63.36 ms. Allocated memory is still 303.6 MB. Free memory was 239.8 MB in the beginning and 236.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:33,863 INFO ]: TraceAbstraction took 68311.88 ms. Allocated memory was 303.6 MB in the beginning and 631.2 MB in the end (delta: 327.7 MB). Free memory was 236.8 MB in the beginning and 364.0 MB in the end (delta: -127.2 MB). Peak memory consumption was 200.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:43:33,866 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 24 edges - StatisticsResult: Encoded RCFG 9 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.53 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.17 ms. Allocated memory is still 303.6 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 402.74 ms. Allocated memory is still 303.6 MB. Free memory was 252.9 MB in the beginning and 239.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 63.36 ms. Allocated memory is still 303.6 MB. Free memory was 239.8 MB in the beginning and 236.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 68311.88 ms. Allocated memory was 303.6 MB in the beginning and 631.2 MB in the end (delta: 327.7 MB). Free memory was 236.8 MB in the beginning and 364.0 MB in the end (delta: -127.2 MB). Peak memory consumption was 200.5 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 (50states) and interpolant automaton (currently 39 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 locations, 1 error locations. TIMEOUT Result, 68.2s OverallTime, 41 OverallIterations, 4 TraceHistogramMax, 46.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 548 SDtfs, 1449 SDslu, 2837 SDs, 0 SdLazy, 4567 SolverSat, 1608 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 29.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 499 SyntacticMatches, 11 SemanticMatches, 623 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 32.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 590 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1119 NumberOfCodeBlocks, 1119 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 1044 ConstructedInterpolants, 19 QuantifiedInterpolants, 70836 SizeOfPredicates, 147 NumberOfNonLiveVariables, 8098 ConjunctsInSsa, 953 ConjunctsInUnsatCore, 75 InterpolantComputations, 9 PerfectInterpolantSequences, 598/902 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/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-43-33-876.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-43-33-876.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-43-33-876.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-43-33-876.csv Completed graceful shutdown