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-big2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:41:56,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:41:56,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:41:56,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:41:56,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:41:56,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:41:56,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:41:56,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:41:56,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:41:56,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:41:56,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:41:56,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:41:56,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:41:56,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:41:56,475 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:41:56,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:41:56,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:41:56,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:41:56,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:41:56,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:41:56,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:41:56,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:41:56,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:41:56,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:41:56,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:41:56,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:41:56,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:41:56,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:41:56,507 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:41:56,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:41:56,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:41:56,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:41:56,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:41:56,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:41:56,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:41:56,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:41:56,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:41:56,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:41:56,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:41:56,539 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:41:56,540 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:41:56,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:41:56,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:41:56,541 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:41:56,541 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:41:56,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:41:56,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:41:56,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:41:56,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:41:56,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:41:56,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:41:56,542 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:41:56,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:41:56,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:41:56,543 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:41:56,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:41:56,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:41:56,546 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:41:56,548 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:41:56,548 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:41:56,591 INFO ]: Repository-Root is: /tmp [2018-06-26 18:41:56,608 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:41:56,613 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:41:56,614 INFO ]: Initializing SmtParser... [2018-06-26 18:41:56,614 INFO ]: SmtParser initialized [2018-06-26 18:41:56,616 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-26 18:41:56,617 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:41:56,708 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@57e0b5d1 [2018-06-26 18:41:56,974 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-26 18:41:56,979 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:41:56,984 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:41:56,984 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:41:56,984 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:41:56,984 INFO ]: ChcToBoogie initialized [2018-06-26 18:41:56,988 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:41:56" (1/1) ... [2018-06-26 18:41:57,047 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57 Unit [2018-06-26 18:41:57,047 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:41:57,048 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:41:57,048 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:41:57,048 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:41:57,071 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,071 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,077 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,077 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,082 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,085 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,086 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,088 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:41:57,088 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:41:57,088 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:41:57,088 INFO ]: RCFGBuilder initialized [2018-06-26 18:41:57,089 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:41:57,108 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:41:57,108 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:41:57,108 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:41:57,108 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:41:57,108 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:41:57,108 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 18:41:57,422 INFO ]: Using library mode [2018-06-26 18:41:57,423 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:57 BoogieIcfgContainer [2018-06-26 18:41:57,423 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:41:57,427 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:41:57,427 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:41:57,428 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:41:57,428 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:57" (1/1) ... [2018-06-26 18:41:57,445 INFO ]: Initial Icfg 12 locations, 20 edges [2018-06-26 18:41:57,446 INFO ]: Using Remove infeasible edges [2018-06-26 18:41:57,447 INFO ]: Using Maximize final states [2018-06-26 18:41:57,447 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:41:57,447 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:41:57,449 INFO ]: Using Remove sink states [2018-06-26 18:41:57,450 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:41:57,450 INFO ]: Using Use SBE [2018-06-26 18:41:57,456 INFO ]: SBE split 0 edges [2018-06-26 18:41:57,461 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:41:57,463 INFO ]: 0 new accepting states [2018-06-26 18:41:57,487 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:41:57,489 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:41:57,492 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:41:57,493 INFO ]: 0 new accepting states [2018-06-26 18:41:57,493 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:41:57,493 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:41:57,493 INFO ]: Encoded RCFG 8 locations, 16 edges [2018-06-26 18:41:57,494 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:41:57 BasicIcfg [2018-06-26 18:41:57,494 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:41:57,495 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:41:57,495 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:41:57,498 INFO ]: TraceAbstraction initialized [2018-06-26 18:41:57,498 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:41:56" (1/4) ... [2018-06-26 18:41:57,499 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf92eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:41:57, skipping insertion in model container [2018-06-26 18:41:57,499 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:57" (2/4) ... [2018-06-26 18:41:57,499 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf92eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:41:57, skipping insertion in model container [2018-06-26 18:41:57,499 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:57" (3/4) ... [2018-06-26 18:41:57,501 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf92eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:41:57, skipping insertion in model container [2018-06-26 18:41:57,501 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:41:57" (4/4) ... [2018-06-26 18:41:57,503 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:41:57,512 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:41:57,518 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:41:57,559 INFO ]: Using default assertion order modulation [2018-06-26 18:41:57,560 INFO ]: Interprodecural is true [2018-06-26 18:41:57,560 INFO ]: Hoare is false [2018-06-26 18:41:57,560 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:41:57,560 INFO ]: Backedges is TWOTRACK [2018-06-26 18:41:57,560 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:41:57,560 INFO ]: Difference is false [2018-06-26 18:41:57,560 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:41:57,560 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:41:57,574 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 18:41:57,591 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:41:57,591 INFO ]: Found error trace [2018-06-26 18:41:57,592 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:57,592 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:57,596 INFO ]: Analyzing trace with hash 226146214, now seen corresponding path program 1 times [2018-06-26 18:41:57,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:57,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:57,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:57,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:57,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:57,675 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:57,770 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:57,771 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:57,771 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:41:57,773 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:41:57,785 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:41:57,786 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:57,788 INFO ]: Start difference. First operand 8 states. Second operand 5 states. [2018-06-26 18:41:58,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:58,310 INFO ]: Finished difference Result 14 states and 36 transitions. [2018-06-26 18:41:58,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:41:58,312 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 18:41:58,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:58,321 INFO ]: With dead ends: 14 [2018-06-26 18:41:58,321 INFO ]: Without dead ends: 13 [2018-06-26 18:41:58,323 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:41:58,337 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:41:58,357 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 18:41:58,359 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:41:58,360 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-26 18:41:58,361 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 7 [2018-06-26 18:41:58,362 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:58,362 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-26 18:41:58,362 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:41:58,362 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-26 18:41:58,362 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:41:58,362 INFO ]: Found error trace [2018-06-26 18:41:58,362 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:58,362 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:58,363 INFO ]: Analyzing trace with hash -1642556787, now seen corresponding path program 1 times [2018-06-26 18:41:58,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:58,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:58,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:58,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:58,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:58,396 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:58,735 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:58,735 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:58,735 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:41:58,736 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:41:58,736 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:41:58,737 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:58,737 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 5 states. [2018-06-26 18:41:59,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:59,026 INFO ]: Finished difference Result 17 states and 46 transitions. [2018-06-26 18:41:59,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:41:59,027 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 18:41:59,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:59,028 INFO ]: With dead ends: 17 [2018-06-26 18:41:59,028 INFO ]: Without dead ends: 17 [2018-06-26 18:41:59,029 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:41:59,029 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:41:59,032 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 18:41:59,032 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:41:59,032 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2018-06-26 18:41:59,032 INFO ]: Start accepts. Automaton has 15 states and 41 transitions. Word has length 8 [2018-06-26 18:41:59,032 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:59,032 INFO ]: Abstraction has 15 states and 41 transitions. [2018-06-26 18:41:59,032 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:41:59,032 INFO ]: Start isEmpty. Operand 15 states and 41 transitions. [2018-06-26 18:41:59,033 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:41:59,033 INFO ]: Found error trace [2018-06-26 18:41:59,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:59,033 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:59,033 INFO ]: Analyzing trace with hash -1613927636, now seen corresponding path program 1 times [2018-06-26 18:41:59,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:59,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:59,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:59,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:59,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:59,054 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:59,100 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:59,100 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:59,100 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:41:59,100 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:41:59,100 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:41:59,100 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:59,100 INFO ]: Start difference. First operand 15 states and 41 transitions. Second operand 5 states. [2018-06-26 18:41:59,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:59,212 INFO ]: Finished difference Result 23 states and 64 transitions. [2018-06-26 18:41:59,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:41:59,212 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 18:41:59,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:59,213 INFO ]: With dead ends: 23 [2018-06-26 18:41:59,213 INFO ]: Without dead ends: 23 [2018-06-26 18:41:59,214 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:41:59,214 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:41:59,216 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-26 18:41:59,216 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:41:59,217 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-06-26 18:41:59,217 INFO ]: Start accepts. Automaton has 20 states and 56 transitions. Word has length 8 [2018-06-26 18:41:59,217 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:59,217 INFO ]: Abstraction has 20 states and 56 transitions. [2018-06-26 18:41:59,217 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:41:59,218 INFO ]: Start isEmpty. Operand 20 states and 56 transitions. [2018-06-26 18:41:59,218 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:41:59,218 INFO ]: Found error trace [2018-06-26 18:41:59,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:59,218 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:59,219 INFO ]: Analyzing trace with hash -1578833838, now seen corresponding path program 1 times [2018-06-26 18:41:59,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:59,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:59,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:59,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:59,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:59,237 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:59,360 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:59,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:41:59,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:41:59,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:59,404 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:59,413 INFO ]: Computing forward predicates... [2018-06-26 18:41:59,713 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:41:59,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:41:59,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-26 18:41:59,742 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:41:59,742 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:41:59,742 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:41:59,742 INFO ]: Start difference. First operand 20 states and 56 transitions. Second operand 8 states. [2018-06-26 18:41:59,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:59,915 INFO ]: Finished difference Result 32 states and 94 transitions. [2018-06-26 18:41:59,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:41:59,916 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-26 18:41:59,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:59,917 INFO ]: With dead ends: 32 [2018-06-26 18:41:59,917 INFO ]: Without dead ends: 28 [2018-06-26 18:41:59,917 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:41:59,917 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:41:59,920 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-06-26 18:41:59,920 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:41:59,921 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2018-06-26 18:41:59,921 INFO ]: Start accepts. Automaton has 22 states and 62 transitions. Word has length 8 [2018-06-26 18:41:59,921 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:59,921 INFO ]: Abstraction has 22 states and 62 transitions. [2018-06-26 18:41:59,921 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:41:59,921 INFO ]: Start isEmpty. Operand 22 states and 62 transitions. [2018-06-26 18:41:59,921 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:41:59,921 INFO ]: Found error trace [2018-06-26 18:41:59,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:59,922 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:59,922 INFO ]: Analyzing trace with hash -1577910317, now seen corresponding path program 1 times [2018-06-26 18:41:59,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:59,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:59,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:59,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:59,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:59,950 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:00,082 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:00,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:00,083 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:42:00,083 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:42:00,083 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:42:00,083 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:42:00,083 INFO ]: Start difference. First operand 22 states and 62 transitions. Second operand 4 states. [2018-06-26 18:42:00,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:00,159 INFO ]: Finished difference Result 33 states and 94 transitions. [2018-06-26 18:42:00,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:42:00,159 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-26 18:42:00,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:00,160 INFO ]: With dead ends: 33 [2018-06-26 18:42:00,160 INFO ]: Without dead ends: 33 [2018-06-26 18:42:00,160 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:00,160 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 18:42:00,164 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-06-26 18:42:00,164 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:42:00,165 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 68 transitions. [2018-06-26 18:42:00,165 INFO ]: Start accepts. Automaton has 24 states and 68 transitions. Word has length 8 [2018-06-26 18:42:00,165 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:00,165 INFO ]: Abstraction has 24 states and 68 transitions. [2018-06-26 18:42:00,165 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:42:00,165 INFO ]: Start isEmpty. Operand 24 states and 68 transitions. [2018-06-26 18:42:00,166 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:00,166 INFO ]: Found error trace [2018-06-26 18:42:00,166 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:00,166 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:00,166 INFO ]: Analyzing trace with hash 619872590, now seen corresponding path program 1 times [2018-06-26 18:42:00,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:00,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:00,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:00,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:00,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:00,179 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:00,224 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:00,225 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:00,225 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:00,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:00,255 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:00,256 INFO ]: Computing forward predicates... [2018-06-26 18:42:00,293 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:00,313 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:42:00,313 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-26 18:42:00,313 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:00,313 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:00,313 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:00,314 INFO ]: Start difference. First operand 24 states and 68 transitions. Second operand 8 states. [2018-06-26 18:42:00,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:00,737 INFO ]: Finished difference Result 44 states and 120 transitions. [2018-06-26 18:42:00,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:42:00,738 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 18:42:00,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:00,739 INFO ]: With dead ends: 44 [2018-06-26 18:42:00,739 INFO ]: Without dead ends: 35 [2018-06-26 18:42:00,739 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:00,740 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:42:00,743 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-26 18:42:00,744 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:42:00,744 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 66 transitions. [2018-06-26 18:42:00,744 INFO ]: Start accepts. Automaton has 29 states and 66 transitions. Word has length 9 [2018-06-26 18:42:00,744 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:00,744 INFO ]: Abstraction has 29 states and 66 transitions. [2018-06-26 18:42:00,745 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:00,745 INFO ]: Start isEmpty. Operand 29 states and 66 transitions. [2018-06-26 18:42:00,745 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:00,745 INFO ]: Found error trace [2018-06-26 18:42:00,745 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:00,745 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:00,745 INFO ]: Analyzing trace with hash 1507376271, now seen corresponding path program 1 times [2018-06-26 18:42:00,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:00,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:00,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:00,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:00,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:00,757 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:00,964 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:00,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:00,964 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:00,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:00,991 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:00,992 INFO ]: Computing forward predicates... [2018-06-26 18:42:01,131 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:01,150 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:42:01,150 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-26 18:42:01,150 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:42:01,150 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:42:01,151 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:01,151 INFO ]: Start difference. First operand 29 states and 66 transitions. Second operand 8 states. [2018-06-26 18:42:01,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:01,580 INFO ]: Finished difference Result 38 states and 83 transitions. [2018-06-26 18:42:01,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:42:01,581 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 18:42:01,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:01,581 INFO ]: With dead ends: 38 [2018-06-26 18:42:01,581 INFO ]: Without dead ends: 35 [2018-06-26 18:42:01,582 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:01,582 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:42:01,586 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-26 18:42:01,586 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:42:01,587 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2018-06-26 18:42:01,587 INFO ]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 9 [2018-06-26 18:42:01,587 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:01,587 INFO ]: Abstraction has 29 states and 60 transitions. [2018-06-26 18:42:01,587 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:42:01,587 INFO ]: Start isEmpty. Operand 29 states and 60 transitions. [2018-06-26 18:42:01,587 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:42:01,587 INFO ]: Found error trace [2018-06-26 18:42:01,587 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:01,587 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:01,588 INFO ]: Analyzing trace with hash -1698640602, now seen corresponding path program 2 times [2018-06-26 18:42:01,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:01,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:01,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:01,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:01,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:01,599 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:01,638 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:42:01,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:01,638 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:01,638 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:01,638 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:01,638 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:01,639 INFO ]: Start difference. First operand 29 states and 60 transitions. Second operand 5 states. [2018-06-26 18:42:01,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:01,670 INFO ]: Finished difference Result 48 states and 94 transitions. [2018-06-26 18:42:01,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:01,671 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 18:42:01,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:01,671 INFO ]: With dead ends: 48 [2018-06-26 18:42:01,671 INFO ]: Without dead ends: 39 [2018-06-26 18:42:01,672 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:01,672 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:42:01,675 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-26 18:42:01,675 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:42:01,676 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2018-06-26 18:42:01,676 INFO ]: Start accepts. Automaton has 26 states and 52 transitions. Word has length 9 [2018-06-26 18:42:01,676 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:01,676 INFO ]: Abstraction has 26 states and 52 transitions. [2018-06-26 18:42:01,676 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:01,676 INFO ]: Start isEmpty. Operand 26 states and 52 transitions. [2018-06-26 18:42:01,676 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:42:01,676 INFO ]: Found error trace [2018-06-26 18:42:01,676 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:01,676 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:01,677 INFO ]: Analyzing trace with hash 382477743, now seen corresponding path program 1 times [2018-06-26 18:42:01,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:01,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:01,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:01,678 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:01,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:01,694 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:01,733 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:01,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:01,733 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:01,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:01,760 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:01,761 INFO ]: Computing forward predicates... [2018-06-26 18:42:01,819 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:01,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:01,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:42:01,850 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:01,850 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:01,850 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:01,851 INFO ]: Start difference. First operand 26 states and 52 transitions. Second operand 6 states. [2018-06-26 18:42:01,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:01,909 INFO ]: Finished difference Result 30 states and 57 transitions. [2018-06-26 18:42:01,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:01,910 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 18:42:01,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:01,910 INFO ]: With dead ends: 30 [2018-06-26 18:42:01,910 INFO ]: Without dead ends: 30 [2018-06-26 18:42:01,910 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:01,910 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 18:42:01,913 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-26 18:42:01,913 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:42:01,914 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-06-26 18:42:01,914 INFO ]: Start accepts. Automaton has 28 states and 54 transitions. Word has length 10 [2018-06-26 18:42:01,914 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:01,914 INFO ]: Abstraction has 28 states and 54 transitions. [2018-06-26 18:42:01,914 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:01,914 INFO ]: Start isEmpty. Operand 28 states and 54 transitions. [2018-06-26 18:42:01,914 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:42:01,914 INFO ]: Found error trace [2018-06-26 18:42:01,914 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:01,914 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:01,914 INFO ]: Analyzing trace with hash -455438452, now seen corresponding path program 1 times [2018-06-26 18:42:01,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:01,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:01,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:01,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:01,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:01,925 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:01,990 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:01,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:01,990 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 18:42:01,991 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:42:01,991 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:42:01,991 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:42:01,991 INFO ]: Start difference. First operand 28 states and 54 transitions. Second operand 6 states. [2018-06-26 18:42:02,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:02,037 INFO ]: Finished difference Result 31 states and 57 transitions. [2018-06-26 18:42:02,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:02,037 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 18:42:02,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:02,038 INFO ]: With dead ends: 31 [2018-06-26 18:42:02,038 INFO ]: Without dead ends: 29 [2018-06-26 18:42:02,038 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:42:02,038 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:42:02,040 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-26 18:42:02,040 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 18:42:02,041 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2018-06-26 18:42:02,041 INFO ]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 10 [2018-06-26 18:42:02,041 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:02,041 INFO ]: Abstraction has 27 states and 51 transitions. [2018-06-26 18:42:02,041 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:42:02,041 INFO ]: Start isEmpty. Operand 27 states and 51 transitions. [2018-06-26 18:42:02,041 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:42:02,041 INFO ]: Found error trace [2018-06-26 18:42:02,042 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:02,042 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:02,042 INFO ]: Analyzing trace with hash -426809301, now seen corresponding path program 1 times [2018-06-26 18:42:02,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:02,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:02,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:02,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:02,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:02,051 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:02,087 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:42:02,087 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:02,087 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:02,088 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:02,088 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:02,088 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:02,088 INFO ]: Start difference. First operand 27 states and 51 transitions. Second operand 5 states. [2018-06-26 18:42:02,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:02,207 INFO ]: Finished difference Result 37 states and 74 transitions. [2018-06-26 18:42:02,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:02,207 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-26 18:42:02,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:02,208 INFO ]: With dead ends: 37 [2018-06-26 18:42:02,208 INFO ]: Without dead ends: 22 [2018-06-26 18:42:02,208 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:02,208 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:42:02,210 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 18:42:02,210 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:42:02,210 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-06-26 18:42:02,210 INFO ]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 10 [2018-06-26 18:42:02,211 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:02,211 INFO ]: Abstraction has 22 states and 41 transitions. [2018-06-26 18:42:02,211 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:02,211 INFO ]: Start isEmpty. Operand 22 states and 41 transitions. [2018-06-26 18:42:02,211 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:42:02,211 INFO ]: Found error trace [2018-06-26 18:42:02,211 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:02,211 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:02,211 INFO ]: Analyzing trace with hash 1580975051, now seen corresponding path program 1 times [2018-06-26 18:42:02,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:02,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:02,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:02,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:02,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:02,226 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:02,485 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:02,485 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:02,485 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:02,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:02,528 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:02,531 INFO ]: Computing forward predicates... [2018-06-26 18:42:02,920 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:02,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:02,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-26 18:42:02,939 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:42:02,939 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:42:02,939 INFO ]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:02,939 INFO ]: Start difference. First operand 22 states and 41 transitions. Second operand 13 states. [2018-06-26 18:42:03,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:03,533 INFO ]: Finished difference Result 63 states and 142 transitions. [2018-06-26 18:42:03,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:42:03,533 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-26 18:42:03,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:03,534 INFO ]: With dead ends: 63 [2018-06-26 18:42:03,534 INFO ]: Without dead ends: 51 [2018-06-26 18:42:03,534 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:42:03,534 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:42:03,537 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-06-26 18:42:03,537 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:42:03,538 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2018-06-26 18:42:03,538 INFO ]: Start accepts. Automaton has 29 states and 56 transitions. Word has length 11 [2018-06-26 18:42:03,538 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:03,538 INFO ]: Abstraction has 29 states and 56 transitions. [2018-06-26 18:42:03,538 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:42:03,538 INFO ]: Start isEmpty. Operand 29 states and 56 transitions. [2018-06-26 18:42:03,538 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:42:03,538 INFO ]: Found error trace [2018-06-26 18:42:03,538 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:03,538 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:03,538 INFO ]: Analyzing trace with hash -938984883, now seen corresponding path program 2 times [2018-06-26 18:42:03,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:03,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:03,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:03,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:03,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:03,557 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:03,626 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:03,626 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:03,626 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:03,632 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:03,660 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:03,660 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:03,661 INFO ]: Computing forward predicates... [2018-06-26 18:42:03,721 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:03,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:03,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-26 18:42:03,742 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:03,743 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:03,743 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:03,743 INFO ]: Start difference. First operand 29 states and 56 transitions. Second operand 11 states. [2018-06-26 18:42:04,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:04,095 INFO ]: Finished difference Result 54 states and 112 transitions. [2018-06-26 18:42:04,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:42:04,095 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-26 18:42:04,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:04,096 INFO ]: With dead ends: 54 [2018-06-26 18:42:04,096 INFO ]: Without dead ends: 48 [2018-06-26 18:42:04,097 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:42:04,097 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 18:42:04,100 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-26 18:42:04,100 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:42:04,100 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 65 transitions. [2018-06-26 18:42:04,100 INFO ]: Start accepts. Automaton has 34 states and 65 transitions. Word has length 11 [2018-06-26 18:42:04,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:04,100 INFO ]: Abstraction has 34 states and 65 transitions. [2018-06-26 18:42:04,100 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:04,100 INFO ]: Start isEmpty. Operand 34 states and 65 transitions. [2018-06-26 18:42:04,101 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:42:04,101 INFO ]: Found error trace [2018-06-26 18:42:04,101 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:04,101 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:04,101 INFO ]: Analyzing trace with hash -283707923, now seen corresponding path program 1 times [2018-06-26 18:42:04,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:04,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:04,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:04,102 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:04,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:04,109 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:04,176 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:04,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:42:04,176 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:42:04,176 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:42:04,176 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:42:04,176 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:42:04,177 INFO ]: Start difference. First operand 34 states and 65 transitions. Second operand 5 states. [2018-06-26 18:42:04,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:04,251 INFO ]: Finished difference Result 34 states and 64 transitions. [2018-06-26 18:42:04,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:42:04,251 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-26 18:42:04,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:04,251 INFO ]: With dead ends: 34 [2018-06-26 18:42:04,251 INFO ]: Without dead ends: 29 [2018-06-26 18:42:04,252 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:42:04,252 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:42:04,254 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 18:42:04,254 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:42:04,254 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 57 transitions. [2018-06-26 18:42:04,254 INFO ]: Start accepts. Automaton has 29 states and 57 transitions. Word has length 11 [2018-06-26 18:42:04,254 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:04,254 INFO ]: Abstraction has 29 states and 57 transitions. [2018-06-26 18:42:04,254 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:42:04,254 INFO ]: Start isEmpty. Operand 29 states and 57 transitions. [2018-06-26 18:42:04,255 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:42:04,255 INFO ]: Found error trace [2018-06-26 18:42:04,255 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:04,255 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:04,255 INFO ]: Analyzing trace with hash 79685935, now seen corresponding path program 2 times [2018-06-26 18:42:04,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:04,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:04,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:04,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:04,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:04,267 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:04,374 INFO ]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:04,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:04,374 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) [2018-06-26 18:42:04,391 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:04,433 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:04,433 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:04,435 INFO ]: Computing forward predicates... [2018-06-26 18:42:04,534 INFO ]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:04,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:04,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-26 18:42:04,553 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:42:04,553 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:42:04,553 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:04,553 INFO ]: Start difference. First operand 29 states and 57 transitions. Second operand 13 states. [2018-06-26 18:42:04,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:04,753 INFO ]: Finished difference Result 52 states and 107 transitions. [2018-06-26 18:42:04,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:42:04,753 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-26 18:42:04,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:04,754 INFO ]: With dead ends: 52 [2018-06-26 18:42:04,754 INFO ]: Without dead ends: 47 [2018-06-26 18:42:04,754 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:04,754 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 18:42:04,757 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-06-26 18:42:04,757 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 18:42:04,757 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 74 transitions. [2018-06-26 18:42:04,757 INFO ]: Start accepts. Automaton has 37 states and 74 transitions. Word has length 12 [2018-06-26 18:42:04,757 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:04,757 INFO ]: Abstraction has 37 states and 74 transitions. [2018-06-26 18:42:04,757 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:42:04,757 INFO ]: Start isEmpty. Operand 37 states and 74 transitions. [2018-06-26 18:42:04,758 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:42:04,758 INFO ]: Found error trace [2018-06-26 18:42:04,758 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:04,758 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:04,758 INFO ]: Analyzing trace with hash 1695798066, now seen corresponding path program 1 times [2018-06-26 18:42:04,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:04,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:04,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:04,759 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:04,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:04,768 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:04,826 INFO ]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:04,827 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:04,827 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:04,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:04,857 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:04,858 INFO ]: Computing forward predicates... [2018-06-26 18:42:04,906 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:42:04,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:04,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-26 18:42:04,926 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:04,926 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:04,926 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:04,926 INFO ]: Start difference. First operand 37 states and 74 transitions. Second operand 11 states. [2018-06-26 18:42:05,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:05,148 INFO ]: Finished difference Result 56 states and 116 transitions. [2018-06-26 18:42:05,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:42:05,148 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 18:42:05,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:05,148 INFO ]: With dead ends: 56 [2018-06-26 18:42:05,148 INFO ]: Without dead ends: 27 [2018-06-26 18:42:05,149 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:42:05,149 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 18:42:05,151 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-26 18:42:05,151 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:42:05,151 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-26 18:42:05,151 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 12 [2018-06-26 18:42:05,151 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:05,151 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-26 18:42:05,151 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:05,151 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-26 18:42:05,151 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:05,151 INFO ]: Found error trace [2018-06-26 18:42:05,152 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:05,152 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:05,152 INFO ]: Analyzing trace with hash 1016474420, now seen corresponding path program 3 times [2018-06-26 18:42:05,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:05,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:05,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:05,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:05,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:05,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:05,398 INFO ]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:05,398 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:05,398 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:05,406 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:05,431 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:05,431 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:05,433 INFO ]: Computing forward predicates... [2018-06-26 18:42:05,473 INFO ]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:05,492 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:05,492 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-26 18:42:05,492 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:42:05,492 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:42:05,492 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:42:05,492 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 12 states. [2018-06-26 18:42:05,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:05,580 INFO ]: Finished difference Result 28 states and 54 transitions. [2018-06-26 18:42:05,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:42:05,581 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 18:42:05,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:05,581 INFO ]: With dead ends: 28 [2018-06-26 18:42:05,581 INFO ]: Without dead ends: 28 [2018-06-26 18:42:05,582 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:05,582 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:42:05,585 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-06-26 18:42:05,585 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:42:05,585 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2018-06-26 18:42:05,585 INFO ]: Start accepts. Automaton has 23 states and 47 transitions. Word has length 14 [2018-06-26 18:42:05,585 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:05,585 INFO ]: Abstraction has 23 states and 47 transitions. [2018-06-26 18:42:05,585 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:42:05,585 INFO ]: Start isEmpty. Operand 23 states and 47 transitions. [2018-06-26 18:42:05,586 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:05,586 INFO ]: Found error trace [2018-06-26 18:42:05,586 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:05,586 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:05,586 INFO ]: Analyzing trace with hash 207127794, now seen corresponding path program 4 times [2018-06-26 18:42:05,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:05,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:05,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:05,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:05,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:05,602 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:05,895 INFO ]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:42:05,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:05,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:05,901 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:05,926 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:05,926 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:05,929 INFO ]: Computing forward predicates... [2018-06-26 18:42:06,261 INFO ]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:06,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:06,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-26 18:42:06,295 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:42:06,295 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:42:06,296 INFO ]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:42:06,296 INFO ]: Start difference. First operand 23 states and 47 transitions. Second operand 16 states. [2018-06-26 18:42:07,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:07,110 INFO ]: Finished difference Result 78 states and 189 transitions. [2018-06-26 18:42:07,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 18:42:07,114 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-26 18:42:07,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:07,115 INFO ]: With dead ends: 78 [2018-06-26 18:42:07,115 INFO ]: Without dead ends: 51 [2018-06-26 18:42:07,115 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:42:07,115 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:42:07,117 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-06-26 18:42:07,117 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:42:07,118 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-06-26 18:42:07,118 INFO ]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 14 [2018-06-26 18:42:07,118 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:07,118 INFO ]: Abstraction has 29 states and 58 transitions. [2018-06-26 18:42:07,118 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:42:07,118 INFO ]: Start isEmpty. Operand 29 states and 58 transitions. [2018-06-26 18:42:07,118 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:42:07,118 INFO ]: Found error trace [2018-06-26 18:42:07,118 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:07,119 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:07,119 INFO ]: Analyzing trace with hash 887186164, now seen corresponding path program 3 times [2018-06-26 18:42:07,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:07,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:07,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:07,119 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:07,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:07,129 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:07,453 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:07,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:07,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:07,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:07,486 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:42:07,486 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:07,488 INFO ]: Computing forward predicates... [2018-06-26 18:42:07,581 INFO ]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:07,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:07,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-26 18:42:07,600 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:42:07,600 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:42:07,600 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:42:07,600 INFO ]: Start difference. First operand 29 states and 58 transitions. Second operand 15 states. [2018-06-26 18:42:08,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:08,511 INFO ]: Finished difference Result 71 states and 152 transitions. [2018-06-26 18:42:08,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 18:42:08,511 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-26 18:42:08,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:08,512 INFO ]: With dead ends: 71 [2018-06-26 18:42:08,512 INFO ]: Without dead ends: 60 [2018-06-26 18:42:08,512 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:42:08,512 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 18:42:08,514 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-06-26 18:42:08,514 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:42:08,515 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2018-06-26 18:42:08,515 INFO ]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 14 [2018-06-26 18:42:08,515 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:08,515 INFO ]: Abstraction has 35 states and 69 transitions. [2018-06-26 18:42:08,515 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:42:08,515 INFO ]: Start isEmpty. Operand 35 states and 69 transitions. [2018-06-26 18:42:08,516 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:42:08,516 INFO ]: Found error trace [2018-06-26 18:42:08,516 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:08,516 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:08,516 INFO ]: Analyzing trace with hash -72478266, now seen corresponding path program 5 times [2018-06-26 18:42:08,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:08,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:08,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:08,516 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:08,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:08,531 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:09,264 INFO ]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:09,277 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:09,277 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:09,283 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:09,324 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 18:42:09,324 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:09,325 INFO ]: Computing forward predicates... [2018-06-26 18:42:09,422 INFO ]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:42:09,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:09,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-26 18:42:09,441 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:42:09,441 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:42:09,441 INFO ]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:09,441 INFO ]: Start difference. First operand 35 states and 69 transitions. Second operand 17 states. [2018-06-26 18:42:09,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:09,694 INFO ]: Finished difference Result 61 states and 132 transitions. [2018-06-26 18:42:09,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 18:42:09,694 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-26 18:42:09,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:09,695 INFO ]: With dead ends: 61 [2018-06-26 18:42:09,695 INFO ]: Without dead ends: 53 [2018-06-26 18:42:09,695 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:42:09,695 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 18:42:09,698 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-26 18:42:09,698 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 18:42:09,698 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 78 transitions. [2018-06-26 18:42:09,698 INFO ]: Start accepts. Automaton has 37 states and 78 transitions. Word has length 15 [2018-06-26 18:42:09,698 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:09,698 INFO ]: Abstraction has 37 states and 78 transitions. [2018-06-26 18:42:09,698 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:42:09,698 INFO ]: Start isEmpty. Operand 37 states and 78 transitions. [2018-06-26 18:42:09,786 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:42:09,786 INFO ]: Found error trace [2018-06-26 18:42:09,786 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:09,787 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:09,787 INFO ]: Analyzing trace with hash 961148943, now seen corresponding path program 4 times [2018-06-26 18:42:09,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:09,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:09,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:09,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:09,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:09,799 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:09,843 INFO ]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:09,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:09,843 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:09,848 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:09,875 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:09,875 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:09,877 INFO ]: Computing forward predicates... [2018-06-26 18:42:09,889 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:09,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:09,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 18:42:09,908 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:42:09,908 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:42:09,909 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:42:09,909 INFO ]: Start difference. First operand 37 states and 78 transitions. Second operand 10 states. [2018-06-26 18:42:09,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:09,966 INFO ]: Finished difference Result 40 states and 82 transitions. [2018-06-26 18:42:09,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:42:09,967 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-26 18:42:09,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:09,967 INFO ]: With dead ends: 40 [2018-06-26 18:42:09,967 INFO ]: Without dead ends: 40 [2018-06-26 18:42:09,967 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:42:09,967 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 18:42:09,969 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-06-26 18:42:09,969 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:42:09,969 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2018-06-26 18:42:09,969 INFO ]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 16 [2018-06-26 18:42:09,970 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:09,970 INFO ]: Abstraction has 35 states and 75 transitions. [2018-06-26 18:42:09,970 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:42:09,970 INFO ]: Start isEmpty. Operand 35 states and 75 transitions. [2018-06-26 18:42:09,970 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:42:09,970 INFO ]: Found error trace [2018-06-26 18:42:09,970 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:09,970 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:09,971 INFO ]: Analyzing trace with hash -389154835, now seen corresponding path program 6 times [2018-06-26 18:42:09,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:09,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:09,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:09,971 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:09,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:09,983 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:10,064 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:10,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:10,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:10,070 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:10,101 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 18:42:10,102 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:10,103 INFO ]: Computing forward predicates... [2018-06-26 18:42:10,171 INFO ]: Checked inductivity of 22 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:42:10,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:10,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-26 18:42:10,190 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:42:10,190 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:42:10,190 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:42:10,191 INFO ]: Start difference. First operand 35 states and 75 transitions. Second operand 11 states. [2018-06-26 18:42:10,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:10,243 INFO ]: Finished difference Result 42 states and 83 transitions. [2018-06-26 18:42:10,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:42:10,244 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-26 18:42:10,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:10,244 INFO ]: With dead ends: 42 [2018-06-26 18:42:10,244 INFO ]: Without dead ends: 42 [2018-06-26 18:42:10,245 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:42:10,245 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 18:42:10,246 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-26 18:42:10,246 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:42:10,247 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 70 transitions. [2018-06-26 18:42:10,247 INFO ]: Start accepts. Automaton has 32 states and 70 transitions. Word has length 17 [2018-06-26 18:42:10,247 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:10,247 INFO ]: Abstraction has 32 states and 70 transitions. [2018-06-26 18:42:10,247 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:42:10,247 INFO ]: Start isEmpty. Operand 32 states and 70 transitions. [2018-06-26 18:42:10,247 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:42:10,247 INFO ]: Found error trace [2018-06-26 18:42:10,248 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:10,248 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:10,248 INFO ]: Analyzing trace with hash -782181845, now seen corresponding path program 7 times [2018-06-26 18:42:10,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:10,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:10,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:10,248 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:10,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:10,264 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:10,432 INFO ]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:10,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:10,432 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:10,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:10,472 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:10,477 INFO ]: Computing forward predicates... [2018-06-26 18:42:10,794 INFO ]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:10,826 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:10,826 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-26 18:42:10,826 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:42:10,826 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:42:10,826 INFO ]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:10,827 INFO ]: Start difference. First operand 32 states and 70 transitions. Second operand 22 states. [2018-06-26 18:42:11,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:11,936 INFO ]: Finished difference Result 104 states and 251 transitions. [2018-06-26 18:42:11,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:42:11,937 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-26 18:42:11,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:11,938 INFO ]: With dead ends: 104 [2018-06-26 18:42:11,938 INFO ]: Without dead ends: 72 [2018-06-26 18:42:11,938 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 18:42:11,938 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 18:42:11,940 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 33. [2018-06-26 18:42:11,940 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:42:11,940 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 72 transitions. [2018-06-26 18:42:11,941 INFO ]: Start accepts. Automaton has 33 states and 72 transitions. Word has length 17 [2018-06-26 18:42:11,941 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:11,941 INFO ]: Abstraction has 33 states and 72 transitions. [2018-06-26 18:42:11,941 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:42:11,941 INFO ]: Start isEmpty. Operand 33 states and 72 transitions. [2018-06-26 18:42:11,941 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:42:11,941 INFO ]: Found error trace [2018-06-26 18:42:11,941 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:11,941 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:11,941 INFO ]: Analyzing trace with hash -81117267, now seen corresponding path program 5 times [2018-06-26 18:42:11,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:11,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:11,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:11,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:11,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:11,953 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:12,070 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:12,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:12,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:12,078 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:12,112 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 18:42:12,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:12,114 INFO ]: Computing forward predicates... [2018-06-26 18:42:12,213 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:12,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:12,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-26 18:42:12,233 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:42:12,233 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:42:12,233 INFO ]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:42:12,234 INFO ]: Start difference. First operand 33 states and 72 transitions. Second operand 19 states. [2018-06-26 18:42:12,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:12,652 INFO ]: Finished difference Result 104 states and 231 transitions. [2018-06-26 18:42:12,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 18:42:12,654 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-26 18:42:12,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:12,655 INFO ]: With dead ends: 104 [2018-06-26 18:42:12,655 INFO ]: Without dead ends: 90 [2018-06-26 18:42:12,655 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:42:12,655 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-26 18:42:12,657 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 47. [2018-06-26 18:42:12,657 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 18:42:12,658 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 97 transitions. [2018-06-26 18:42:12,658 INFO ]: Start accepts. Automaton has 47 states and 97 transitions. Word has length 17 [2018-06-26 18:42:12,658 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:12,658 INFO ]: Abstraction has 47 states and 97 transitions. [2018-06-26 18:42:12,658 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:42:12,658 INFO ]: Start isEmpty. Operand 47 states and 97 transitions. [2018-06-26 18:42:12,659 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:42:12,659 INFO ]: Found error trace [2018-06-26 18:42:12,659 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:12,659 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:12,659 INFO ]: Analyzing trace with hash 1009138575, now seen corresponding path program 8 times [2018-06-26 18:42:12,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:12,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:12,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:12,660 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:12,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:12,674 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:12,767 INFO ]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:12,767 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:12,767 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:42:12,788 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:12,826 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:12,826 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:12,828 INFO ]: Computing forward predicates... [2018-06-26 18:42:12,975 INFO ]: Checked inductivity of 27 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:42:12,994 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:12,994 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-26 18:42:12,995 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:42:12,995 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:42:12,995 INFO ]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:42:12,995 INFO ]: Start difference. First operand 47 states and 97 transitions. Second operand 21 states. [2018-06-26 18:42:13,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:13,405 INFO ]: Finished difference Result 89 states and 196 transitions. [2018-06-26 18:42:13,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:42:13,405 INFO ]: Start accepts. Automaton has 21 states. Word has length 18 [2018-06-26 18:42:13,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:13,406 INFO ]: With dead ends: 89 [2018-06-26 18:42:13,406 INFO ]: Without dead ends: 77 [2018-06-26 18:42:13,406 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:42:13,406 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-26 18:42:13,408 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 50. [2018-06-26 18:42:13,408 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:42:13,409 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 109 transitions. [2018-06-26 18:42:13,409 INFO ]: Start accepts. Automaton has 50 states and 109 transitions. Word has length 18 [2018-06-26 18:42:13,409 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:13,409 INFO ]: Abstraction has 50 states and 109 transitions. [2018-06-26 18:42:13,409 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:42:13,409 INFO ]: Start isEmpty. Operand 50 states and 109 transitions. [2018-06-26 18:42:13,410 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:42:13,410 INFO ]: Found error trace [2018-06-26 18:42:13,410 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:13,413 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:13,413 INFO ]: Analyzing trace with hash 751745254, now seen corresponding path program 6 times [2018-06-26 18:42:13,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:13,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:13,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:13,414 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:13,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:13,426 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:13,846 INFO ]: Checked inductivity of 30 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:13,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:13,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:13,852 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:13,886 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 18:42:13,886 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:13,888 INFO ]: Computing forward predicates... [2018-06-26 18:42:13,901 INFO ]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:13,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:13,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-26 18:42:13,920 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:42:13,920 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:42:13,921 INFO ]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:42:13,921 INFO ]: Start difference. First operand 50 states and 109 transitions. Second operand 12 states. [2018-06-26 18:42:13,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:13,986 INFO ]: Finished difference Result 56 states and 117 transitions. [2018-06-26 18:42:13,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:42:13,986 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-26 18:42:13,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:13,986 INFO ]: With dead ends: 56 [2018-06-26 18:42:13,987 INFO ]: Without dead ends: 56 [2018-06-26 18:42:13,987 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:13,987 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-26 18:42:13,989 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-06-26 18:42:13,989 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 18:42:13,989 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 105 transitions. [2018-06-26 18:42:13,989 INFO ]: Start accepts. Automaton has 47 states and 105 transitions. Word has length 19 [2018-06-26 18:42:13,989 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:13,989 INFO ]: Abstraction has 47 states and 105 transitions. [2018-06-26 18:42:13,989 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:42:13,989 INFO ]: Start isEmpty. Operand 47 states and 105 transitions. [2018-06-26 18:42:13,990 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:42:13,990 INFO ]: Found error trace [2018-06-26 18:42:13,990 INFO ]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:13,990 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:13,990 INFO ]: Analyzing trace with hash -588656940, now seen corresponding path program 9 times [2018-06-26 18:42:13,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:13,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:13,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:13,990 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:13,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:14,006 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:14,419 INFO ]: Checked inductivity of 35 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 18:42:14,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:14,437 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:14,449 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:14,487 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:42:14,487 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:14,489 INFO ]: Computing forward predicates... [2018-06-26 18:42:14,511 INFO ]: Checked inductivity of 35 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:42:14,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:14,531 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-06-26 18:42:14,531 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:42:14,531 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:42:14,531 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:42:14,531 INFO ]: Start difference. First operand 47 states and 105 transitions. Second operand 13 states. [2018-06-26 18:42:14,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:14,605 INFO ]: Finished difference Result 59 states and 119 transitions. [2018-06-26 18:42:14,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:42:14,606 INFO ]: Start accepts. Automaton has 13 states. Word has length 20 [2018-06-26 18:42:14,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:14,606 INFO ]: With dead ends: 59 [2018-06-26 18:42:14,606 INFO ]: Without dead ends: 59 [2018-06-26 18:42:14,606 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:42:14,606 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 18:42:14,608 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-06-26 18:42:14,608 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 18:42:14,608 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 99 transitions. [2018-06-26 18:42:14,608 INFO ]: Start accepts. Automaton has 43 states and 99 transitions. Word has length 20 [2018-06-26 18:42:14,608 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:14,608 INFO ]: Abstraction has 43 states and 99 transitions. [2018-06-26 18:42:14,609 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:42:14,609 INFO ]: Start isEmpty. Operand 43 states and 99 transitions. [2018-06-26 18:42:14,609 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:42:14,609 INFO ]: Found error trace [2018-06-26 18:42:14,609 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:14,609 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:14,609 INFO ]: Analyzing trace with hash -330491502, now seen corresponding path program 10 times [2018-06-26 18:42:14,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:14,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:14,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:14,610 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:14,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:14,637 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:14,860 INFO ]: Checked inductivity of 35 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:42:14,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:14,860 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:14,866 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:14,919 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:14,919 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:14,931 INFO ]: Computing forward predicates... [2018-06-26 18:42:15,412 INFO ]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:15,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:15,432 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2018-06-26 18:42:15,433 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:42:15,433 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:42:15,433 INFO ]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:15,433 INFO ]: Start difference. First operand 43 states and 99 transitions. Second operand 22 states. [2018-06-26 18:42:16,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:16,664 INFO ]: Finished difference Result 170 states and 443 transitions. [2018-06-26 18:42:16,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:42:16,665 INFO ]: Start accepts. Automaton has 22 states. Word has length 20 [2018-06-26 18:42:16,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:16,665 INFO ]: With dead ends: 170 [2018-06-26 18:42:16,665 INFO ]: Without dead ends: 95 [2018-06-26 18:42:16,666 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=312, Invalid=1410, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:42:16,666 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-26 18:42:16,668 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 51. [2018-06-26 18:42:16,668 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:42:16,668 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 112 transitions. [2018-06-26 18:42:16,668 INFO ]: Start accepts. Automaton has 51 states and 112 transitions. Word has length 20 [2018-06-26 18:42:16,668 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:16,668 INFO ]: Abstraction has 51 states and 112 transitions. [2018-06-26 18:42:16,668 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:42:16,668 INFO ]: Start isEmpty. Operand 51 states and 112 transitions. [2018-06-26 18:42:16,669 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 18:42:16,669 INFO ]: Found error trace [2018-06-26 18:42:16,669 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:16,669 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:16,669 INFO ]: Analyzing trace with hash -917297516, now seen corresponding path program 7 times [2018-06-26 18:42:16,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:16,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:16,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:16,669 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:16,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:16,682 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:16,892 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:16,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:16,892 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:16,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:16,938 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:16,941 INFO ]: Computing forward predicates... [2018-06-26 18:42:17,056 INFO ]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:17,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:17,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-26 18:42:17,074 INFO ]: Interpolant automaton has 23 states [2018-06-26 18:42:17,075 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 18:42:17,075 INFO ]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:42:17,075 INFO ]: Start difference. First operand 51 states and 112 transitions. Second operand 23 states. [2018-06-26 18:42:17,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:17,837 INFO ]: Finished difference Result 151 states and 336 transitions. [2018-06-26 18:42:17,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 18:42:17,838 INFO ]: Start accepts. Automaton has 23 states. Word has length 20 [2018-06-26 18:42:17,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:17,838 INFO ]: With dead ends: 151 [2018-06-26 18:42:17,838 INFO ]: Without dead ends: 127 [2018-06-26 18:42:17,839 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=450, Invalid=1530, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:42:17,839 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 18:42:17,842 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 61. [2018-06-26 18:42:17,842 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 18:42:17,843 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 131 transitions. [2018-06-26 18:42:17,843 INFO ]: Start accepts. Automaton has 61 states and 131 transitions. Word has length 20 [2018-06-26 18:42:17,843 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:17,843 INFO ]: Abstraction has 61 states and 131 transitions. [2018-06-26 18:42:17,843 INFO ]: Interpolant automaton has 23 states. [2018-06-26 18:42:17,843 INFO ]: Start isEmpty. Operand 61 states and 131 transitions. [2018-06-26 18:42:17,844 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:42:17,844 INFO ]: Found error trace [2018-06-26 18:42:17,844 INFO ]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:17,844 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:17,844 INFO ]: Analyzing trace with hash 479907430, now seen corresponding path program 11 times [2018-06-26 18:42:17,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:17,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:17,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:17,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:17,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:17,862 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:18,074 INFO ]: Checked inductivity of 41 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:18,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:18,074 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:18,081 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:18,124 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:42:18,125 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:18,127 INFO ]: Computing forward predicates... [2018-06-26 18:42:18,239 INFO ]: Checked inductivity of 41 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:42:18,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:18,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-26 18:42:18,258 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:42:18,258 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:42:18,258 INFO ]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:42:18,258 INFO ]: Start difference. First operand 61 states and 131 transitions. Second operand 25 states. [2018-06-26 18:42:18,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:18,722 INFO ]: Finished difference Result 123 states and 274 transitions. [2018-06-26 18:42:18,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 18:42:18,723 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-26 18:42:18,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:18,724 INFO ]: With dead ends: 123 [2018-06-26 18:42:18,724 INFO ]: Without dead ends: 106 [2018-06-26 18:42:18,725 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 18:42:18,725 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-26 18:42:18,727 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 65. [2018-06-26 18:42:18,727 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-26 18:42:18,728 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 146 transitions. [2018-06-26 18:42:18,728 INFO ]: Start accepts. Automaton has 65 states and 146 transitions. Word has length 21 [2018-06-26 18:42:18,728 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:18,728 INFO ]: Abstraction has 65 states and 146 transitions. [2018-06-26 18:42:18,728 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:42:18,728 INFO ]: Start isEmpty. Operand 65 states and 146 transitions. [2018-06-26 18:42:18,728 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:42:18,728 INFO ]: Found error trace [2018-06-26 18:42:18,728 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:18,729 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:18,729 INFO ]: Analyzing trace with hash 549311087, now seen corresponding path program 8 times [2018-06-26 18:42:18,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:18,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:18,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:18,729 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:18,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:18,743 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:19,183 INFO ]: Checked inductivity of 45 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:19,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:19,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:19,189 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:19,235 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:19,235 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:19,236 INFO ]: Computing forward predicates... [2018-06-26 18:42:19,261 INFO ]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:19,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:19,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-26 18:42:19,283 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:42:19,283 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:42:19,283 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:42:19,283 INFO ]: Start difference. First operand 65 states and 146 transitions. Second operand 14 states. [2018-06-26 18:42:19,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:19,357 INFO ]: Finished difference Result 75 states and 159 transitions. [2018-06-26 18:42:19,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:42:19,357 INFO ]: Start accepts. Automaton has 14 states. Word has length 22 [2018-06-26 18:42:19,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:19,358 INFO ]: With dead ends: 75 [2018-06-26 18:42:19,358 INFO ]: Without dead ends: 75 [2018-06-26 18:42:19,358 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:42:19,358 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 18:42:19,359 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 61. [2018-06-26 18:42:19,359 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 18:42:19,360 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 141 transitions. [2018-06-26 18:42:19,360 INFO ]: Start accepts. Automaton has 61 states and 141 transitions. Word has length 22 [2018-06-26 18:42:19,360 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:19,360 INFO ]: Abstraction has 61 states and 141 transitions. [2018-06-26 18:42:19,360 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:42:19,360 INFO ]: Start isEmpty. Operand 61 states and 141 transitions. [2018-06-26 18:42:19,360 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 18:42:19,360 INFO ]: Found error trace [2018-06-26 18:42:19,360 INFO ]: trace histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:19,360 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:19,360 INFO ]: Analyzing trace with hash -1385110195, now seen corresponding path program 12 times [2018-06-26 18:42:19,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:19,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:19,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:19,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:19,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:19,374 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:19,516 INFO ]: Checked inductivity of 51 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:42:19,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:19,537 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:19,543 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:19,642 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:42:19,642 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:19,645 INFO ]: Computing forward predicates... [2018-06-26 18:42:19,783 INFO ]: Checked inductivity of 51 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 18:42:19,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:19,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-26 18:42:19,802 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:42:19,802 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:42:19,802 INFO ]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:42:19,802 INFO ]: Start difference. First operand 61 states and 141 transitions. Second operand 24 states. [2018-06-26 18:42:20,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:20,032 INFO ]: Finished difference Result 79 states and 162 transitions. [2018-06-26 18:42:20,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:42:20,033 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-26 18:42:20,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:20,033 INFO ]: With dead ends: 79 [2018-06-26 18:42:20,033 INFO ]: Without dead ends: 79 [2018-06-26 18:42:20,034 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:42:20,034 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-26 18:42:20,036 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 56. [2018-06-26 18:42:20,036 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-26 18:42:20,036 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 134 transitions. [2018-06-26 18:42:20,036 INFO ]: Start accepts. Automaton has 56 states and 134 transitions. Word has length 23 [2018-06-26 18:42:20,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:20,036 INFO ]: Abstraction has 56 states and 134 transitions. [2018-06-26 18:42:20,036 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:42:20,036 INFO ]: Start isEmpty. Operand 56 states and 134 transitions. [2018-06-26 18:42:20,036 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 18:42:20,036 INFO ]: Found error trace [2018-06-26 18:42:20,036 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:20,037 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:20,037 INFO ]: Analyzing trace with hash 1898739851, now seen corresponding path program 13 times [2018-06-26 18:42:20,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:20,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:20,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:20,037 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:20,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:20,060 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:20,276 INFO ]: Checked inductivity of 51 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 18:42:20,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:20,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:20,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:20,326 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:20,331 INFO ]: Computing forward predicates... [2018-06-26 18:42:20,802 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:20,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:20,821 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 24 [2018-06-26 18:42:20,821 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:42:20,821 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:42:20,821 INFO ]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:42:20,821 INFO ]: Start difference. First operand 56 states and 134 transitions. Second operand 24 states. [2018-06-26 18:42:21,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:21,849 INFO ]: Finished difference Result 195 states and 507 transitions. [2018-06-26 18:42:21,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 18:42:21,849 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-26 18:42:21,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:21,850 INFO ]: With dead ends: 195 [2018-06-26 18:42:21,850 INFO ]: Without dead ends: 123 [2018-06-26 18:42:21,850 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=1687, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 18:42:21,851 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-26 18:42:21,853 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 65. [2018-06-26 18:42:21,853 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-26 18:42:21,853 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 148 transitions. [2018-06-26 18:42:21,853 INFO ]: Start accepts. Automaton has 65 states and 148 transitions. Word has length 23 [2018-06-26 18:42:21,853 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:21,853 INFO ]: Abstraction has 65 states and 148 transitions. [2018-06-26 18:42:21,853 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:42:21,854 INFO ]: Start isEmpty. Operand 65 states and 148 transitions. [2018-06-26 18:42:21,854 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 18:42:21,854 INFO ]: Found error trace [2018-06-26 18:42:21,854 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:21,854 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:21,854 INFO ]: Analyzing trace with hash 618876173, now seen corresponding path program 9 times [2018-06-26 18:42:21,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:21,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:21,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:21,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:21,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:21,867 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:22,075 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:22,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:22,075 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:22,081 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:22,123 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:42:22,123 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:22,125 INFO ]: Computing forward predicates... [2018-06-26 18:42:22,638 INFO ]: Checked inductivity of 51 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:22,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:22,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-06-26 18:42:22,659 INFO ]: Interpolant automaton has 27 states [2018-06-26 18:42:22,659 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 18:42:22,659 INFO ]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:42:22,659 INFO ]: Start difference. First operand 65 states and 148 transitions. Second operand 27 states. [2018-06-26 18:42:23,679 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:23,679 INFO ]: Finished difference Result 203 states and 458 transitions. [2018-06-26 18:42:23,679 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:42:23,680 INFO ]: Start accepts. Automaton has 27 states. Word has length 23 [2018-06-26 18:42:23,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:23,681 INFO ]: With dead ends: 203 [2018-06-26 18:42:23,681 INFO ]: Without dead ends: 171 [2018-06-26 18:42:23,681 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=624, Invalid=2132, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 18:42:23,682 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-26 18:42:23,685 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 77. [2018-06-26 18:42:23,686 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 18:42:23,686 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 171 transitions. [2018-06-26 18:42:23,686 INFO ]: Start accepts. Automaton has 77 states and 171 transitions. Word has length 23 [2018-06-26 18:42:23,686 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:23,686 INFO ]: Abstraction has 77 states and 171 transitions. [2018-06-26 18:42:23,686 INFO ]: Interpolant automaton has 27 states. [2018-06-26 18:42:23,686 INFO ]: Start isEmpty. Operand 77 states and 171 transitions. [2018-06-26 18:42:23,686 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 18:42:23,686 INFO ]: Found error trace [2018-06-26 18:42:23,687 INFO ]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:23,687 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:23,687 INFO ]: Analyzing trace with hash 781358575, now seen corresponding path program 14 times [2018-06-26 18:42:23,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:23,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:23,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:23,687 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:23,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:23,700 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:24,351 INFO ]: Checked inductivity of 58 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:24,352 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:24,352 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:24,357 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:24,399 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:24,399 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:24,402 INFO ]: Computing forward predicates... [2018-06-26 18:42:25,359 INFO ]: Checked inductivity of 58 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:42:25,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:25,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-06-26 18:42:25,378 INFO ]: Interpolant automaton has 29 states [2018-06-26 18:42:25,378 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 18:42:25,378 INFO ]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:42:25,378 INFO ]: Start difference. First operand 77 states and 171 transitions. Second operand 29 states. [2018-06-26 18:42:25,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:25,911 INFO ]: Finished difference Result 163 states and 366 transitions. [2018-06-26 18:42:25,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:42:25,911 INFO ]: Start accepts. Automaton has 29 states. Word has length 24 [2018-06-26 18:42:25,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:25,912 INFO ]: With dead ends: 163 [2018-06-26 18:42:25,912 INFO ]: Without dead ends: 140 [2018-06-26 18:42:25,913 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=534, Invalid=1916, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 18:42:25,913 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 18:42:25,915 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 82. [2018-06-26 18:42:25,915 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-26 18:42:25,916 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2018-06-26 18:42:25,916 INFO ]: Start accepts. Automaton has 82 states and 189 transitions. Word has length 24 [2018-06-26 18:42:25,916 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:25,916 INFO ]: Abstraction has 82 states and 189 transitions. [2018-06-26 18:42:25,916 INFO ]: Interpolant automaton has 29 states. [2018-06-26 18:42:25,916 INFO ]: Start isEmpty. Operand 82 states and 189 transitions. [2018-06-26 18:42:25,916 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 18:42:25,916 INFO ]: Found error trace [2018-06-26 18:42:25,916 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:25,917 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:25,917 INFO ]: Analyzing trace with hash -461247098, now seen corresponding path program 10 times [2018-06-26 18:42:25,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:25,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:25,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:25,917 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:25,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:25,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:26,203 INFO ]: Checked inductivity of 63 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:26,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:26,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:26,209 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:26,257 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:26,257 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:26,259 INFO ]: Computing forward predicates... [2018-06-26 18:42:26,283 INFO ]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:26,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:26,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 18:42:26,302 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:42:26,302 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:42:26,302 INFO ]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:42:26,302 INFO ]: Start difference. First operand 82 states and 189 transitions. Second operand 16 states. [2018-06-26 18:42:26,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:26,419 INFO ]: Finished difference Result 97 states and 208 transitions. [2018-06-26 18:42:26,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:42:26,420 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-26 18:42:26,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:26,420 INFO ]: With dead ends: 97 [2018-06-26 18:42:26,420 INFO ]: Without dead ends: 97 [2018-06-26 18:42:26,420 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:42:26,420 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-26 18:42:26,422 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-06-26 18:42:26,422 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 18:42:26,423 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2018-06-26 18:42:26,423 INFO ]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 25 [2018-06-26 18:42:26,423 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:26,423 INFO ]: Abstraction has 77 states and 183 transitions. [2018-06-26 18:42:26,423 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:42:26,423 INFO ]: Start isEmpty. Operand 77 states and 183 transitions. [2018-06-26 18:42:26,423 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:42:26,423 INFO ]: Found error trace [2018-06-26 18:42:26,423 INFO ]: trace histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:26,423 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:26,424 INFO ]: Analyzing trace with hash -686757260, now seen corresponding path program 15 times [2018-06-26 18:42:26,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:26,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:26,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,424 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:26,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:26,437 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,695 INFO ]: Checked inductivity of 70 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-26 18:42:27,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:27,695 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:27,702 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:27,760 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 18:42:27,760 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:27,762 INFO ]: Computing forward predicates... [2018-06-26 18:42:27,887 INFO ]: Checked inductivity of 70 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:42:27,907 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:27,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-06-26 18:42:27,907 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:42:27,907 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:42:27,907 INFO ]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:42:27,907 INFO ]: Start difference. First operand 77 states and 183 transitions. Second operand 28 states. [2018-06-26 18:42:28,304 WARN ]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-26 18:42:28,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:28,563 INFO ]: Finished difference Result 102 states and 212 transitions. [2018-06-26 18:42:28,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:42:28,564 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-26 18:42:28,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:28,564 INFO ]: With dead ends: 102 [2018-06-26 18:42:28,564 INFO ]: Without dead ends: 102 [2018-06-26 18:42:28,564 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=413, Invalid=1227, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:42:28,564 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-26 18:42:28,566 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 71. [2018-06-26 18:42:28,566 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 18:42:28,566 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 175 transitions. [2018-06-26 18:42:28,567 INFO ]: Start accepts. Automaton has 71 states and 175 transitions. Word has length 26 [2018-06-26 18:42:28,567 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:28,567 INFO ]: Abstraction has 71 states and 175 transitions. [2018-06-26 18:42:28,567 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:42:28,567 INFO ]: Start isEmpty. Operand 71 states and 175 transitions. [2018-06-26 18:42:28,567 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:42:28,567 INFO ]: Found error trace [2018-06-26 18:42:28,567 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:28,567 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:28,567 INFO ]: Analyzing trace with hash -1707825614, now seen corresponding path program 16 times [2018-06-26 18:42:28,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:28,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:28,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,569 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:28,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:28,595 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:28,733 INFO ]: Checked inductivity of 70 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:28,734 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:28,734 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) [2018-06-26 18:42:28,747 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:28,800 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:28,800 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:28,805 INFO ]: Computing forward predicates... [2018-06-26 18:42:29,260 INFO ]: Checked inductivity of 70 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:29,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:29,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 27 [2018-06-26 18:42:29,283 INFO ]: Interpolant automaton has 27 states [2018-06-26 18:42:29,283 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 18:42:29,283 INFO ]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:42:29,283 INFO ]: Start difference. First operand 71 states and 175 transitions. Second operand 27 states. [2018-06-26 18:42:30,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:30,395 INFO ]: Finished difference Result 253 states and 670 transitions. [2018-06-26 18:42:30,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 18:42:30,395 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-26 18:42:30,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:30,395 INFO ]: With dead ends: 253 [2018-06-26 18:42:30,395 INFO ]: Without dead ends: 155 [2018-06-26 18:42:30,396 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=475, Invalid=2177, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 18:42:30,396 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-26 18:42:30,399 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 81. [2018-06-26 18:42:30,399 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-26 18:42:30,399 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2018-06-26 18:42:30,399 INFO ]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 26 [2018-06-26 18:42:30,400 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:30,400 INFO ]: Abstraction has 81 states and 190 transitions. [2018-06-26 18:42:30,400 INFO ]: Interpolant automaton has 27 states. [2018-06-26 18:42:30,400 INFO ]: Start isEmpty. Operand 81 states and 190 transitions. [2018-06-26 18:42:30,400 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:42:30,400 INFO ]: Found error trace [2018-06-26 18:42:30,400 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:30,400 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:30,400 INFO ]: Analyzing trace with hash 998793780, now seen corresponding path program 11 times [2018-06-26 18:42:30,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:30,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:30,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,401 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:30,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:30,413 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:30,974 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:30,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:30,974 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:30,979 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:31,031 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:42:31,031 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:31,033 INFO ]: Computing forward predicates... [2018-06-26 18:42:31,051 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:31,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:31,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-26 18:42:31,070 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:42:31,070 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:42:31,070 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:42:31,070 INFO ]: Start difference. First operand 81 states and 190 transitions. Second operand 17 states. [2018-06-26 18:42:31,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:31,838 INFO ]: Finished difference Result 171 states and 400 transitions. [2018-06-26 18:42:31,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:42:31,838 INFO ]: Start accepts. Automaton has 17 states. Word has length 26 [2018-06-26 18:42:31,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:31,839 INFO ]: With dead ends: 171 [2018-06-26 18:42:31,839 INFO ]: Without dead ends: 171 [2018-06-26 18:42:31,839 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:42:31,840 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-26 18:42:31,843 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 94. [2018-06-26 18:42:31,843 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-26 18:42:31,844 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 218 transitions. [2018-06-26 18:42:31,844 INFO ]: Start accepts. Automaton has 94 states and 218 transitions. Word has length 26 [2018-06-26 18:42:31,844 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:31,844 INFO ]: Abstraction has 94 states and 218 transitions. [2018-06-26 18:42:31,844 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:42:31,844 INFO ]: Start isEmpty. Operand 94 states and 218 transitions. [2018-06-26 18:42:31,844 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:42:31,844 INFO ]: Found error trace [2018-06-26 18:42:31,844 INFO ]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:31,844 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:31,844 INFO ]: Analyzing trace with hash -1697053946, now seen corresponding path program 17 times [2018-06-26 18:42:31,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:31,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:31,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:31,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:31,859 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:32,063 INFO ]: Checked inductivity of 78 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:32,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:32,063 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:32,069 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:32,120 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:42:32,120 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:32,124 INFO ]: Computing forward predicates... [2018-06-26 18:42:32,251 INFO ]: Checked inductivity of 78 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:32,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:32,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-26 18:42:32,270 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:42:32,270 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:42:32,270 INFO ]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:42:32,270 INFO ]: Start difference. First operand 94 states and 218 transitions. Second operand 18 states. [2018-06-26 18:42:32,547 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:32,547 INFO ]: Finished difference Result 193 states and 453 transitions. [2018-06-26 18:42:32,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:42:32,548 INFO ]: Start accepts. Automaton has 18 states. Word has length 27 [2018-06-26 18:42:32,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:32,548 INFO ]: With dead ends: 193 [2018-06-26 18:42:32,548 INFO ]: Without dead ends: 193 [2018-06-26 18:42:32,549 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=592, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:42:32,549 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-26 18:42:32,552 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 109. [2018-06-26 18:42:32,552 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-26 18:42:32,553 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 250 transitions. [2018-06-26 18:42:32,553 INFO ]: Start accepts. Automaton has 109 states and 250 transitions. Word has length 27 [2018-06-26 18:42:32,553 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:32,553 INFO ]: Abstraction has 109 states and 250 transitions. [2018-06-26 18:42:32,553 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:42:32,553 INFO ]: Start isEmpty. Operand 109 states and 250 transitions. [2018-06-26 18:42:32,554 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:42:32,554 INFO ]: Found error trace [2018-06-26 18:42:32,554 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:32,554 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:32,554 INFO ]: Analyzing trace with hash 897361543, now seen corresponding path program 12 times [2018-06-26 18:42:32,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:32,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:32,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:32,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:32,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:32,567 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:32,761 INFO ]: Checked inductivity of 77 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:32,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:32,761 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:32,766 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:32,818 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:42:32,818 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:32,821 INFO ]: Computing forward predicates... [2018-06-26 18:42:33,072 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:33,090 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:33,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-26 18:42:33,091 INFO ]: Interpolant automaton has 34 states [2018-06-26 18:42:33,091 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 18:42:33,091 INFO ]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:42:33,091 INFO ]: Start difference. First operand 109 states and 250 transitions. Second operand 34 states. [2018-06-26 18:42:34,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:34,172 INFO ]: Finished difference Result 367 states and 799 transitions. [2018-06-26 18:42:34,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-26 18:42:34,173 INFO ]: Start accepts. Automaton has 34 states. Word has length 27 [2018-06-26 18:42:34,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:34,173 INFO ]: With dead ends: 367 [2018-06-26 18:42:34,174 INFO ]: Without dead ends: 218 [2018-06-26 18:42:34,175 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=705, Invalid=3851, Unknown=0, NotChecked=0, Total=4556 [2018-06-26 18:42:34,175 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-26 18:42:34,180 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-06-26 18:42:34,180 INFO ]: Start removeUnreachable. Operand 194 states. [2018-06-26 18:42:34,181 INFO ]: Finished removeUnreachable. Reduced from 194 states to 194 states and 458 transitions. [2018-06-26 18:42:34,181 INFO ]: Start accepts. Automaton has 194 states and 458 transitions. Word has length 27 [2018-06-26 18:42:34,181 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:34,181 INFO ]: Abstraction has 194 states and 458 transitions. [2018-06-26 18:42:34,181 INFO ]: Interpolant automaton has 34 states. [2018-06-26 18:42:34,181 INFO ]: Start isEmpty. Operand 194 states and 458 transitions. [2018-06-26 18:42:34,182 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:42:34,182 INFO ]: Found error trace [2018-06-26 18:42:34,182 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:34,182 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:34,182 INFO ]: Analyzing trace with hash 504334533, now seen corresponding path program 1 times [2018-06-26 18:42:34,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:34,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:34,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:34,182 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:34,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:34,197 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:34,890 INFO ]: Checked inductivity of 77 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:42:34,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:34,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:34,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:34,942 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:34,945 INFO ]: Computing forward predicates... [2018-06-26 18:42:35,160 INFO ]: Checked inductivity of 77 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:35,179 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:35,179 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-26 18:42:35,179 INFO ]: Interpolant automaton has 32 states [2018-06-26 18:42:35,179 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 18:42:35,179 INFO ]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:42:35,180 INFO ]: Start difference. First operand 194 states and 458 transitions. Second operand 32 states. [2018-06-26 18:42:35,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:35,981 INFO ]: Finished difference Result 620 states and 1582 transitions. [2018-06-26 18:42:35,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:42:35,981 INFO ]: Start accepts. Automaton has 32 states. Word has length 27 [2018-06-26 18:42:35,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:35,983 INFO ]: With dead ends: 620 [2018-06-26 18:42:35,983 INFO ]: Without dead ends: 381 [2018-06-26 18:42:35,984 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=635, Invalid=2445, Unknown=0, NotChecked=0, Total=3080 [2018-06-26 18:42:35,984 INFO ]: Start minimizeSevpa. Operand 381 states. [2018-06-26 18:42:35,990 INFO ]: Finished minimizeSevpa. Reduced states from 381 to 123. [2018-06-26 18:42:35,990 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-26 18:42:35,991 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 316 transitions. [2018-06-26 18:42:35,991 INFO ]: Start accepts. Automaton has 123 states and 316 transitions. Word has length 27 [2018-06-26 18:42:35,991 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:35,991 INFO ]: Abstraction has 123 states and 316 transitions. [2018-06-26 18:42:35,991 INFO ]: Interpolant automaton has 32 states. [2018-06-26 18:42:35,991 INFO ]: Start isEmpty. Operand 123 states and 316 transitions. [2018-06-26 18:42:35,991 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:42:35,991 INFO ]: Found error trace [2018-06-26 18:42:35,991 INFO ]: trace histogram [7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:35,991 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:35,992 INFO ]: Analyzing trace with hash -1375151443, now seen corresponding path program 18 times [2018-06-26 18:42:35,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:35,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:35,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:35,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:35,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:36,008 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:36,690 INFO ]: Checked inductivity of 92 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:42:36,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:36,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:36,698 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:36,754 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:42:36,754 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:36,757 INFO ]: Computing forward predicates... [2018-06-26 18:42:36,790 INFO ]: Checked inductivity of 92 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 18:42:36,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:36,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 19 [2018-06-26 18:42:36,820 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:42:36,820 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:42:36,820 INFO ]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:42:36,821 INFO ]: Start difference. First operand 123 states and 316 transitions. Second operand 19 states. [2018-06-26 18:42:36,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:36,954 INFO ]: Finished difference Result 100 states and 185 transitions. [2018-06-26 18:42:36,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:42:36,954 INFO ]: Start accepts. Automaton has 19 states. Word has length 29 [2018-06-26 18:42:36,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:36,955 INFO ]: With dead ends: 100 [2018-06-26 18:42:36,955 INFO ]: Without dead ends: 100 [2018-06-26 18:42:36,955 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:42:36,955 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-26 18:42:36,957 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 60. [2018-06-26 18:42:36,957 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-26 18:42:36,957 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 138 transitions. [2018-06-26 18:42:36,958 INFO ]: Start accepts. Automaton has 60 states and 138 transitions. Word has length 29 [2018-06-26 18:42:36,958 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:36,958 INFO ]: Abstraction has 60 states and 138 transitions. [2018-06-26 18:42:36,961 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:42:36,961 INFO ]: Start isEmpty. Operand 60 states and 138 transitions. [2018-06-26 18:42:36,961 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:42:36,961 INFO ]: Found error trace [2018-06-26 18:42:36,961 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:36,961 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:36,962 INFO ]: Analyzing trace with hash 925671147, now seen corresponding path program 19 times [2018-06-26 18:42:36,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:36,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:36,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:36,962 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:36,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:36,986 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:37,261 INFO ]: Checked inductivity of 92 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-26 18:42:37,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:37,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:37,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:37,342 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:37,347 INFO ]: Computing forward predicates... [2018-06-26 18:42:37,883 INFO ]: Checked inductivity of 92 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:37,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:37,902 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 30 [2018-06-26 18:42:37,902 INFO ]: Interpolant automaton has 30 states [2018-06-26 18:42:37,902 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 18:42:37,902 INFO ]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:42:37,903 INFO ]: Start difference. First operand 60 states and 138 transitions. Second operand 30 states. [2018-06-26 18:42:39,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:39,254 INFO ]: Finished difference Result 207 states and 521 transitions. [2018-06-26 18:42:39,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:42:39,254 INFO ]: Start accepts. Automaton has 30 states. Word has length 29 [2018-06-26 18:42:39,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:39,255 INFO ]: With dead ends: 207 [2018-06-26 18:42:39,255 INFO ]: Without dead ends: 135 [2018-06-26 18:42:39,256 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=578, Invalid=2728, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 18:42:39,256 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-26 18:42:39,258 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 71. [2018-06-26 18:42:39,258 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 18:42:39,258 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 154 transitions. [2018-06-26 18:42:39,259 INFO ]: Start accepts. Automaton has 71 states and 154 transitions. Word has length 29 [2018-06-26 18:42:39,259 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:39,259 INFO ]: Abstraction has 71 states and 154 transitions. [2018-06-26 18:42:39,259 INFO ]: Interpolant automaton has 30 states. [2018-06-26 18:42:39,259 INFO ]: Start isEmpty. Operand 71 states and 154 transitions. [2018-06-26 18:42:39,259 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 18:42:39,259 INFO ]: Found error trace [2018-06-26 18:42:39,259 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:39,259 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:39,259 INFO ]: Analyzing trace with hash -763272595, now seen corresponding path program 13 times [2018-06-26 18:42:39,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:39,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:39,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:39,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:39,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:39,276 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:39,481 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:39,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:39,481 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:39,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:39,547 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:39,550 INFO ]: Computing forward predicates... [2018-06-26 18:42:39,760 INFO ]: Checked inductivity of 92 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:39,779 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:39,779 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2018-06-26 18:42:39,779 INFO ]: Interpolant automaton has 35 states [2018-06-26 18:42:39,779 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 18:42:39,779 INFO ]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:42:39,779 INFO ]: Start difference. First operand 71 states and 154 transitions. Second operand 35 states. [2018-06-26 18:42:40,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:40,743 INFO ]: Finished difference Result 247 states and 510 transitions. [2018-06-26 18:42:40,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-26 18:42:40,743 INFO ]: Start accepts. Automaton has 35 states. Word has length 29 [2018-06-26 18:42:40,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:40,744 INFO ]: With dead ends: 247 [2018-06-26 18:42:40,744 INFO ]: Without dead ends: 196 [2018-06-26 18:42:40,745 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1059, Invalid=3633, Unknown=0, NotChecked=0, Total=4692 [2018-06-26 18:42:40,746 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-26 18:42:40,749 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 80. [2018-06-26 18:42:40,749 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 18:42:40,750 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 164 transitions. [2018-06-26 18:42:40,750 INFO ]: Start accepts. Automaton has 80 states and 164 transitions. Word has length 29 [2018-06-26 18:42:40,750 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:40,750 INFO ]: Abstraction has 80 states and 164 transitions. [2018-06-26 18:42:40,750 INFO ]: Interpolant automaton has 35 states. [2018-06-26 18:42:40,750 INFO ]: Start isEmpty. Operand 80 states and 164 transitions. [2018-06-26 18:42:40,750 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:42:40,750 INFO ]: Found error trace [2018-06-26 18:42:40,750 INFO ]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:40,750 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:40,750 INFO ]: Analyzing trace with hash 2108880975, now seen corresponding path program 20 times [2018-06-26 18:42:40,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:40,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:40,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:42:40,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:40,769 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:40,890 INFO ]: Checked inductivity of 101 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:40,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:40,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:40,896 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:40,962 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:40,962 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:40,964 INFO ]: Computing forward predicates... [2018-06-26 18:42:41,189 INFO ]: Checked inductivity of 101 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:42:41,208 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:41,208 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-06-26 18:42:41,208 INFO ]: Interpolant automaton has 37 states [2018-06-26 18:42:41,208 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 18:42:41,208 INFO ]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 18:42:41,209 INFO ]: Start difference. First operand 80 states and 164 transitions. Second operand 37 states. [2018-06-26 18:42:42,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:42,028 INFO ]: Finished difference Result 569 states and 1516 transitions. [2018-06-26 18:42:42,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 18:42:42,028 INFO ]: Start accepts. Automaton has 37 states. Word has length 30 [2018-06-26 18:42:42,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:42,030 INFO ]: With dead ends: 569 [2018-06-26 18:42:42,030 INFO ]: Without dead ends: 531 [2018-06-26 18:42:42,031 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=864, Invalid=3168, Unknown=0, NotChecked=0, Total=4032 [2018-06-26 18:42:42,031 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-26 18:42:42,036 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 87. [2018-06-26 18:42:42,036 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-26 18:42:42,036 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 188 transitions. [2018-06-26 18:42:42,036 INFO ]: Start accepts. Automaton has 87 states and 188 transitions. Word has length 30 [2018-06-26 18:42:42,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:42,036 INFO ]: Abstraction has 87 states and 188 transitions. [2018-06-26 18:42:42,036 INFO ]: Interpolant automaton has 37 states. [2018-06-26 18:42:42,036 INFO ]: Start isEmpty. Operand 87 states and 188 transitions. [2018-06-26 18:42:42,037 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 18:42:42,037 INFO ]: Found error trace [2018-06-26 18:42:42,037 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:42,037 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:42,037 INFO ]: Analyzing trace with hash 472422950, now seen corresponding path program 14 times [2018-06-26 18:42:42,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:42,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:42,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:42,037 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:42,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:42,051 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:42,249 INFO ]: Checked inductivity of 108 backedges. 29 proven. 43 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:42,249 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:42,249 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:42,255 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:42:42,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:42:42,311 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:42,314 INFO ]: Computing forward predicates... [2018-06-26 18:42:42,330 INFO ]: Checked inductivity of 108 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:42,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:42,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-26 18:42:42,349 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:42:42,349 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:42:42,349 INFO ]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:42:42,349 INFO ]: Start difference. First operand 87 states and 188 transitions. Second operand 20 states. [2018-06-26 18:42:42,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:42,462 INFO ]: Finished difference Result 115 states and 222 transitions. [2018-06-26 18:42:42,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:42:42,462 INFO ]: Start accepts. Automaton has 20 states. Word has length 31 [2018-06-26 18:42:42,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:42,462 INFO ]: With dead ends: 115 [2018-06-26 18:42:42,462 INFO ]: Without dead ends: 115 [2018-06-26 18:42:42,462 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=282, Invalid=530, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:42:42,462 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-26 18:42:42,464 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 80. [2018-06-26 18:42:42,464 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 18:42:42,465 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 180 transitions. [2018-06-26 18:42:42,465 INFO ]: Start accepts. Automaton has 80 states and 180 transitions. Word has length 31 [2018-06-26 18:42:42,465 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:42,465 INFO ]: Abstraction has 80 states and 180 transitions. [2018-06-26 18:42:42,465 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:42:42,465 INFO ]: Start isEmpty. Operand 80 states and 180 transitions. [2018-06-26 18:42:42,465 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 18:42:42,465 INFO ]: Found error trace [2018-06-26 18:42:42,465 INFO ]: trace histogram [8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:42,465 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:42,466 INFO ]: Analyzing trace with hash 1790803476, now seen corresponding path program 21 times [2018-06-26 18:42:42,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:42,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:42,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:42,466 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:42,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:42,481 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:42,694 INFO ]: Checked inductivity of 117 backedges. 29 proven. 51 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-26 18:42:42,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:42,694 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:42,699 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:42,769 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:42:42,769 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:42,782 INFO ]: Computing forward predicates... [2018-06-26 18:42:42,810 INFO ]: Checked inductivity of 117 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-26 18:42:42,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:42,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 21 [2018-06-26 18:42:42,829 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:42:42,829 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:42:42,829 INFO ]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:42:42,829 INFO ]: Start difference. First operand 80 states and 180 transitions. Second operand 21 states. [2018-06-26 18:42:42,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:42,964 INFO ]: Finished difference Result 122 states and 228 transitions. [2018-06-26 18:42:42,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:42:42,964 INFO ]: Start accepts. Automaton has 21 states. Word has length 32 [2018-06-26 18:42:42,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:42,964 INFO ]: With dead ends: 122 [2018-06-26 18:42:42,964 INFO ]: Without dead ends: 122 [2018-06-26 18:42:42,964 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:42:42,964 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-26 18:42:42,967 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 72. [2018-06-26 18:42:42,967 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-26 18:42:42,967 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 170 transitions. [2018-06-26 18:42:42,967 INFO ]: Start accepts. Automaton has 72 states and 170 transitions. Word has length 32 [2018-06-26 18:42:42,967 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:42,967 INFO ]: Abstraction has 72 states and 170 transitions. [2018-06-26 18:42:42,967 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:42:42,967 INFO ]: Start isEmpty. Operand 72 states and 170 transitions. [2018-06-26 18:42:42,968 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 18:42:42,968 INFO ]: Found error trace [2018-06-26 18:42:42,968 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:42,968 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:42,968 INFO ]: Analyzing trace with hash 973155026, now seen corresponding path program 22 times [2018-06-26 18:42:42,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:42,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:42,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:42,968 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:42,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:42,994 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:43,251 INFO ]: Checked inductivity of 117 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-26 18:42:43,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:43,252 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:43,258 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:43,327 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:43,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:43,333 INFO ]: Computing forward predicates... [2018-06-26 18:42:43,848 INFO ]: Checked inductivity of 117 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:43,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:43,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 33 [2018-06-26 18:42:43,868 INFO ]: Interpolant automaton has 33 states [2018-06-26 18:42:43,868 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 18:42:43,869 INFO ]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 18:42:43,869 INFO ]: Start difference. First operand 72 states and 170 transitions. Second operand 33 states. [2018-06-26 18:42:45,444 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:45,444 INFO ]: Finished difference Result 253 states and 648 transitions. [2018-06-26 18:42:45,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-26 18:42:45,444 INFO ]: Start accepts. Automaton has 33 states. Word has length 32 [2018-06-26 18:42:45,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:45,445 INFO ]: With dead ends: 253 [2018-06-26 18:42:45,445 INFO ]: Without dead ends: 161 [2018-06-26 18:42:45,445 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2018-06-26 18:42:45,446 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-26 18:42:45,447 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 84. [2018-06-26 18:42:45,447 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-26 18:42:45,448 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 187 transitions. [2018-06-26 18:42:45,448 INFO ]: Start accepts. Automaton has 84 states and 187 transitions. Word has length 32 [2018-06-26 18:42:45,448 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:45,448 INFO ]: Abstraction has 84 states and 187 transitions. [2018-06-26 18:42:45,448 INFO ]: Interpolant automaton has 33 states. [2018-06-26 18:42:45,450 INFO ]: Start isEmpty. Operand 84 states and 187 transitions. [2018-06-26 18:42:45,450 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 18:42:45,450 INFO ]: Found error trace [2018-06-26 18:42:45,450 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:45,450 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:45,450 INFO ]: Analyzing trace with hash 1395856852, now seen corresponding path program 15 times [2018-06-26 18:42:45,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:45,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:45,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:45,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:45,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:45,467 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:45,648 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:45,648 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:45,648 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:45,653 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:42:45,720 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:42:45,720 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:45,723 INFO ]: Computing forward predicates... [2018-06-26 18:42:46,185 INFO ]: Checked inductivity of 117 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:46,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:46,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2018-06-26 18:42:46,205 INFO ]: Interpolant automaton has 39 states [2018-06-26 18:42:46,205 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 18:42:46,205 INFO ]: CoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:42:46,205 INFO ]: Start difference. First operand 84 states and 187 transitions. Second operand 39 states. [2018-06-26 18:42:47,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:47,549 INFO ]: Finished difference Result 302 states and 629 transitions. [2018-06-26 18:42:47,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-26 18:42:47,549 INFO ]: Start accepts. Automaton has 39 states. Word has length 32 [2018-06-26 18:42:47,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:47,550 INFO ]: With dead ends: 302 [2018-06-26 18:42:47,550 INFO ]: Without dead ends: 240 [2018-06-26 18:42:47,550 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1320, Invalid=4532, Unknown=0, NotChecked=0, Total=5852 [2018-06-26 18:42:47,551 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-26 18:42:47,553 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 95. [2018-06-26 18:42:47,553 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-26 18:42:47,554 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 201 transitions. [2018-06-26 18:42:47,554 INFO ]: Start accepts. Automaton has 95 states and 201 transitions. Word has length 32 [2018-06-26 18:42:47,554 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:47,554 INFO ]: Abstraction has 95 states and 201 transitions. [2018-06-26 18:42:47,554 INFO ]: Interpolant automaton has 39 states. [2018-06-26 18:42:47,554 INFO ]: Start isEmpty. Operand 95 states and 201 transitions. [2018-06-26 18:42:47,554 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 18:42:47,554 INFO ]: Found error trace [2018-06-26 18:42:47,554 INFO ]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:47,554 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:47,555 INFO ]: Analyzing trace with hash -684019802, now seen corresponding path program 23 times [2018-06-26 18:42:47,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:47,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:47,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:47,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:47,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:47,579 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:47,781 INFO ]: Checked inductivity of 127 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:47,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:47,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:47,786 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:42:47,854 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 18:42:47,854 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:47,857 INFO ]: Computing forward predicates... [2018-06-26 18:42:47,875 INFO ]: Checked inductivity of 127 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:42:47,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:47,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-26 18:42:47,895 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:42:47,895 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:42:47,895 INFO ]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:47,895 INFO ]: Start difference. First operand 95 states and 201 transitions. Second operand 22 states. [2018-06-26 18:42:48,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:48,241 INFO ]: Finished difference Result 627 states and 1651 transitions. [2018-06-26 18:42:48,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:42:48,241 INFO ]: Start accepts. Automaton has 22 states. Word has length 33 [2018-06-26 18:42:48,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:48,243 INFO ]: With dead ends: 627 [2018-06-26 18:42:48,243 INFO ]: Without dead ends: 627 [2018-06-26 18:42:48,243 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=533, Invalid=949, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 18:42:48,243 INFO ]: Start minimizeSevpa. Operand 627 states. [2018-06-26 18:42:48,251 INFO ]: Finished minimizeSevpa. Reduced states from 627 to 114. [2018-06-26 18:42:48,251 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-26 18:42:48,251 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 241 transitions. [2018-06-26 18:42:48,251 INFO ]: Start accepts. Automaton has 114 states and 241 transitions. Word has length 33 [2018-06-26 18:42:48,251 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:48,251 INFO ]: Abstraction has 114 states and 241 transitions. [2018-06-26 18:42:48,251 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:42:48,251 INFO ]: Start isEmpty. Operand 114 states and 241 transitions. [2018-06-26 18:42:48,252 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:42:48,252 INFO ]: Found error trace [2018-06-26 18:42:48,252 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:48,252 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:48,252 INFO ]: Analyzing trace with hash 566206255, now seen corresponding path program 16 times [2018-06-26 18:42:48,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:48,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:48,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:48,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:48,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:48,271 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:48,781 INFO ]: Checked inductivity of 135 backedges. 37 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 18:42:48,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:48,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:48,787 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:48,852 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:48,852 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:48,856 INFO ]: Computing forward predicates... [2018-06-26 18:42:49,252 INFO ]: Checked inductivity of 135 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 18:42:49,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:49,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-26 18:42:49,284 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:42:49,284 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:42:49,284 INFO ]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:42:49,284 INFO ]: Start difference. First operand 114 states and 241 transitions. Second operand 22 states. [2018-06-26 18:42:50,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:50,224 INFO ]: Finished difference Result 234 states and 486 transitions. [2018-06-26 18:42:50,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:42:50,224 INFO ]: Start accepts. Automaton has 22 states. Word has length 34 [2018-06-26 18:42:50,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:50,225 INFO ]: With dead ends: 234 [2018-06-26 18:42:50,225 INFO ]: Without dead ends: 234 [2018-06-26 18:42:50,225 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=568, Invalid=1072, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:42:50,225 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-26 18:42:50,228 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 106. [2018-06-26 18:42:50,228 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-26 18:42:50,228 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 232 transitions. [2018-06-26 18:42:50,228 INFO ]: Start accepts. Automaton has 106 states and 232 transitions. Word has length 34 [2018-06-26 18:42:50,228 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:50,228 INFO ]: Abstraction has 106 states and 232 transitions. [2018-06-26 18:42:50,228 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:42:50,228 INFO ]: Start isEmpty. Operand 106 states and 232 transitions. [2018-06-26 18:42:50,229 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:42:50,229 INFO ]: Found error trace [2018-06-26 18:42:50,229 INFO ]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:50,229 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:50,229 INFO ]: Analyzing trace with hash 269748053, now seen corresponding path program 24 times [2018-06-26 18:42:50,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:50,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:50,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:50,229 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:50,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:50,249 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:51,017 INFO ]: Checked inductivity of 136 backedges. 46 proven. 53 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-26 18:42:51,017 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:51,017 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:42:51,022 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:42:51,091 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 18:42:51,091 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:51,095 INFO ]: Computing forward predicates... [2018-06-26 18:42:51,604 INFO ]: Checked inductivity of 136 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 18:42:51,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:51,623 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2018-06-26 18:42:51,623 INFO ]: Interpolant automaton has 41 states [2018-06-26 18:42:51,623 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 18:42:51,623 INFO ]: CoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:42:51,623 INFO ]: Start difference. First operand 106 states and 232 transitions. Second operand 41 states. [2018-06-26 18:42:52,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:52,590 INFO ]: Finished difference Result 478 states and 1171 transitions. [2018-06-26 18:42:52,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-26 18:42:52,591 INFO ]: Start accepts. Automaton has 41 states. Word has length 34 [2018-06-26 18:42:52,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:52,591 INFO ]: With dead ends: 478 [2018-06-26 18:42:52,591 INFO ]: Without dead ends: 147 [2018-06-26 18:42:52,592 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=797, Invalid=4033, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 18:42:52,592 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-26 18:42:52,594 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 86. [2018-06-26 18:42:52,594 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-26 18:42:52,594 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 208 transitions. [2018-06-26 18:42:52,594 INFO ]: Start accepts. Automaton has 86 states and 208 transitions. Word has length 34 [2018-06-26 18:42:52,594 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:52,594 INFO ]: Abstraction has 86 states and 208 transitions. [2018-06-26 18:42:52,594 INFO ]: Interpolant automaton has 41 states. [2018-06-26 18:42:52,594 INFO ]: Start isEmpty. Operand 86 states and 208 transitions. [2018-06-26 18:42:52,594 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 18:42:52,594 INFO ]: Found error trace [2018-06-26 18:42:52,594 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:52,594 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:52,595 INFO ]: Analyzing trace with hash -512799413, now seen corresponding path program 25 times [2018-06-26 18:42:52,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:52,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:52,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:52,595 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:52,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:52,621 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 18:42:52,947 WARN ]: Verification canceled [2018-06-26 18:42:52,949 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:42:52,950 WARN ]: Timeout [2018-06-26 18:42:52,950 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:42:52 BasicIcfg [2018-06-26 18:42:52,950 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:42:52,951 INFO ]: Toolchain (without parser) took 55971.83 ms. Allocated memory was 309.3 MB in the beginning and 780.1 MB in the end (delta: 470.8 MB). Free memory was 263.5 MB in the beginning and 606.7 MB in the end (delta: -343.2 MB). Peak memory consumption was 127.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:52,952 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-26 18:42:52,952 INFO ]: ChcToBoogie took 63.44 ms. Allocated memory is still 309.3 MB. Free memory was 263.5 MB in the beginning and 261.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:52,955 INFO ]: Boogie Preprocessor took 39.64 ms. Allocated memory is still 309.3 MB. Free memory was 261.5 MB in the beginning and 259.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:52,955 INFO ]: RCFGBuilder took 334.78 ms. Allocated memory is still 309.3 MB. Free memory was 259.5 MB in the beginning and 247.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:52,955 INFO ]: BlockEncodingV2 took 66.89 ms. Allocated memory is still 309.3 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:52,956 INFO ]: TraceAbstraction took 55455.03 ms. Allocated memory was 309.3 MB in the beginning and 780.1 MB in the end (delta: 470.8 MB). Free memory was 245.5 MB in the beginning and 606.7 MB in the end (delta: -361.2 MB). Peak memory consumption was 109.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:52,958 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 20 edges - StatisticsResult: Encoded RCFG 8 locations, 16 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 63.44 ms. Allocated memory is still 309.3 MB. Free memory was 263.5 MB in the beginning and 261.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.64 ms. Allocated memory is still 309.3 MB. Free memory was 261.5 MB in the beginning and 259.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 334.78 ms. Allocated memory is still 309.3 MB. Free memory was 259.5 MB in the beginning and 247.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 66.89 ms. Allocated memory is still 309.3 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55455.03 ms. Allocated memory was 309.3 MB in the beginning and 780.1 MB in the end (delta: 470.8 MB). Free memory was 245.5 MB in the beginning and 606.7 MB in the end (delta: -361.2 MB). Peak memory consumption was 109.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 9, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 55.3s OverallTime, 54 OverallIterations, 9 TraceHistogramMax, 26.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 1957 SDslu, 3764 SDs, 0 SdLazy, 11728 SolverSat, 6434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2482 GetRequests, 823 SyntacticMatches, 83 SemanticMatches, 1576 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 34.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=41, 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, 53 MinimizatonAttempts, 2956 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 1909 ConstructedInterpolants, 5 QuantifiedInterpolants, 212109 SizeOfPredicates, 201 NumberOfNonLiveVariables, 17917 ConjunctsInSsa, 3058 ConjunctsInUnsatCore, 98 InterpolantComputations, 10 PerfectInterpolantSequences, 2845/4751 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-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-42-52-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-42-52-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-42-52-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-42-52-971.csv Completed graceful shutdown