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-14921ce [2018-06-24 21:39:32,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:39:32,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:39:32,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:39:32,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:39:32,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:39:32,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:39:32,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:39:32,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:39:32,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:39:32,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:39:32,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:39:32,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:39:32,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:39:32,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:39:32,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:39:32,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:39:32,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:39:32,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:39:32,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:39:32,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:39:32,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:39:32,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:39:32,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:39:32,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:39:32,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:39:32,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:39:32,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:39:32,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:39:32,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:39:32,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:39:32,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:39:32,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:39:32,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:39:32,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:39:32,489 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:39:32,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:39:32,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:39:32,516 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:39:32,516 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:39:32,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:39:32,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:39:32,517 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:39:32,518 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:39:32,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:39:32,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:39:32,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:39:32,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:39:32,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:39:32,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:39:32,520 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:39:32,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:39:32,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:39:32,520 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:39:32,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:39:32,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:39:32,521 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:39:32,522 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:39:32,523 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:39:32,571 INFO ]: Repository-Root is: /tmp [2018-06-24 21:39:32,587 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:39:32,593 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:39:32,595 INFO ]: Initializing SmtParser... [2018-06-24 21:39:32,595 INFO ]: SmtParser initialized [2018-06-24 21:39:32,596 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-24 21:39:32,597 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:39:32,687 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@d9d4f9f [2018-06-24 21:39:32,936 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-24 21:39:32,940 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:39:32,948 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:39:32,948 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:39:32,948 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:39:32,949 INFO ]: ChcToBoogie initialized [2018-06-24 21:39:32,951 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:39:32" (1/1) ... [2018-06-24 21:39:33,009 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33 Unit [2018-06-24 21:39:33,009 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:39:33,010 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:39:33,010 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:39:33,010 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:39:33,031 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,031 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,037 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,038 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,042 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,044 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,045 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,047 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:39:33,047 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:39:33,048 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:39:33,048 INFO ]: RCFGBuilder initialized [2018-06-24 21:39:33,048 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:39:33,071 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:39:33,072 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:39:33,072 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:39:33,072 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:39:33,072 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:39:33,072 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:39:33,432 INFO ]: Using library mode [2018-06-24 21:39:33,433 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:39:33 BoogieIcfgContainer [2018-06-24 21:39:33,433 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:39:33,433 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:39:33,433 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:39:33,434 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:39:33,435 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:39:33" (1/1) ... [2018-06-24 21:39:33,450 INFO ]: Initial Icfg 13 locations, 24 edges [2018-06-24 21:39:33,451 INFO ]: Using Remove infeasible edges [2018-06-24 21:39:33,451 INFO ]: Using Maximize final states [2018-06-24 21:39:33,451 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:39:33,452 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:39:33,453 INFO ]: Using Remove sink states [2018-06-24 21:39:33,454 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:39:33,454 INFO ]: Using Use SBE [2018-06-24 21:39:33,459 INFO ]: SBE split 0 edges [2018-06-24 21:39:33,464 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:39:33,465 INFO ]: 0 new accepting states [2018-06-24 21:39:33,485 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:39:33,487 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:39:33,491 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:39:33,491 INFO ]: 0 new accepting states [2018-06-24 21:39:33,491 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:39:33,491 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:39:33,491 INFO ]: Encoded RCFG 9 locations, 20 edges [2018-06-24 21:39:33,492 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:39:33 BasicIcfg [2018-06-24 21:39:33,492 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:39:33,493 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:39:33,493 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:39:33,496 INFO ]: TraceAbstraction initialized [2018-06-24 21:39:33,496 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:39:32" (1/4) ... [2018-06-24 21:39:33,497 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4348e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:39:33, skipping insertion in model container [2018-06-24 21:39:33,497 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:33" (2/4) ... [2018-06-24 21:39:33,497 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4348e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:39:33, skipping insertion in model container [2018-06-24 21:39:33,497 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:39:33" (3/4) ... [2018-06-24 21:39:33,498 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4348e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:39:33, skipping insertion in model container [2018-06-24 21:39:33,498 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:39:33" (4/4) ... [2018-06-24 21:39:33,499 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:39:33,508 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:39:33,516 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:39:33,565 INFO ]: Using default assertion order modulation [2018-06-24 21:39:33,566 INFO ]: Interprodecural is true [2018-06-24 21:39:33,566 INFO ]: Hoare is false [2018-06-24 21:39:33,566 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:39:33,566 INFO ]: Backedges is TWOTRACK [2018-06-24 21:39:33,566 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:39:33,566 INFO ]: Difference is false [2018-06-24 21:39:33,566 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:39:33,566 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:39:33,580 INFO ]: Start isEmpty. Operand 9 states. [2018-06-24 21:39:33,599 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:39:33,599 INFO ]: Found error trace [2018-06-24 21:39:33,599 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:33,600 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:33,610 INFO ]: Analyzing trace with hash -110759759, now seen corresponding path program 1 times [2018-06-24 21:39:33,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:33,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:33,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:33,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:33,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:33,694 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:33,877 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:33,878 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:33,878 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:39:33,880 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:33,893 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:33,894 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:33,896 INFO ]: Start difference. First operand 9 states. Second operand 6 states. [2018-06-24 21:39:34,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:34,370 INFO ]: Finished difference Result 20 states and 57 transitions. [2018-06-24 21:39:34,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:39:34,372 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 21:39:34,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:34,381 INFO ]: With dead ends: 20 [2018-06-24 21:39:34,381 INFO ]: Without dead ends: 19 [2018-06-24 21:39:34,383 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:39:34,398 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:39:34,416 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-06-24 21:39:34,417 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:39:34,418 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-06-24 21:39:34,419 INFO ]: Start accepts. Automaton has 12 states and 31 transitions. Word has length 8 [2018-06-24 21:39:34,420 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:34,420 INFO ]: Abstraction has 12 states and 31 transitions. [2018-06-24 21:39:34,420 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:34,420 INFO ]: Start isEmpty. Operand 12 states and 31 transitions. [2018-06-24 21:39:34,420 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:34,420 INFO ]: Found error trace [2018-06-24 21:39:34,420 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:34,421 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:34,421 INFO ]: Analyzing trace with hash -335049340, now seen corresponding path program 1 times [2018-06-24 21:39:34,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:34,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:34,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:34,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:34,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:34,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:34,495 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:34,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:34,495 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:39:34,497 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:39:34,497 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:39:34,497 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:39:34,497 INFO ]: Start difference. First operand 12 states and 31 transitions. Second operand 4 states. [2018-06-24 21:39:34,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:34,689 INFO ]: Finished difference Result 18 states and 50 transitions. [2018-06-24 21:39:34,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:39:34,690 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 21:39:34,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:34,691 INFO ]: With dead ends: 18 [2018-06-24 21:39:34,691 INFO ]: Without dead ends: 18 [2018-06-24 21:39:34,691 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-24 21:39:34,692 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:39:34,695 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-24 21:39:34,695 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:39:34,695 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-06-24 21:39:34,695 INFO ]: Start accepts. Automaton has 14 states and 37 transitions. Word has length 9 [2018-06-24 21:39:34,696 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:34,696 INFO ]: Abstraction has 14 states and 37 transitions. [2018-06-24 21:39:34,696 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:39:34,696 INFO ]: Start isEmpty. Operand 14 states and 37 transitions. [2018-06-24 21:39:34,696 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:34,696 INFO ]: Found error trace [2018-06-24 21:39:34,696 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:34,696 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:34,696 INFO ]: Analyzing trace with hash 810116700, now seen corresponding path program 1 times [2018-06-24 21:39:34,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:34,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:34,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:34,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:34,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:34,727 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:34,781 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:34,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:34,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:34,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:34,815 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:34,835 INFO ]: Computing forward predicates... [2018-06-24 21:39:34,859 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:34,880 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:34,880 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:39:34,880 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:34,880 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:34,880 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:34,880 INFO ]: Start difference. First operand 14 states and 37 transitions. Second operand 5 states. [2018-06-24 21:39:34,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:34,990 INFO ]: Finished difference Result 23 states and 65 transitions. [2018-06-24 21:39:34,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:34,991 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 21:39:34,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:34,992 INFO ]: With dead ends: 23 [2018-06-24 21:39:34,992 INFO ]: Without dead ends: 20 [2018-06-24 21:39:34,992 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-24 21:39:34,992 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:39:34,994 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-24 21:39:34,994 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:39:34,995 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-06-24 21:39:34,995 INFO ]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 9 [2018-06-24 21:39:34,995 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:34,995 INFO ]: Abstraction has 17 states and 41 transitions. [2018-06-24 21:39:34,995 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:34,995 INFO ]: Start isEmpty. Operand 17 states and 41 transitions. [2018-06-24 21:39:34,996 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:34,996 INFO ]: Found error trace [2018-06-24 21:39:34,996 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:34,996 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:34,996 INFO ]: Analyzing trace with hash 838745851, now seen corresponding path program 1 times [2018-06-24 21:39:34,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:34,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:34,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:34,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:34,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,012 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:35,049 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:35,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:35,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:35,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:35,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:35,092 INFO ]: Computing forward predicates... [2018-06-24 21:39:35,100 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:35,133 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:35,133 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:39:35,133 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:35,133 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:35,133 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:35,133 INFO ]: Start difference. First operand 17 states and 41 transitions. Second operand 5 states. [2018-06-24 21:39:35,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:35,497 INFO ]: Finished difference Result 23 states and 58 transitions. [2018-06-24 21:39:35,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:35,498 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 21:39:35,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:35,499 INFO ]: With dead ends: 23 [2018-06-24 21:39:35,499 INFO ]: Without dead ends: 21 [2018-06-24 21:39:35,499 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-24 21:39:35,499 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:39:35,502 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-24 21:39:35,502 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:39:35,503 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2018-06-24 21:39:35,503 INFO ]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 9 [2018-06-24 21:39:35,503 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:35,503 INFO ]: Abstraction has 18 states and 42 transitions. [2018-06-24 21:39:35,503 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:35,503 INFO ]: Start isEmpty. Operand 18 states and 42 transitions. [2018-06-24 21:39:35,503 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:35,503 INFO ]: Found error trace [2018-06-24 21:39:35,503 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:35,504 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:35,504 INFO ]: Analyzing trace with hash 861833876, now seen corresponding path program 1 times [2018-06-24 21:39:35,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:35,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:35,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:35,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,516 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:35,561 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:35,561 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:35,561 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:35,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:35,602 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:35,604 INFO ]: Computing forward predicates... [2018-06-24 21:39:35,610 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:35,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:35,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:39:35,645 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:35,645 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:35,645 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:35,645 INFO ]: Start difference. First operand 18 states and 42 transitions. Second operand 6 states. [2018-06-24 21:39:35,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:35,728 INFO ]: Finished difference Result 22 states and 54 transitions. [2018-06-24 21:39:35,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:39:35,728 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:39:35,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:35,728 INFO ]: With dead ends: 22 [2018-06-24 21:39:35,728 INFO ]: Without dead ends: 21 [2018-06-24 21:39:35,729 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-24 21:39:35,729 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:39:35,730 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-24 21:39:35,730 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:39:35,731 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 42 transitions. [2018-06-24 21:39:35,731 INFO ]: Start accepts. Automaton has 19 states and 42 transitions. Word has length 9 [2018-06-24 21:39:35,731 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:35,731 INFO ]: Abstraction has 19 states and 42 transitions. [2018-06-24 21:39:35,731 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:35,731 INFO ]: Start isEmpty. Operand 19 states and 42 transitions. [2018-06-24 21:39:35,731 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:35,731 INFO ]: Found error trace [2018-06-24 21:39:35,731 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:35,731 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:35,732 INFO ]: Analyzing trace with hash 862757397, now seen corresponding path program 1 times [2018-06-24 21:39:35,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:35,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:35,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:35,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:35,803 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:35,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:35,803 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:35,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:35,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:35,839 INFO ]: Computing forward predicates... [2018-06-24 21:39:35,958 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:35,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:35,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 21:39:35,978 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:39:35,978 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:39:35,978 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:35,979 INFO ]: Start difference. First operand 19 states and 42 transitions. Second operand 8 states. [2018-06-24 21:39:36,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:36,147 INFO ]: Finished difference Result 29 states and 71 transitions. [2018-06-24 21:39:36,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:39:36,148 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:39:36,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:36,149 INFO ]: With dead ends: 29 [2018-06-24 21:39:36,149 INFO ]: Without dead ends: 24 [2018-06-24 21:39:36,149 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-24 21:39:36,149 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:39:36,151 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-06-24 21:39:36,152 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:39:36,152 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2018-06-24 21:39:36,152 INFO ]: Start accepts. Automaton has 19 states and 45 transitions. Word has length 9 [2018-06-24 21:39:36,152 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:36,152 INFO ]: Abstraction has 19 states and 45 transitions. [2018-06-24 21:39:36,152 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:39:36,152 INFO ]: Start isEmpty. Operand 19 states and 45 transitions. [2018-06-24 21:39:36,153 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:36,153 INFO ]: Found error trace [2018-06-24 21:39:36,153 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:36,153 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:36,153 INFO ]: Analyzing trace with hash -1967505593, now seen corresponding path program 1 times [2018-06-24 21:39:36,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:36,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:36,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:36,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:36,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:36,164 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:36,356 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:36,357 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:36,357 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:36,357 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:36,357 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:36,357 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:36,357 INFO ]: Start difference. First operand 19 states and 45 transitions. Second operand 5 states. [2018-06-24 21:39:36,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:36,459 INFO ]: Finished difference Result 23 states and 52 transitions. [2018-06-24 21:39:36,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:36,460 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 21:39:36,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:36,460 INFO ]: With dead ends: 23 [2018-06-24 21:39:36,460 INFO ]: Without dead ends: 23 [2018-06-24 21:39:36,461 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-24 21:39:36,461 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:39:36,464 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-24 21:39:36,464 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:39:36,465 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. [2018-06-24 21:39:36,465 INFO ]: Start accepts. Automaton has 21 states and 47 transitions. Word has length 9 [2018-06-24 21:39:36,465 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:36,465 INFO ]: Abstraction has 21 states and 47 transitions. [2018-06-24 21:39:36,465 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:36,465 INFO ]: Start isEmpty. Operand 21 states and 47 transitions. [2018-06-24 21:39:36,465 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:39:36,465 INFO ]: Found error trace [2018-06-24 21:39:36,465 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:36,465 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:36,465 INFO ]: Analyzing trace with hash 1666356806, now seen corresponding path program 1 times [2018-06-24 21:39:36,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:36,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:36,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:36,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:36,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:36,476 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:36,524 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:36,524 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:36,524 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:36,524 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:36,524 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:36,524 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:36,524 INFO ]: Start difference. First operand 21 states and 47 transitions. Second operand 5 states. [2018-06-24 21:39:36,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:36,590 INFO ]: Finished difference Result 28 states and 61 transitions. [2018-06-24 21:39:36,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:36,592 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 21:39:36,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:36,593 INFO ]: With dead ends: 28 [2018-06-24 21:39:36,593 INFO ]: Without dead ends: 26 [2018-06-24 21:39:36,593 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-24 21:39:36,593 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:39:36,595 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-24 21:39:36,595 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:39:36,596 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2018-06-24 21:39:36,596 INFO ]: Start accepts. Automaton has 23 states and 50 transitions. Word has length 10 [2018-06-24 21:39:36,596 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:36,596 INFO ]: Abstraction has 23 states and 50 transitions. [2018-06-24 21:39:36,596 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:36,596 INFO ]: Start isEmpty. Operand 23 states and 50 transitions. [2018-06-24 21:39:36,597 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:39:36,597 INFO ]: Found error trace [2018-06-24 21:39:36,597 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:36,597 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:36,597 INFO ]: Analyzing trace with hash -862712130, now seen corresponding path program 1 times [2018-06-24 21:39:36,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:36,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:36,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:36,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:36,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:36,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:36,862 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:36,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:36,863 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:36,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:36,884 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:36,887 INFO ]: Computing forward predicates... [2018-06-24 21:39:37,171 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:37,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:37,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:39:37,191 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:39:37,191 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:39:37,191 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:39:37,191 INFO ]: Start difference. First operand 23 states and 50 transitions. Second operand 14 states. [2018-06-24 21:39:37,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:37,795 INFO ]: Finished difference Result 53 states and 123 transitions. [2018-06-24 21:39:37,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:37,795 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:39:37,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:37,797 INFO ]: With dead ends: 53 [2018-06-24 21:39:37,797 INFO ]: Without dead ends: 51 [2018-06-24 21:39:37,797 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-24 21:39:37,797 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:39:37,801 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 25. [2018-06-24 21:39:37,801 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:39:37,801 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2018-06-24 21:39:37,801 INFO ]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 10 [2018-06-24 21:39:37,802 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:37,802 INFO ]: Abstraction has 25 states and 53 transitions. [2018-06-24 21:39:37,802 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:39:37,802 INFO ]: Start isEmpty. Operand 25 states and 53 transitions. [2018-06-24 21:39:37,803 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:39:37,803 INFO ]: Found error trace [2018-06-24 21:39:37,803 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:37,803 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:37,803 INFO ]: Analyzing trace with hash 1959621149, now seen corresponding path program 1 times [2018-06-24 21:39:37,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:37,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:37,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:37,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:37,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:37,826 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:37,898 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:37,898 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:37,898 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:39:37,898 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:39:37,898 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:39:37,898 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:39:37,898 INFO ]: Start difference. First operand 25 states and 53 transitions. Second operand 4 states. [2018-06-24 21:39:37,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:37,926 INFO ]: Finished difference Result 28 states and 61 transitions. [2018-06-24 21:39:37,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:39:37,927 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-24 21:39:37,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:37,928 INFO ]: With dead ends: 28 [2018-06-24 21:39:37,928 INFO ]: Without dead ends: 28 [2018-06-24 21:39:37,928 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-24 21:39:37,928 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:39:37,931 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-24 21:39:37,931 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:39:37,932 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2018-06-24 21:39:37,932 INFO ]: Start accepts. Automaton has 26 states and 56 transitions. Word has length 11 [2018-06-24 21:39:37,932 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:37,932 INFO ]: Abstraction has 26 states and 56 transitions. [2018-06-24 21:39:37,932 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:39:37,932 INFO ]: Start isEmpty. Operand 26 states and 56 transitions. [2018-06-24 21:39:37,933 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:39:37,933 INFO ]: Found error trace [2018-06-24 21:39:37,933 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:37,933 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:37,933 INFO ]: Analyzing trace with hash 1717881695, now seen corresponding path program 1 times [2018-06-24 21:39:37,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:37,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:37,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:37,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:37,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:37,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,034 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:38,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:38,035 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:38,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:38,059 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,060 INFO ]: Computing forward predicates... [2018-06-24 21:39:38,065 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:38,086 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:38,086 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:39:38,086 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:38,087 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:38,087 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:38,087 INFO ]: Start difference. First operand 26 states and 56 transitions. Second operand 6 states. [2018-06-24 21:39:38,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:38,148 INFO ]: Finished difference Result 47 states and 110 transitions. [2018-06-24 21:39:38,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:39:38,148 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 21:39:38,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:38,149 INFO ]: With dead ends: 47 [2018-06-24 21:39:38,149 INFO ]: Without dead ends: 44 [2018-06-24 21:39:38,149 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-24 21:39:38,149 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:39:38,153 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-24 21:39:38,153 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:39:38,153 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 65 transitions. [2018-06-24 21:39:38,153 INFO ]: Start accepts. Automaton has 31 states and 65 transitions. Word has length 11 [2018-06-24 21:39:38,154 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:38,154 INFO ]: Abstraction has 31 states and 65 transitions. [2018-06-24 21:39:38,154 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:38,154 INFO ]: Start isEmpty. Operand 31 states and 65 transitions. [2018-06-24 21:39:38,154 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:39:38,154 INFO ]: Found error trace [2018-06-24 21:39:38,154 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:38,154 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:38,154 INFO ]: Analyzing trace with hash -973853145, now seen corresponding path program 2 times [2018-06-24 21:39:38,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:38,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:38,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:38,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,164 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,218 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:38,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:38,218 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:38,225 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:38,275 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:38,275 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,277 INFO ]: Computing forward predicates... [2018-06-24 21:39:38,283 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:38,315 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:38,316 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:39:38,316 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:38,316 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:38,316 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:38,316 INFO ]: Start difference. First operand 31 states and 65 transitions. Second operand 6 states. [2018-06-24 21:39:38,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:38,440 INFO ]: Finished difference Result 44 states and 101 transitions. [2018-06-24 21:39:38,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:39:38,441 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 21:39:38,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:38,442 INFO ]: With dead ends: 44 [2018-06-24 21:39:38,442 INFO ]: Without dead ends: 38 [2018-06-24 21:39:38,442 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-24 21:39:38,442 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:39:38,448 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-24 21:39:38,448 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:39:38,449 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 71 transitions. [2018-06-24 21:39:38,449 INFO ]: Start accepts. Automaton has 32 states and 71 transitions. Word has length 11 [2018-06-24 21:39:38,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:38,449 INFO ]: Abstraction has 32 states and 71 transitions. [2018-06-24 21:39:38,449 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:38,449 INFO ]: Start isEmpty. Operand 32 states and 71 transitions. [2018-06-24 21:39:38,450 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:39:38,450 INFO ]: Found error trace [2018-06-24 21:39:38,450 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:38,450 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:38,450 INFO ]: Analyzing trace with hash -190899235, now seen corresponding path program 1 times [2018-06-24 21:39:38,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:38,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:38,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:38,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,585 INFO ]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:38,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:38,585 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:38,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:38,624 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,625 INFO ]: Computing forward predicates... [2018-06-24 21:39:38,663 INFO ]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:38,687 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:38,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-06-24 21:39:38,687 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:39:38,687 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:39:38,687 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:39:38,687 INFO ]: Start difference. First operand 32 states and 71 transitions. Second operand 9 states. [2018-06-24 21:39:38,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:38,954 INFO ]: Finished difference Result 54 states and 128 transitions. [2018-06-24 21:39:38,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:39:38,955 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 21:39:38,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:38,955 INFO ]: With dead ends: 54 [2018-06-24 21:39:38,955 INFO ]: Without dead ends: 48 [2018-06-24 21:39:38,955 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-24 21:39:38,955 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 21:39:38,959 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-24 21:39:38,959 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:39:38,960 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 74 transitions. [2018-06-24 21:39:38,960 INFO ]: Start accepts. Automaton has 34 states and 74 transitions. Word has length 12 [2018-06-24 21:39:38,961 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:38,961 INFO ]: Abstraction has 34 states and 74 transitions. [2018-06-24 21:39:38,961 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:39:38,961 INFO ]: Start isEmpty. Operand 34 states and 74 transitions. [2018-06-24 21:39:38,962 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:39:38,962 INFO ]: Found error trace [2018-06-24 21:39:38,962 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:38,962 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:38,962 INFO ]: Analyzing trace with hash -190839653, now seen corresponding path program 1 times [2018-06-24 21:39:38,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:38,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:38,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:38,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,975 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,047 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:39,047 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:39,047 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:39:39,047 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:39:39,047 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:39:39,047 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:39:39,048 INFO ]: Start difference. First operand 34 states and 74 transitions. Second operand 3 states. [2018-06-24 21:39:39,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:39,079 INFO ]: Finished difference Result 35 states and 75 transitions. [2018-06-24 21:39:39,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:39:39,079 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:39:39,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:39,080 INFO ]: With dead ends: 35 [2018-06-24 21:39:39,080 INFO ]: Without dead ends: 24 [2018-06-24 21:39:39,080 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:39:39,080 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:39:39,082 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-24 21:39:39,082 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:39:39,082 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2018-06-24 21:39:39,082 INFO ]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 12 [2018-06-24 21:39:39,082 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:39,082 INFO ]: Abstraction has 23 states and 48 transitions. [2018-06-24 21:39:39,082 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:39:39,082 INFO ]: Start isEmpty. Operand 23 states and 48 transitions. [2018-06-24 21:39:39,083 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:39:39,083 INFO ]: Found error trace [2018-06-24 21:39:39,083 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:39,083 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:39,083 INFO ]: Analyzing trace with hash -2008421111, now seen corresponding path program 2 times [2018-06-24 21:39:39,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:39,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:39,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:39,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,092 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,130 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:39,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:39,130 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:39,130 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:39,130 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:39,130 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:39,130 INFO ]: Start difference. First operand 23 states and 48 transitions. Second operand 5 states. [2018-06-24 21:39:39,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:39,157 INFO ]: Finished difference Result 26 states and 53 transitions. [2018-06-24 21:39:39,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:39,159 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-24 21:39:39,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:39,159 INFO ]: With dead ends: 26 [2018-06-24 21:39:39,159 INFO ]: Without dead ends: 26 [2018-06-24 21:39:39,160 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-24 21:39:39,160 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:39:39,161 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-24 21:39:39,161 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:39:39,162 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-24 21:39:39,162 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 12 [2018-06-24 21:39:39,162 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:39,162 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-24 21:39:39,162 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:39,162 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-24 21:39:39,162 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:39:39,162 INFO ]: Found error trace [2018-06-24 21:39:39,162 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:39,162 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:39,162 INFO ]: Analyzing trace with hash -2131903118, now seen corresponding path program 1 times [2018-06-24 21:39:39,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:39,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:39,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:39,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,172 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,403 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:39,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:39,403 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) [2018-06-24 21:39:39,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:39,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,441 INFO ]: Computing forward predicates... [2018-06-24 21:39:39,446 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:39,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:39,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 21:39:39,465 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:39,465 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:39,465 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:39,465 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 6 states. [2018-06-24 21:39:39,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:39,528 INFO ]: Finished difference Result 47 states and 104 transitions. [2018-06-24 21:39:39,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:39:39,528 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-24 21:39:39,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:39,528 INFO ]: With dead ends: 47 [2018-06-24 21:39:39,528 INFO ]: Without dead ends: 47 [2018-06-24 21:39:39,529 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:39:39,529 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 21:39:39,531 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-06-24 21:39:39,531 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:39:39,532 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2018-06-24 21:39:39,532 INFO ]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 13 [2018-06-24 21:39:39,532 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:39,532 INFO ]: Abstraction has 28 states and 58 transitions. [2018-06-24 21:39:39,532 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:39,532 INFO ]: Start isEmpty. Operand 28 states and 58 transitions. [2018-06-24 21:39:39,532 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:39:39,532 INFO ]: Found error trace [2018-06-24 21:39:39,532 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:39,533 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:39,533 INFO ]: Analyzing trace with hash 1067177397, now seen corresponding path program 1 times [2018-06-24 21:39:39,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:39,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:39,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:39,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,577 INFO ]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:39,577 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:39,577 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:39,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:39,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,610 INFO ]: Computing forward predicates... [2018-06-24 21:39:39,627 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:39,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:39,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-06-24 21:39:39,647 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:39:39,647 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:39:39,647 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:39,647 INFO ]: Start difference. First operand 28 states and 58 transitions. Second operand 8 states. [2018-06-24 21:39:39,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:39,718 INFO ]: Finished difference Result 31 states and 65 transitions. [2018-06-24 21:39:39,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:39:39,718 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-24 21:39:39,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:39,719 INFO ]: With dead ends: 31 [2018-06-24 21:39:39,719 INFO ]: Without dead ends: 31 [2018-06-24 21:39:39,719 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:39,719 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:39:39,721 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 21:39:39,721 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:39:39,721 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 65 transitions. [2018-06-24 21:39:39,721 INFO ]: Start accepts. Automaton has 31 states and 65 transitions. Word has length 13 [2018-06-24 21:39:39,721 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:39,721 INFO ]: Abstraction has 31 states and 65 transitions. [2018-06-24 21:39:39,721 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:39:39,721 INFO ]: Start isEmpty. Operand 31 states and 65 transitions. [2018-06-24 21:39:39,722 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:39,722 INFO ]: Found error trace [2018-06-24 21:39:39,722 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:39,722 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:39,722 INFO ]: Analyzing trace with hash 1320954074, now seen corresponding path program 1 times [2018-06-24 21:39:39,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:39,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:39,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:39,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,737 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:40,018 INFO ]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:40,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:40,018 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:40,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:40,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:40,049 INFO ]: Computing forward predicates... [2018-06-24 21:39:40,365 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-06-24 21:39:40,639 INFO ]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:40,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:40,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-24 21:39:40,658 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:39:40,658 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:39:40,658 INFO ]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:39:40,658 INFO ]: Start difference. First operand 31 states and 65 transitions. Second operand 19 states. [2018-06-24 21:39:42,554 WARN ]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-06-24 21:39:42,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:42,736 INFO ]: Finished difference Result 122 states and 304 transitions. [2018-06-24 21:39:42,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:39:42,736 INFO ]: Start accepts. Automaton has 19 states. Word has length 14 [2018-06-24 21:39:42,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:42,738 INFO ]: With dead ends: 122 [2018-06-24 21:39:42,738 INFO ]: Without dead ends: 116 [2018-06-24 21:39:42,738 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:39:42,738 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-24 21:39:42,742 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 45. [2018-06-24 21:39:42,742 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:39:42,743 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 105 transitions. [2018-06-24 21:39:42,743 INFO ]: Start accepts. Automaton has 45 states and 105 transitions. Word has length 14 [2018-06-24 21:39:42,743 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:42,743 INFO ]: Abstraction has 45 states and 105 transitions. [2018-06-24 21:39:42,743 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:39:42,743 INFO ]: Start isEmpty. Operand 45 states and 105 transitions. [2018-06-24 21:39:42,743 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:42,743 INFO ]: Found error trace [2018-06-24 21:39:42,744 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:42,744 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:42,744 INFO ]: Analyzing trace with hash -1199005860, now seen corresponding path program 2 times [2018-06-24 21:39:42,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:42,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:42,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:42,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:42,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:42,765 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:43,063 INFO ]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:43,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:43,088 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:43,094 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:43,116 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:43,116 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:43,118 INFO ]: Computing forward predicates... [2018-06-24 21:39:43,127 INFO ]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:43,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:43,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-24 21:39:43,145 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:39:43,146 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:39:43,146 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:39:43,146 INFO ]: Start difference. First operand 45 states and 105 transitions. Second operand 10 states. [2018-06-24 21:39:43,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:43,256 INFO ]: Finished difference Result 65 states and 157 transitions. [2018-06-24 21:39:43,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:39:43,257 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-24 21:39:43,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:43,257 INFO ]: With dead ends: 65 [2018-06-24 21:39:43,257 INFO ]: Without dead ends: 61 [2018-06-24 21:39:43,257 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:43,257 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 21:39:43,262 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-06-24 21:39:43,262 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:39:43,263 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 117 transitions. [2018-06-24 21:39:43,263 INFO ]: Start accepts. Automaton has 51 states and 117 transitions. Word has length 14 [2018-06-24 21:39:43,263 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:43,263 INFO ]: Abstraction has 51 states and 117 transitions. [2018-06-24 21:39:43,263 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:39:43,263 INFO ]: Start isEmpty. Operand 51 states and 117 transitions. [2018-06-24 21:39:43,265 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:43,265 INFO ]: Found error trace [2018-06-24 21:39:43,265 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:43,265 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:43,266 INFO ]: Analyzing trace with hash -1639645472, now seen corresponding path program 1 times [2018-06-24 21:39:43,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:43,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:43,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:43,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:43,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:43,274 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:43,640 INFO ]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:43,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:43,640 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:43,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:43,679 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:43,681 INFO ]: Computing forward predicates... [2018-06-24 21:39:43,686 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:39:43,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:43,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:39:43,719 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:39:43,719 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:39:43,719 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:43,719 INFO ]: Start difference. First operand 51 states and 117 transitions. Second operand 7 states. [2018-06-24 21:39:44,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:44,120 INFO ]: Finished difference Result 54 states and 123 transitions. [2018-06-24 21:39:44,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:39:44,121 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-24 21:39:44,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:44,121 INFO ]: With dead ends: 54 [2018-06-24 21:39:44,121 INFO ]: Without dead ends: 53 [2018-06-24 21:39:44,121 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:44,122 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 21:39:44,124 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-06-24 21:39:44,124 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 21:39:44,125 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2018-06-24 21:39:44,125 INFO ]: Start accepts. Automaton has 52 states and 118 transitions. Word has length 14 [2018-06-24 21:39:44,125 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:44,125 INFO ]: Abstraction has 52 states and 118 transitions. [2018-06-24 21:39:44,125 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:39:44,125 INFO ]: Start isEmpty. Operand 52 states and 118 transitions. [2018-06-24 21:39:44,126 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:44,126 INFO ]: Found error trace [2018-06-24 21:39:44,126 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:44,126 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:44,126 INFO ]: Analyzing trace with hash -1639615681, now seen corresponding path program 1 times [2018-06-24 21:39:44,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:44,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:44,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:44,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:44,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:44,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,245 INFO ]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:44,245 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:44,246 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:44,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:44,273 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,275 INFO ]: Computing forward predicates... [2018-06-24 21:39:44,335 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:39:44,361 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:39:44,361 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-06-24 21:39:44,361 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:39:44,361 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:39:44,361 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:39:44,362 INFO ]: Start difference. First operand 52 states and 118 transitions. Second operand 12 states. [2018-06-24 21:39:44,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:44,663 INFO ]: Finished difference Result 54 states and 122 transitions. [2018-06-24 21:39:44,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:39:44,663 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 21:39:44,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:44,664 INFO ]: With dead ends: 54 [2018-06-24 21:39:44,664 INFO ]: Without dead ends: 47 [2018-06-24 21:39:44,664 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:44,664 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 21:39:44,666 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-24 21:39:44,666 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:39:44,667 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2018-06-24 21:39:44,667 INFO ]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 14 [2018-06-24 21:39:44,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:44,667 INFO ]: Abstraction has 45 states and 106 transitions. [2018-06-24 21:39:44,667 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:44,667 INFO ]: Start isEmpty. Operand 45 states and 106 transitions. [2018-06-24 21:39:44,668 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:39:44,668 INFO ]: Found error trace [2018-06-24 21:39:44,668 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:44,668 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:44,668 INFO ]: Analyzing trace with hash 177661705, now seen corresponding path program 1 times [2018-06-24 21:39:44,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:44,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:44,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:44,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:44,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:44,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,716 INFO ]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:39:44,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:44,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:44,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:44,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,746 INFO ]: Computing forward predicates... [2018-06-24 21:39:44,797 INFO ]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:44,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:44,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-24 21:39:44,816 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:39:44,816 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:39:44,816 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:39:44,816 INFO ]: Start difference. First operand 45 states and 106 transitions. Second operand 12 states. [2018-06-24 21:39:45,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:45,175 INFO ]: Finished difference Result 103 states and 224 transitions. [2018-06-24 21:39:45,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:39:45,176 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-24 21:39:45,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:45,176 INFO ]: With dead ends: 103 [2018-06-24 21:39:45,176 INFO ]: Without dead ends: 76 [2018-06-24 21:39:45,177 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:39:45,177 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 21:39:45,180 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 51. [2018-06-24 21:39:45,180 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:39:45,181 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 106 transitions. [2018-06-24 21:39:45,181 INFO ]: Start accepts. Automaton has 51 states and 106 transitions. Word has length 15 [2018-06-24 21:39:45,181 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:45,181 INFO ]: Abstraction has 51 states and 106 transitions. [2018-06-24 21:39:45,181 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:45,181 INFO ]: Start isEmpty. Operand 51 states and 106 transitions. [2018-06-24 21:39:45,182 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:39:45,182 INFO ]: Found error trace [2018-06-24 21:39:45,182 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:45,182 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:45,182 INFO ]: Analyzing trace with hash 1559642057, now seen corresponding path program 1 times [2018-06-24 21:39:45,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:45,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:45,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:45,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:45,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:45,191 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:45,606 INFO ]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:45,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:45,606 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-24 21:39:45,620 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-24 21:39:45,661 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:45,663 INFO ]: Computing forward predicates... [2018-06-24 21:39:46,305 INFO ]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:46,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:46,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-06-24 21:39:46,336 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:39:46,336 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:39:46,336 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:39:46,336 INFO ]: Start difference. First operand 51 states and 106 transitions. Second operand 10 states. [2018-06-24 21:39:46,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:46,508 INFO ]: Finished difference Result 57 states and 108 transitions. [2018-06-24 21:39:46,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:39:46,509 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-24 21:39:46,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:46,509 INFO ]: With dead ends: 57 [2018-06-24 21:39:46,509 INFO ]: Without dead ends: 55 [2018-06-24 21:39:46,509 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:46,509 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 21:39:46,511 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-06-24 21:39:46,511 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:39:46,512 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 81 transitions. [2018-06-24 21:39:46,512 INFO ]: Start accepts. Automaton has 45 states and 81 transitions. Word has length 15 [2018-06-24 21:39:46,512 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:46,512 INFO ]: Abstraction has 45 states and 81 transitions. [2018-06-24 21:39:46,512 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:39:46,512 INFO ]: Start isEmpty. Operand 45 states and 81 transitions. [2018-06-24 21:39:46,512 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:39:46,512 INFO ]: Found error trace [2018-06-24 21:39:46,512 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:46,512 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:46,512 INFO ]: Analyzing trace with hash 569467318, now seen corresponding path program 1 times [2018-06-24 21:39:46,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:46,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:46,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:46,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:46,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:46,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:46,572 INFO ]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:46,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:46,572 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:46,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:46,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:46,606 INFO ]: Computing forward predicates... [2018-06-24 21:39:46,617 INFO ]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:39:46,636 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:39:46,636 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-24 21:39:46,636 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:39:46,636 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:39:46,636 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:46,636 INFO ]: Start difference. First operand 45 states and 81 transitions. Second operand 7 states. [2018-06-24 21:39:46,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:46,697 INFO ]: Finished difference Result 46 states and 77 transitions. [2018-06-24 21:39:46,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:39:46,698 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-24 21:39:46,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:46,698 INFO ]: With dead ends: 46 [2018-06-24 21:39:46,698 INFO ]: Without dead ends: 46 [2018-06-24 21:39:46,698 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-24 21:39:46,698 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 21:39:46,699 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-06-24 21:39:46,699 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:39:46,700 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2018-06-24 21:39:46,700 INFO ]: Start accepts. Automaton has 41 states and 69 transitions. Word has length 15 [2018-06-24 21:39:46,700 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:46,700 INFO ]: Abstraction has 41 states and 69 transitions. [2018-06-24 21:39:46,700 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:39:46,700 INFO ]: Start isEmpty. Operand 41 states and 69 transitions. [2018-06-24 21:39:46,700 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:39:46,701 INFO ]: Found error trace [2018-06-24 21:39:46,701 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:46,701 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:46,701 INFO ]: Analyzing trace with hash 598096469, now seen corresponding path program 2 times [2018-06-24 21:39:46,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:46,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:46,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:46,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:46,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:46,710 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:46,767 INFO ]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:46,768 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:46,768 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:46,774 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:46,796 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:46,796 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:46,797 INFO ]: Computing forward predicates... [2018-06-24 21:39:46,846 INFO ]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:46,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:46,877 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2018-06-24 21:39:46,877 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:39:46,877 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:39:46,877 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:39:46,878 INFO ]: Start difference. First operand 41 states and 69 transitions. Second operand 12 states. [2018-06-24 21:39:47,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:47,021 INFO ]: Finished difference Result 88 states and 145 transitions. [2018-06-24 21:39:47,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:39:47,021 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-24 21:39:47,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:47,022 INFO ]: With dead ends: 88 [2018-06-24 21:39:47,022 INFO ]: Without dead ends: 63 [2018-06-24 21:39:47,022 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:39:47,022 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-24 21:39:47,024 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-06-24 21:39:47,024 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 21:39:47,024 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-06-24 21:39:47,024 INFO ]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 15 [2018-06-24 21:39:47,024 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:47,024 INFO ]: Abstraction has 46 states and 75 transitions. [2018-06-24 21:39:47,024 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:47,024 INFO ]: Start isEmpty. Operand 46 states and 75 transitions. [2018-06-24 21:39:47,025 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:39:47,025 INFO ]: Found error trace [2018-06-24 21:39:47,025 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:47,025 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:47,025 INFO ]: Analyzing trace with hash 1103997427, now seen corresponding path program 2 times [2018-06-24 21:39:47,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:47,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:47,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,025 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:47,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,034 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:47,216 INFO ]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:47,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:47,216 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:47,225 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:47,250 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:47,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:47,252 INFO ]: Computing forward predicates... [2018-06-24 21:39:47,341 INFO ]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:47,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:47,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-06-24 21:39:47,360 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:39:47,360 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:39:47,360 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:39:47,361 INFO ]: Start difference. First operand 46 states and 75 transitions. Second operand 13 states. [2018-06-24 21:39:47,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:47,620 INFO ]: Finished difference Result 72 states and 122 transitions. [2018-06-24 21:39:47,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:39:47,620 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-24 21:39:47,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:47,621 INFO ]: With dead ends: 72 [2018-06-24 21:39:47,621 INFO ]: Without dead ends: 51 [2018-06-24 21:39:47,621 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:39:47,621 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:39:47,623 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-24 21:39:47,623 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:39:47,623 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2018-06-24 21:39:47,623 INFO ]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 16 [2018-06-24 21:39:47,623 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:47,623 INFO ]: Abstraction has 43 states and 69 transitions. [2018-06-24 21:39:47,623 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:39:47,623 INFO ]: Start isEmpty. Operand 43 states and 69 transitions. [2018-06-24 21:39:47,624 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:39:47,624 INFO ]: Found error trace [2018-06-24 21:39:47,624 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:47,624 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:47,624 INFO ]: Analyzing trace with hash 1278322773, now seen corresponding path program 1 times [2018-06-24 21:39:47,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:47,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:47,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,624 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:47,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:47,735 INFO ]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:47,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:47,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:47,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:47,763 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:47,764 INFO ]: Computing forward predicates... [2018-06-24 21:39:47,814 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:47,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:47,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-24 21:39:47,833 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:47,834 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:47,834 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:47,834 INFO ]: Start difference. First operand 43 states and 69 transitions. Second operand 11 states. [2018-06-24 21:39:47,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:47,943 INFO ]: Finished difference Result 45 states and 73 transitions. [2018-06-24 21:39:47,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:39:47,943 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-24 21:39:47,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:47,943 INFO ]: With dead ends: 45 [2018-06-24 21:39:47,943 INFO ]: Without dead ends: 41 [2018-06-24 21:39:47,944 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-24 21:39:47,944 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 21:39:47,945 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-06-24 21:39:47,945 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:39:47,945 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 56 transitions. [2018-06-24 21:39:47,945 INFO ]: Start accepts. Automaton has 34 states and 56 transitions. Word has length 16 [2018-06-24 21:39:47,945 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:47,945 INFO ]: Abstraction has 34 states and 56 transitions. [2018-06-24 21:39:47,945 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:47,945 INFO ]: Start isEmpty. Operand 34 states and 56 transitions. [2018-06-24 21:39:47,945 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:39:47,945 INFO ]: Found error trace [2018-06-24 21:39:47,945 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:47,945 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:47,945 INFO ]: Analyzing trace with hash -723473862, now seen corresponding path program 2 times [2018-06-24 21:39:47,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:47,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:47,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:47,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:48,019 INFO ]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 21:39:48,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:48,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:48,025 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:48,050 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:48,050 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:48,052 INFO ]: Computing forward predicates... [2018-06-24 21:39:48,089 INFO ]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:48,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:48,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-24 21:39:48,119 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:48,119 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:48,119 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:48,120 INFO ]: Start difference. First operand 34 states and 56 transitions. Second operand 11 states. [2018-06-24 21:39:48,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:48,214 INFO ]: Finished difference Result 40 states and 68 transitions. [2018-06-24 21:39:48,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:39:48,214 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-24 21:39:48,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:48,214 INFO ]: With dead ends: 40 [2018-06-24 21:39:48,214 INFO ]: Without dead ends: 40 [2018-06-24 21:39:48,215 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:39:48,215 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 21:39:48,216 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-24 21:39:48,216 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:39:48,216 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-06-24 21:39:48,216 INFO ]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 17 [2018-06-24 21:39:48,216 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:48,216 INFO ]: Abstraction has 36 states and 60 transitions. [2018-06-24 21:39:48,216 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:48,216 INFO ]: Start isEmpty. Operand 36 states and 60 transitions. [2018-06-24 21:39:48,216 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:39:48,216 INFO ]: Found error trace [2018-06-24 21:39:48,216 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:48,216 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:48,217 INFO ]: Analyzing trace with hash -587634271, now seen corresponding path program 2 times [2018-06-24 21:39:48,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:48,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:48,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:48,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:48,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:48,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:48,508 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:48,508 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:48,508 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:48,514 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:48,542 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:48,542 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:48,544 INFO ]: Computing forward predicates... [2018-06-24 21:39:48,550 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:48,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:48,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 21:39:48,575 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:39:48,575 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:39:48,575 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:48,575 INFO ]: Start difference. First operand 36 states and 60 transitions. Second operand 8 states. [2018-06-24 21:39:48,653 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:48,653 INFO ]: Finished difference Result 68 states and 115 transitions. [2018-06-24 21:39:48,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:39:48,653 INFO ]: Start accepts. Automaton has 8 states. Word has length 18 [2018-06-24 21:39:48,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:48,654 INFO ]: With dead ends: 68 [2018-06-24 21:39:48,654 INFO ]: Without dead ends: 68 [2018-06-24 21:39:48,654 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:39:48,654 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-24 21:39:48,656 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-06-24 21:39:48,656 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:39:48,656 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2018-06-24 21:39:48,656 INFO ]: Start accepts. Automaton has 41 states and 69 transitions. Word has length 18 [2018-06-24 21:39:48,656 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:48,656 INFO ]: Abstraction has 41 states and 69 transitions. [2018-06-24 21:39:48,656 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:39:48,656 INFO ]: Start isEmpty. Operand 41 states and 69 transitions. [2018-06-24 21:39:48,657 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:39:48,657 INFO ]: Found error trace [2018-06-24 21:39:48,657 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:48,657 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:48,657 INFO ]: Analyzing trace with hash -2119236802, now seen corresponding path program 3 times [2018-06-24 21:39:48,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:48,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:48,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:48,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:48,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:48,673 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:49,025 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:49,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:49,025 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:49,031 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:49,064 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:49,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:49,069 INFO ]: Computing forward predicates... [2018-06-24 21:39:49,785 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:49,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:49,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-24 21:39:49,804 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:39:49,804 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:39:49,804 INFO ]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:39:49,805 INFO ]: Start difference. First operand 41 states and 69 transitions. Second operand 23 states. [2018-06-24 21:39:50,698 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-06-24 21:39:51,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:51,594 INFO ]: Finished difference Result 135 states and 239 transitions. [2018-06-24 21:39:51,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:39:51,595 INFO ]: Start accepts. Automaton has 23 states. Word has length 18 [2018-06-24 21:39:51,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:51,596 INFO ]: With dead ends: 135 [2018-06-24 21:39:51,596 INFO ]: Without dead ends: 129 [2018-06-24 21:39:51,597 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:39:51,597 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-24 21:39:51,600 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 56. [2018-06-24 21:39:51,600 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 21:39:51,600 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 100 transitions. [2018-06-24 21:39:51,600 INFO ]: Start accepts. Automaton has 56 states and 100 transitions. Word has length 18 [2018-06-24 21:39:51,600 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:51,600 INFO ]: Abstraction has 56 states and 100 transitions. [2018-06-24 21:39:51,600 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:39:51,600 INFO ]: Start isEmpty. Operand 56 states and 100 transitions. [2018-06-24 21:39:51,601 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:39:51,601 INFO ]: Found error trace [2018-06-24 21:39:51,601 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:51,601 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:51,601 INFO ]: Analyzing trace with hash -1439178432, now seen corresponding path program 3 times [2018-06-24 21:39:51,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:51,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:51,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:51,601 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:51,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:51,611 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:51,820 INFO ]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:51,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:51,820 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:51,827 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:51,897 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:51,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:51,900 INFO ]: Computing forward predicates... [2018-06-24 21:39:52,096 INFO ]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:52,115 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:52,115 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 21:39:52,115 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:39:52,115 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:39:52,115 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:39:52,116 INFO ]: Start difference. First operand 56 states and 100 transitions. Second operand 15 states. [2018-06-24 21:39:52,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:52,443 INFO ]: Finished difference Result 93 states and 162 transitions. [2018-06-24 21:39:52,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:39:52,445 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-24 21:39:52,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:52,445 INFO ]: With dead ends: 93 [2018-06-24 21:39:52,445 INFO ]: Without dead ends: 83 [2018-06-24 21:39:52,446 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:39:52,446 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 21:39:52,447 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 57. [2018-06-24 21:39:52,447 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 21:39:52,448 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 95 transitions. [2018-06-24 21:39:52,448 INFO ]: Start accepts. Automaton has 57 states and 95 transitions. Word has length 18 [2018-06-24 21:39:52,448 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:52,448 INFO ]: Abstraction has 57 states and 95 transitions. [2018-06-24 21:39:52,448 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:39:52,448 INFO ]: Start isEmpty. Operand 57 states and 95 transitions. [2018-06-24 21:39:52,448 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:39:52,448 INFO ]: Found error trace [2018-06-24 21:39:52,448 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:52,448 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:52,448 INFO ]: Analyzing trace with hash -953119326, now seen corresponding path program 3 times [2018-06-24 21:39:52,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:52,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:52,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:52,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:52,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:52,457 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:52,846 INFO ]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:52,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:52,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:52,852 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:52,882 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:52,882 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:52,883 INFO ]: Computing forward predicates... [2018-06-24 21:39:53,227 INFO ]: Checked inductivity of 18 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:39:53,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:53,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-24 21:39:53,333 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:39:53,334 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:39:53,334 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:39:53,334 INFO ]: Start difference. First operand 57 states and 95 transitions. Second operand 12 states. [2018-06-24 21:39:53,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:53,491 INFO ]: Finished difference Result 64 states and 108 transitions. [2018-06-24 21:39:53,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:39:53,491 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-24 21:39:53,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:53,492 INFO ]: With dead ends: 64 [2018-06-24 21:39:53,492 INFO ]: Without dead ends: 51 [2018-06-24 21:39:53,492 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:39:53,492 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:39:53,493 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-24 21:39:53,493 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:39:53,494 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2018-06-24 21:39:53,494 INFO ]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 18 [2018-06-24 21:39:53,494 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:53,494 INFO ]: Abstraction has 47 states and 79 transitions. [2018-06-24 21:39:53,494 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:53,494 INFO ]: Start isEmpty. Operand 47 states and 79 transitions. [2018-06-24 21:39:53,494 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:39:53,494 INFO ]: Found error trace [2018-06-24 21:39:53,494 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:53,494 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:53,494 INFO ]: Analyzing trace with hash 633165915, now seen corresponding path program 3 times [2018-06-24 21:39:53,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:53,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:53,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:53,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,504 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:53,581 INFO ]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:53,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:53,581 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:53,588 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:53,620 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:53,620 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:53,621 INFO ]: Computing forward predicates... [2018-06-24 21:39:53,629 INFO ]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:53,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:53,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:39:53,648 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:53,649 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:53,649 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:53,649 INFO ]: Start difference. First operand 47 states and 79 transitions. Second operand 11 states. [2018-06-24 21:39:53,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:53,750 INFO ]: Finished difference Result 91 states and 151 transitions. [2018-06-24 21:39:53,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:39:53,750 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-24 21:39:53,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:53,750 INFO ]: With dead ends: 91 [2018-06-24 21:39:53,750 INFO ]: Without dead ends: 76 [2018-06-24 21:39:53,750 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:39:53,750 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 21:39:53,752 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 57. [2018-06-24 21:39:53,752 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 21:39:53,753 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 93 transitions. [2018-06-24 21:39:53,753 INFO ]: Start accepts. Automaton has 57 states and 93 transitions. Word has length 19 [2018-06-24 21:39:53,753 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:53,753 INFO ]: Abstraction has 57 states and 93 transitions. [2018-06-24 21:39:53,753 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:53,753 INFO ]: Start isEmpty. Operand 57 states and 93 transitions. [2018-06-24 21:39:53,753 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:39:53,753 INFO ]: Found error trace [2018-06-24 21:39:53,753 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:53,753 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:53,753 INFO ]: Analyzing trace with hash 46359901, now seen corresponding path program 1 times [2018-06-24 21:39:53,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:53,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:53,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,755 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:53,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,765 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:53,940 INFO ]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:53,940 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:53,940 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:53,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:53,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:53,979 INFO ]: Computing forward predicates... [2018-06-24 21:39:54,089 INFO ]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:54,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:54,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-06-24 21:39:54,108 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:54,109 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:54,109 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:54,109 INFO ]: Start difference. First operand 57 states and 93 transitions. Second operand 11 states. [2018-06-24 21:39:54,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:54,183 INFO ]: Finished difference Result 86 states and 139 transitions. [2018-06-24 21:39:54,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:39:54,183 INFO ]: Start accepts. Automaton has 11 states. Word has length 19 [2018-06-24 21:39:54,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:54,184 INFO ]: With dead ends: 86 [2018-06-24 21:39:54,184 INFO ]: Without dead ends: 86 [2018-06-24 21:39:54,184 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:39:54,184 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-24 21:39:54,186 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-06-24 21:39:54,186 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 21:39:54,186 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 107 transitions. [2018-06-24 21:39:54,186 INFO ]: Start accepts. Automaton has 65 states and 107 transitions. Word has length 19 [2018-06-24 21:39:54,186 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:54,186 INFO ]: Abstraction has 65 states and 107 transitions. [2018-06-24 21:39:54,186 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:54,186 INFO ]: Start isEmpty. Operand 65 states and 107 transitions. [2018-06-24 21:39:54,186 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:39:54,186 INFO ]: Found error trace [2018-06-24 21:39:54,186 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:54,187 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:54,187 INFO ]: Analyzing trace with hash 481321959, now seen corresponding path program 4 times [2018-06-24 21:39:54,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:54,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:54,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:54,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:54,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:54,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:54,457 INFO ]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:54,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:54,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:54,462 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:54,491 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:54,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:54,493 INFO ]: Computing forward predicates... [2018-06-24 21:39:54,598 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:54,617 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:54,618 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-06-24 21:39:54,618 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:39:54,618 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:39:54,618 INFO ]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:39:54,618 INFO ]: Start difference. First operand 65 states and 107 transitions. Second operand 19 states. [2018-06-24 21:39:55,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:55,014 INFO ]: Finished difference Result 150 states and 250 transitions. [2018-06-24 21:39:55,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:39:55,015 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-24 21:39:55,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:55,015 INFO ]: With dead ends: 150 [2018-06-24 21:39:55,015 INFO ]: Without dead ends: 124 [2018-06-24 21:39:55,016 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:39:55,016 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-24 21:39:55,020 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 79. [2018-06-24 21:39:55,020 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:39:55,021 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 129 transitions. [2018-06-24 21:39:55,021 INFO ]: Start accepts. Automaton has 79 states and 129 transitions. Word has length 19 [2018-06-24 21:39:55,021 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:55,021 INFO ]: Abstraction has 79 states and 129 transitions. [2018-06-24 21:39:55,021 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:39:55,021 INFO ]: Start isEmpty. Operand 79 states and 129 transitions. [2018-06-24 21:39:55,021 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:39:55,021 INFO ]: Found error trace [2018-06-24 21:39:55,021 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:55,021 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:55,021 INFO ]: Analyzing trace with hash -188678304, now seen corresponding path program 1 times [2018-06-24 21:39:55,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:55,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:55,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:55,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:55,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:55,032 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:55,371 INFO ]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:55,371 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:55,371 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-24 21:39:55,385 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-24 21:39:55,418 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:55,419 INFO ]: Computing forward predicates... [2018-06-24 21:39:55,423 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:55,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:55,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 21:39:55,443 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:39:55,443 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:39:55,443 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:39:55,443 INFO ]: Start difference. First operand 79 states and 129 transitions. Second operand 9 states. [2018-06-24 21:39:55,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:55,504 INFO ]: Finished difference Result 85 states and 135 transitions. [2018-06-24 21:39:55,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:39:55,505 INFO ]: Start accepts. Automaton has 9 states. Word has length 19 [2018-06-24 21:39:55,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:55,505 INFO ]: With dead ends: 85 [2018-06-24 21:39:55,505 INFO ]: Without dead ends: 72 [2018-06-24 21:39:55,505 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:39:55,505 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 21:39:55,506 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-06-24 21:39:55,506 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-24 21:39:55,507 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2018-06-24 21:39:55,507 INFO ]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 19 [2018-06-24 21:39:55,507 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:55,507 INFO ]: Abstraction has 62 states and 95 transitions. [2018-06-24 21:39:55,507 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:39:55,507 INFO ]: Start isEmpty. Operand 62 states and 95 transitions. [2018-06-24 21:39:55,507 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:39:55,507 INFO ]: Found error trace [2018-06-24 21:39:55,507 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:55,507 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:55,507 INFO ]: Analyzing trace with hash 1043863837, now seen corresponding path program 3 times [2018-06-24 21:39:55,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:55,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:55,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:55,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:55,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:55,517 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:55,619 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 21:39:55,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:55,619 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:55,627 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:55,660 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:55,660 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:55,662 INFO ]: Computing forward predicates... [2018-06-24 21:39:55,707 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 21:39:55,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:55,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2018-06-24 21:39:55,730 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:39:55,731 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:39:55,731 INFO ]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:39:55,731 INFO ]: Start difference. First operand 62 states and 95 transitions. Second operand 16 states. [2018-06-24 21:39:56,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:56,110 INFO ]: Finished difference Result 99 states and 163 transitions. [2018-06-24 21:39:56,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:39:56,110 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-24 21:39:56,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:56,111 INFO ]: With dead ends: 99 [2018-06-24 21:39:56,111 INFO ]: Without dead ends: 71 [2018-06-24 21:39:56,111 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-24 21:39:56,111 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-24 21:39:56,113 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 56. [2018-06-24 21:39:56,113 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 21:39:56,113 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2018-06-24 21:39:56,113 INFO ]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 20 [2018-06-24 21:39:56,113 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:56,113 INFO ]: Abstraction has 56 states and 86 transitions. [2018-06-24 21:39:56,113 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:39:56,113 INFO ]: Start isEmpty. Operand 56 states and 86 transitions. [2018-06-24 21:39:56,114 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:39:56,114 INFO ]: Found error trace [2018-06-24 21:39:56,114 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:56,114 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:56,114 INFO ]: Analyzing trace with hash -1159475063, now seen corresponding path program 4 times [2018-06-24 21:39:56,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:56,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:56,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:56,114 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:56,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:56,126 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:56,199 INFO ]: Checked inductivity of 25 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:39:56,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:56,199 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:56,205 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:56,236 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:56,236 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:56,238 INFO ]: Computing forward predicates... [2018-06-24 21:39:56,281 INFO ]: Checked inductivity of 25 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:39:56,301 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:56,301 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2018-06-24 21:39:56,301 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:39:56,301 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:39:56,301 INFO ]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:39:56,301 INFO ]: Start difference. First operand 56 states and 86 transitions. Second operand 14 states. [2018-06-24 21:39:56,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:56,450 INFO ]: Finished difference Result 69 states and 107 transitions. [2018-06-24 21:39:56,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:56,450 INFO ]: Start accepts. Automaton has 14 states. Word has length 20 [2018-06-24 21:39:56,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:56,450 INFO ]: With dead ends: 69 [2018-06-24 21:39:56,450 INFO ]: Without dead ends: 67 [2018-06-24 21:39:56,450 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:39:56,450 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 21:39:56,452 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-06-24 21:39:56,452 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:39:56,452 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2018-06-24 21:39:56,452 INFO ]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 20 [2018-06-24 21:39:56,452 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:56,452 INFO ]: Abstraction has 43 states and 69 transitions. [2018-06-24 21:39:56,452 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:39:56,452 INFO ]: Start isEmpty. Operand 43 states and 69 transitions. [2018-06-24 21:39:56,452 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:39:56,452 INFO ]: Found error trace [2018-06-24 21:39:56,453 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:56,453 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:56,453 INFO ]: Analyzing trace with hash 1500325675, now seen corresponding path program 5 times [2018-06-24 21:39:56,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:56,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:56,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:56,453 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:56,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:56,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:56,927 INFO ]: Checked inductivity of 29 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:39:56,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:56,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:56,932 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:56,967 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:39:56,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:56,968 INFO ]: Computing forward predicates... [2018-06-24 21:39:56,982 INFO ]: Checked inductivity of 29 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:39:57,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:57,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:39:57,001 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:39:57,001 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:39:57,001 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:39:57,002 INFO ]: Start difference. First operand 43 states and 69 transitions. Second operand 10 states. [2018-06-24 21:39:57,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:57,257 INFO ]: Finished difference Result 59 states and 91 transitions. [2018-06-24 21:39:57,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:39:57,258 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-24 21:39:57,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:57,258 INFO ]: With dead ends: 59 [2018-06-24 21:39:57,258 INFO ]: Without dead ends: 57 [2018-06-24 21:39:57,258 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:39:57,258 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 21:39:57,260 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-24 21:39:57,260 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 21:39:57,260 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2018-06-24 21:39:57,260 INFO ]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 21 [2018-06-24 21:39:57,260 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:57,260 INFO ]: Abstraction has 44 states and 70 transitions. [2018-06-24 21:39:57,260 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:39:57,260 INFO ]: Start isEmpty. Operand 44 states and 70 transitions. [2018-06-24 21:39:57,260 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:39:57,260 INFO ]: Found error trace [2018-06-24 21:39:57,260 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:57,260 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:57,260 INFO ]: Analyzing trace with hash -1486782531, now seen corresponding path program 4 times [2018-06-24 21:39:57,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:57,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:57,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:57,262 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:57,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:57,273 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:57,785 INFO ]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:39:57,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:57,785 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:57,790 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:57,825 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:57,825 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:57,826 INFO ]: Computing forward predicates... [2018-06-24 21:39:57,831 INFO ]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:39:57,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:57,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 21:39:57,851 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:39:57,851 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:39:57,851 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:39:57,851 INFO ]: Start difference. First operand 44 states and 70 transitions. Second operand 10 states. [2018-06-24 21:39:57,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:57,959 INFO ]: Finished difference Result 92 states and 146 transitions. [2018-06-24 21:39:57,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:39:57,959 INFO ]: Start accepts. Automaton has 10 states. Word has length 22 [2018-06-24 21:39:57,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:57,960 INFO ]: With dead ends: 92 [2018-06-24 21:39:57,960 INFO ]: Without dead ends: 92 [2018-06-24 21:39:57,966 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-24 21:39:57,966 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-24 21:39:57,968 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 50. [2018-06-24 21:39:57,968 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:39:57,968 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2018-06-24 21:39:57,968 INFO ]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 22 [2018-06-24 21:39:57,968 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:57,968 INFO ]: Abstraction has 50 states and 80 transitions. [2018-06-24 21:39:57,968 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:39:57,968 INFO ]: Start isEmpty. Operand 50 states and 80 transitions. [2018-06-24 21:39:57,969 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:39:57,969 INFO ]: Found error trace [2018-06-24 21:39:57,969 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:57,969 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:57,969 INFO ]: Analyzing trace with hash 1581712090, now seen corresponding path program 6 times [2018-06-24 21:39:57,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:57,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:57,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:57,969 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:57,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:57,987 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:58,384 INFO ]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:58,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:58,411 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:58,416 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:39:58,457 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 21:39:58,457 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:58,462 INFO ]: Computing forward predicates... [2018-06-24 21:40:05,475 INFO ]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 21:40:05,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:05,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-06-24 21:40:05,495 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:40:05,496 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:40:05,496 INFO ]: CoverageRelationStatistics Valid=82, Invalid=661, Unknown=13, NotChecked=0, Total=756 [2018-06-24 21:40:05,496 INFO ]: Start difference. First operand 50 states and 80 transitions. Second operand 28 states. [2018-06-24 21:40:40,111 WARN ]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 81 Received shutdown request... [2018-06-24 21:40:42,196 WARN ]: Removed 5 from assertion stack [2018-06-24 21:40:42,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:40:42,196 WARN ]: Verification canceled [2018-06-24 21:40:42,197 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:40:42,198 WARN ]: Timeout [2018-06-24 21:40:42,198 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:40:42 BasicIcfg [2018-06-24 21:40:42,198 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:40:42,199 INFO ]: Toolchain (without parser) took 69258.28 ms. Allocated memory was 309.3 MB in the beginning and 657.5 MB in the end (delta: 348.1 MB). Free memory was 262.7 MB in the beginning and 535.6 MB in the end (delta: -272.9 MB). Peak memory consumption was 75.2 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:42,200 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:40:42,200 INFO ]: ChcToBoogie took 61.07 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:42,201 INFO ]: Boogie Preprocessor took 37.24 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:42,201 INFO ]: RCFGBuilder took 385.10 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 245.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:42,201 INFO ]: BlockEncodingV2 took 58.75 ms. Allocated memory is still 309.3 MB. Free memory was 245.7 MB in the beginning and 242.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:42,202 INFO ]: TraceAbstraction took 68705.74 ms. Allocated memory was 309.3 MB in the beginning and 657.5 MB in the end (delta: 348.1 MB). Free memory was 242.7 MB in the beginning and 535.6 MB in the end (delta: -292.9 MB). Peak memory consumption was 55.2 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:42,210 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.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.07 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.24 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 385.10 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 245.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 58.75 ms. Allocated memory is still 309.3 MB. Free memory was 245.7 MB in the beginning and 242.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 68705.74 ms. Allocated memory was 309.3 MB in the beginning and 657.5 MB in the end (delta: 348.1 MB). Free memory was 242.7 MB in the beginning and 535.6 MB in the end (delta: -292.9 MB). Peak memory consumption was 55.2 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 37 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 locations, 1 error locations. TIMEOUT Result, 68.6s OverallTime, 41 OverallIterations, 4 TraceHistogramMax, 47.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 548 SDtfs, 1441 SDslu, 2831 SDs, 0 SdLazy, 4523 SolverSat, 1585 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 29.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 499 SyntacticMatches, 11 SemanticMatches, 621 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 31.2s 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, 17.9s 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-24_21-40-42-227.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-24_21-40-42-227.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-24_21-40-42-227.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-24_21-40-42-227.csv Completed graceful shutdown