java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:40:01,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:40:01,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:40:01,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:40:01,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:40:01,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:40:01,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:40:01,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:40:01,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:40:01,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:40:01,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:40:01,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:40:01,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:40:01,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:40:01,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:40:01,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:40:01,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:40:01,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:40:01,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:40:01,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:40:01,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:40:01,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:40:01,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:40:01,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:40:01,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:40:01,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:40:01,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:40:01,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:40:01,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:40:01,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:40:01,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:40:01,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:40:01,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:40:01,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:40:01,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:40:01,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:40:01,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:40:01,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:40:01,446 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:40:01,446 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:40:01,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:40:01,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:40:01,448 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:40:01,448 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:40:01,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:40:01,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:40:01,449 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:40:01,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:40:01,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:40:01,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:40:01,449 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:40:01,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:40:01,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:40:01,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:40:01,450 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:40:01,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:40:01,450 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:40:01,452 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:40:01,452 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:40:01,498 INFO ]: Repository-Root is: /tmp [2018-06-24 20:40:01,515 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:40:01,521 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:40:01,523 INFO ]: Initializing SmtParser... [2018-06-24 20:40:01,523 INFO ]: SmtParser initialized [2018-06-24 20:40:01,523 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 [2018-06-24 20:40:01,525 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:40:01,609 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 unknown [2018-06-24 20:40:02,094 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 [2018-06-24 20:40:02,098 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:40:02,105 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:40:02,105 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:40:02,105 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:40:02,106 INFO ]: ChcToBoogie initialized [2018-06-24 20:40:02,109 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,165 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02 Unit [2018-06-24 20:40:02,165 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:40:02,165 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:40:02,165 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:40:02,165 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:40:02,185 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,186 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,194 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,194 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,207 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,209 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,220 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,223 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:40:02,224 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:40:02,224 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:40:02,224 INFO ]: RCFGBuilder initialized [2018-06-24 20:40:02,225 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:40:02,242 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:40:02,242 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:40:02,242 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:40:02,242 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:40:02,242 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:40:02,242 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:40:02,802 INFO ]: Using library mode [2018-06-24 20:40:02,802 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:40:02 BoogieIcfgContainer [2018-06-24 20:40:02,802 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:40:02,803 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:40:02,803 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:40:02,803 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:40:02,806 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:40:02" (1/1) ... [2018-06-24 20:40:02,821 INFO ]: Initial Icfg 31 locations, 35 edges [2018-06-24 20:40:02,823 INFO ]: Using Remove infeasible edges [2018-06-24 20:40:02,824 INFO ]: Using Maximize final states [2018-06-24 20:40:02,824 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:40:02,824 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:40:02,828 INFO ]: Using Remove sink states [2018-06-24 20:40:02,829 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:40:02,829 INFO ]: Using Use SBE [2018-06-24 20:40:02,837 INFO ]: SBE split 0 edges [2018-06-24 20:40:02,842 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:40:02,843 INFO ]: 0 new accepting states [2018-06-24 20:40:03,774 INFO ]: Removed 71 edges and 23 locations by large block encoding [2018-06-24 20:40:03,776 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:40:03,777 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:40:03,777 INFO ]: 0 new accepting states [2018-06-24 20:40:03,777 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:40:03,778 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:40:03,778 INFO ]: Encoded RCFG 6 locations, 11 edges [2018-06-24 20:40:03,778 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:40:03 BasicIcfg [2018-06-24 20:40:03,778 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:40:03,780 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:40:03,780 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:40:03,784 INFO ]: TraceAbstraction initialized [2018-06-24 20:40:03,784 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:40:02" (1/4) ... [2018-06-24 20:40:03,785 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fae2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:40:03, skipping insertion in model container [2018-06-24 20:40:03,785 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:40:02" (2/4) ... [2018-06-24 20:40:03,785 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fae2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:40:03, skipping insertion in model container [2018-06-24 20:40:03,785 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:40:02" (3/4) ... [2018-06-24 20:40:03,786 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fae2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:40:03, skipping insertion in model container [2018-06-24 20:40:03,786 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:40:03" (4/4) ... [2018-06-24 20:40:03,791 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:40:03,804 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:40:03,821 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:40:03,868 INFO ]: Using default assertion order modulation [2018-06-24 20:40:03,868 INFO ]: Interprodecural is true [2018-06-24 20:40:03,868 INFO ]: Hoare is false [2018-06-24 20:40:03,868 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:40:03,868 INFO ]: Backedges is TWOTRACK [2018-06-24 20:40:03,868 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:40:03,868 INFO ]: Difference is false [2018-06-24 20:40:03,868 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:40:03,868 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:40:03,876 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:40:03,886 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:40:03,886 INFO ]: Found error trace [2018-06-24 20:40:03,887 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:40:03,887 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:03,894 INFO ]: Analyzing trace with hash 36187540, now seen corresponding path program 1 times [2018-06-24 20:40:03,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:03,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:03,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:03,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:03,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:04,010 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:04,183 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:04,185 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:04,185 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:04,187 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:04,203 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:04,203 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:04,205 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:40:04,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:04,389 INFO ]: Finished difference Result 7 states and 14 transitions. [2018-06-24 20:40:04,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:04,390 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:40:04,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:04,399 INFO ]: With dead ends: 7 [2018-06-24 20:40:04,399 INFO ]: Without dead ends: 7 [2018-06-24 20:40:04,401 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:04,417 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:40:04,434 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:40:04,435 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:40:04,436 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2018-06-24 20:40:04,437 INFO ]: Start accepts. Automaton has 7 states and 14 transitions. Word has length 5 [2018-06-24 20:40:04,438 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:04,438 INFO ]: Abstraction has 7 states and 14 transitions. [2018-06-24 20:40:04,438 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:04,438 INFO ]: Start isEmpty. Operand 7 states and 14 transitions. [2018-06-24 20:40:04,438 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:40:04,438 INFO ]: Found error trace [2018-06-24 20:40:04,438 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:40:04,438 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:04,439 INFO ]: Analyzing trace with hash 36217331, now seen corresponding path program 1 times [2018-06-24 20:40:04,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:04,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:04,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:04,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:04,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:04,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:04,542 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:04,542 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:04,542 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:04,543 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:04,543 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:04,543 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:04,544 INFO ]: Start difference. First operand 7 states and 14 transitions. Second operand 3 states. [2018-06-24 20:40:04,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:04,683 INFO ]: Finished difference Result 9 states and 20 transitions. [2018-06-24 20:40:04,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:04,683 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:40:04,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:04,684 INFO ]: With dead ends: 9 [2018-06-24 20:40:04,684 INFO ]: Without dead ends: 9 [2018-06-24 20:40:04,684 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:04,684 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:40:04,686 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 20:40:04,686 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:40:04,686 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-24 20:40:04,686 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 5 [2018-06-24 20:40:04,686 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:04,686 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-24 20:40:04,686 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:04,686 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-24 20:40:04,686 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:40:04,686 INFO ]: Found error trace [2018-06-24 20:40:04,686 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:40:04,686 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:04,688 INFO ]: Analyzing trace with hash 1121711998, now seen corresponding path program 1 times [2018-06-24 20:40:04,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:04,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:04,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:04,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:04,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:04,742 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:04,832 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:04,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:40:04,832 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:40:04,832 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:40:04,832 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:40:04,832 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:04,832 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 3 states. [2018-06-24 20:40:04,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:04,986 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-24 20:40:04,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:40:04,987 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:40:04,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:04,989 INFO ]: With dead ends: 12 [2018-06-24 20:40:04,989 INFO ]: Without dead ends: 12 [2018-06-24 20:40:04,989 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:40:04,989 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:40:04,995 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:40:04,995 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:40:04,995 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-24 20:40:04,995 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 6 [2018-06-24 20:40:04,995 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:04,995 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-24 20:40:04,995 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:40:04,996 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-24 20:40:04,996 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:40:04,996 INFO ]: Found error trace [2018-06-24 20:40:04,996 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:40:04,996 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:04,996 INFO ]: Analyzing trace with hash 1121741789, now seen corresponding path program 1 times [2018-06-24 20:40:04,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:04,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:04,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:04,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:04,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:05,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:05,088 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:05,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:05,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:05,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:05,202 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:05,214 INFO ]: Computing forward predicates... [2018-06-24 20:40:05,248 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:05,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:05,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:40:05,282 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:40:05,282 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:40:05,282 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:40:05,283 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 4 states. [2018-06-24 20:40:05,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:05,531 INFO ]: Finished difference Result 13 states and 25 transitions. [2018-06-24 20:40:05,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:40:05,532 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:40:05,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:05,533 INFO ]: With dead ends: 13 [2018-06-24 20:40:05,533 INFO ]: Without dead ends: 13 [2018-06-24 20:40:05,533 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:40:05,533 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:40:05,535 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 20:40:05,535 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:40:05,535 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-06-24 20:40:05,535 INFO ]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 6 [2018-06-24 20:40:05,535 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:05,535 INFO ]: Abstraction has 12 states and 24 transitions. [2018-06-24 20:40:05,535 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:40:05,535 INFO ]: Start isEmpty. Operand 12 states and 24 transitions. [2018-06-24 20:40:05,536 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:40:05,536 INFO ]: Found error trace [2018-06-24 20:40:05,536 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:40:05,536 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:05,536 INFO ]: Analyzing trace with hash 1122665310, now seen corresponding path program 1 times [2018-06-24 20:40:05,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:05,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:05,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:05,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:05,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:05,554 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:05,709 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:05,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:05,709 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:05,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:05,845 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:05,849 INFO ]: Computing forward predicates... [2018-06-24 20:40:05,868 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:05,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:05,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:40:05,903 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:40:05,903 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:40:05,904 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:40:05,904 INFO ]: Start difference. First operand 12 states and 24 transitions. Second operand 4 states. [2018-06-24 20:40:05,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:05,992 INFO ]: Finished difference Result 19 states and 39 transitions. [2018-06-24 20:40:05,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:40:05,993 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:40:05,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:05,994 INFO ]: With dead ends: 19 [2018-06-24 20:40:05,994 INFO ]: Without dead ends: 19 [2018-06-24 20:40:05,994 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:40:05,994 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:40:05,996 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-24 20:40:05,997 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:40:05,997 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-06-24 20:40:05,997 INFO ]: Start accepts. Automaton has 13 states and 27 transitions. Word has length 6 [2018-06-24 20:40:05,997 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:05,997 INFO ]: Abstraction has 13 states and 27 transitions. [2018-06-24 20:40:05,997 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:40:05,997 INFO ]: Start isEmpty. Operand 13 states and 27 transitions. [2018-06-24 20:40:06,000 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:40:06,000 INFO ]: Found error trace [2018-06-24 20:40:06,000 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:40:06,000 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:06,000 INFO ]: Analyzing trace with hash 414185140, now seen corresponding path program 2 times [2018-06-24 20:40:06,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:06,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:06,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:06,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:06,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:06,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:06,171 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:06,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:06,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:06,177 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:06,292 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:06,292 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:06,297 INFO ]: Computing forward predicates... [2018-06-24 20:40:06,311 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:06,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:06,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:40:06,347 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:40:06,347 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:40:06,347 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:40:06,347 INFO ]: Start difference. First operand 13 states and 27 transitions. Second operand 5 states. [2018-06-24 20:40:06,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:06,422 INFO ]: Finished difference Result 17 states and 33 transitions. [2018-06-24 20:40:06,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:40:06,424 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:40:06,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:06,424 INFO ]: With dead ends: 17 [2018-06-24 20:40:06,425 INFO ]: Without dead ends: 17 [2018-06-24 20:40:06,425 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:40:06,425 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:40:06,427 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 20:40:06,427 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:40:06,428 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2018-06-24 20:40:06,428 INFO ]: Start accepts. Automaton has 15 states and 31 transitions. Word has length 7 [2018-06-24 20:40:06,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:06,428 INFO ]: Abstraction has 15 states and 31 transitions. [2018-06-24 20:40:06,428 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:40:06,428 INFO ]: Start isEmpty. Operand 15 states and 31 transitions. [2018-06-24 20:40:06,428 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:40:06,428 INFO ]: Found error trace [2018-06-24 20:40:06,428 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:40:06,428 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:06,429 INFO ]: Analyzing trace with hash 442814291, now seen corresponding path program 2 times [2018-06-24 20:40:06,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:06,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:06,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:06,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:06,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:06,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:06,515 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:06,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:06,515 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:06,523 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:06,628 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:06,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:06,632 INFO ]: Computing forward predicates... [2018-06-24 20:40:06,650 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:06,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:06,684 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:40:06,684 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:40:06,684 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:40:06,684 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:40:06,684 INFO ]: Start difference. First operand 15 states and 31 transitions. Second operand 5 states. [2018-06-24 20:40:06,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:06,840 INFO ]: Finished difference Result 28 states and 58 transitions. [2018-06-24 20:40:06,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:40:06,841 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:40:06,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:06,842 INFO ]: With dead ends: 28 [2018-06-24 20:40:06,842 INFO ]: Without dead ends: 28 [2018-06-24 20:40:06,842 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:40:06,842 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:40:06,845 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-06-24 20:40:06,845 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:40:06,845 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2018-06-24 20:40:06,845 INFO ]: Start accepts. Automaton has 16 states and 34 transitions. Word has length 7 [2018-06-24 20:40:06,846 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:06,846 INFO ]: Abstraction has 16 states and 34 transitions. [2018-06-24 20:40:06,846 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:40:06,846 INFO ]: Start isEmpty. Operand 16 states and 34 transitions. [2018-06-24 20:40:06,846 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:40:06,846 INFO ]: Found error trace [2018-06-24 20:40:06,846 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 20:40:06,846 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:06,846 INFO ]: Analyzing trace with hash -45234499, now seen corresponding path program 3 times [2018-06-24 20:40:06,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:06,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:06,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:06,847 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:06,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:06,866 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:06,968 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:06,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:06,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:06,974 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:07,071 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:40:07,071 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:07,076 INFO ]: Computing forward predicates... [2018-06-24 20:40:07,092 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:07,118 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:07,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:40:07,118 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:40:07,119 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:40:07,119 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:40:07,119 INFO ]: Start difference. First operand 16 states and 34 transitions. Second operand 6 states. [2018-06-24 20:40:07,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:07,232 INFO ]: Finished difference Result 21 states and 41 transitions. [2018-06-24 20:40:07,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:40:07,232 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:40:07,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:07,233 INFO ]: With dead ends: 21 [2018-06-24 20:40:07,233 INFO ]: Without dead ends: 21 [2018-06-24 20:40:07,233 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:40:07,233 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:40:07,235 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-24 20:40:07,235 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:40:07,235 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-06-24 20:40:07,235 INFO ]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 8 [2018-06-24 20:40:07,235 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:07,235 INFO ]: Abstraction has 18 states and 38 transitions. [2018-06-24 20:40:07,235 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:40:07,235 INFO ]: Start isEmpty. Operand 18 states and 38 transitions. [2018-06-24 20:40:07,235 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:40:07,235 INFO ]: Found error trace [2018-06-24 20:40:07,235 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 20:40:07,235 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:07,236 INFO ]: Analyzing trace with hash 842269182, now seen corresponding path program 3 times [2018-06-24 20:40:07,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:07,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:07,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:07,236 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:07,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:07,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:07,382 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:07,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:07,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:07,389 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:07,509 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:40:07,509 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:07,513 INFO ]: Computing forward predicates... [2018-06-24 20:40:07,526 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:07,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:07,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:40:07,552 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:40:07,552 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:40:07,552 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:40:07,552 INFO ]: Start difference. First operand 18 states and 38 transitions. Second operand 6 states. [2018-06-24 20:40:07,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:07,590 INFO ]: Finished difference Result 39 states and 81 transitions. [2018-06-24 20:40:07,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:40:07,591 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:40:07,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:07,592 INFO ]: With dead ends: 39 [2018-06-24 20:40:07,592 INFO ]: Without dead ends: 39 [2018-06-24 20:40:07,592 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:40:07,592 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:40:07,595 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 19. [2018-06-24 20:40:07,595 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:40:07,596 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 41 transitions. [2018-06-24 20:40:07,596 INFO ]: Start accepts. Automaton has 19 states and 41 transitions. Word has length 8 [2018-06-24 20:40:07,596 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:07,596 INFO ]: Abstraction has 19 states and 41 transitions. [2018-06-24 20:40:07,596 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:40:07,596 INFO ]: Start isEmpty. Operand 19 states and 41 transitions. [2018-06-24 20:40:07,596 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:40:07,596 INFO ]: Found error trace [2018-06-24 20:40:07,596 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:40:07,596 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:07,597 INFO ]: Analyzing trace with hash -1402341420, now seen corresponding path program 4 times [2018-06-24 20:40:07,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:07,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:07,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:07,597 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:07,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:07,618 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:07,687 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:07,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:07,687 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:07,694 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:07,816 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:07,816 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:07,821 INFO ]: Computing forward predicates... [2018-06-24 20:40:07,840 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:07,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:07,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:40:07,872 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:40:07,873 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:40:07,873 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:40:07,873 INFO ]: Start difference. First operand 19 states and 41 transitions. Second operand 7 states. [2018-06-24 20:40:08,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:08,031 INFO ]: Finished difference Result 25 states and 49 transitions. [2018-06-24 20:40:08,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:40:08,032 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:40:08,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:08,032 INFO ]: With dead ends: 25 [2018-06-24 20:40:08,032 INFO ]: Without dead ends: 25 [2018-06-24 20:40:08,033 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:40:08,033 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:40:08,035 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-24 20:40:08,035 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:40:08,036 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 45 transitions. [2018-06-24 20:40:08,036 INFO ]: Start accepts. Automaton has 21 states and 45 transitions. Word has length 9 [2018-06-24 20:40:08,036 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:08,036 INFO ]: Abstraction has 21 states and 45 transitions. [2018-06-24 20:40:08,036 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:40:08,036 INFO ]: Start isEmpty. Operand 21 states and 45 transitions. [2018-06-24 20:40:08,036 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:40:08,036 INFO ]: Found error trace [2018-06-24 20:40:08,036 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:40:08,036 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:08,036 INFO ]: Analyzing trace with hash 340468915, now seen corresponding path program 4 times [2018-06-24 20:40:08,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:08,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:08,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:08,037 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:08,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:08,059 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:08,618 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:08,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:08,619 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:40:08,636 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:08,755 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:08,755 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:08,760 INFO ]: Computing forward predicates... [2018-06-24 20:40:08,786 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:08,819 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:08,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:40:08,820 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:40:08,820 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:40:08,820 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:40:08,821 INFO ]: Start difference. First operand 21 states and 45 transitions. Second operand 7 states. [2018-06-24 20:40:08,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:08,931 INFO ]: Finished difference Result 52 states and 108 transitions. [2018-06-24 20:40:08,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:40:08,931 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:40:08,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:08,932 INFO ]: With dead ends: 52 [2018-06-24 20:40:08,932 INFO ]: Without dead ends: 52 [2018-06-24 20:40:08,932 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:40:08,932 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:40:08,936 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 22. [2018-06-24 20:40:08,936 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:40:08,936 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-06-24 20:40:08,936 INFO ]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 9 [2018-06-24 20:40:08,936 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:08,936 INFO ]: Abstraction has 22 states and 48 transitions. [2018-06-24 20:40:08,936 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:40:08,936 INFO ]: Start isEmpty. Operand 22 states and 48 transitions. [2018-06-24 20:40:08,937 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:40:08,937 INFO ]: Found error trace [2018-06-24 20:40:08,937 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:40:08,937 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:08,937 INFO ]: Analyzing trace with hash -522983011, now seen corresponding path program 5 times [2018-06-24 20:40:08,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:08,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:08,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:08,938 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:08,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:08,965 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:09,120 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:09,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:09,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:09,126 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:09,283 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:40:09,283 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:09,291 INFO ]: Computing forward predicates... [2018-06-24 20:40:09,326 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:09,361 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:09,361 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:40:09,362 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:40:09,362 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:40:09,362 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:40:09,362 INFO ]: Start difference. First operand 22 states and 48 transitions. Second operand 8 states. [2018-06-24 20:40:09,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:09,537 INFO ]: Finished difference Result 29 states and 57 transitions. [2018-06-24 20:40:09,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:40:09,538 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:40:09,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:09,538 INFO ]: With dead ends: 29 [2018-06-24 20:40:09,538 INFO ]: Without dead ends: 29 [2018-06-24 20:40:09,539 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:40:09,539 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:40:09,541 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-06-24 20:40:09,541 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:40:09,542 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2018-06-24 20:40:09,542 INFO ]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 10 [2018-06-24 20:40:09,542 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:09,542 INFO ]: Abstraction has 24 states and 52 transitions. [2018-06-24 20:40:09,542 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:40:09,542 INFO ]: Start isEmpty. Operand 24 states and 52 transitions. [2018-06-24 20:40:09,542 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:40:09,542 INFO ]: Found error trace [2018-06-24 20:40:09,542 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:40:09,543 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:09,543 INFO ]: Analyzing trace with hash 1964529822, now seen corresponding path program 5 times [2018-06-24 20:40:09,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:09,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:09,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:09,543 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:09,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:09,587 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:09,745 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:09,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:09,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:09,751 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:09,911 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:40:09,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:09,917 INFO ]: Computing forward predicates... [2018-06-24 20:40:09,932 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:09,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:09,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:40:09,956 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:40:09,956 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:40:09,956 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:40:09,956 INFO ]: Start difference. First operand 24 states and 52 transitions. Second operand 8 states. [2018-06-24 20:40:10,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:10,045 INFO ]: Finished difference Result 67 states and 139 transitions. [2018-06-24 20:40:10,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:40:10,045 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:40:10,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:10,047 INFO ]: With dead ends: 67 [2018-06-24 20:40:10,047 INFO ]: Without dead ends: 67 [2018-06-24 20:40:10,047 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:40:10,047 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:40:10,050 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 25. [2018-06-24 20:40:10,050 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:40:10,051 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 55 transitions. [2018-06-24 20:40:10,051 INFO ]: Start accepts. Automaton has 25 states and 55 transitions. Word has length 10 [2018-06-24 20:40:10,051 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:10,051 INFO ]: Abstraction has 25 states and 55 transitions. [2018-06-24 20:40:10,051 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:40:10,051 INFO ]: Start isEmpty. Operand 25 states and 55 transitions. [2018-06-24 20:40:10,052 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:40:10,052 INFO ]: Found error trace [2018-06-24 20:40:10,052 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:40:10,052 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:10,052 INFO ]: Analyzing trace with hash 967323892, now seen corresponding path program 6 times [2018-06-24 20:40:10,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:10,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:10,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:10,053 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:10,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:10,076 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:10,170 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:10,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:10,170 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:10,176 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:10,352 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:40:10,352 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:10,358 INFO ]: Computing forward predicates... [2018-06-24 20:40:10,376 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:10,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:10,409 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:40:10,409 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:40:10,409 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:40:10,409 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:40:10,409 INFO ]: Start difference. First operand 25 states and 55 transitions. Second operand 9 states. [2018-06-24 20:40:10,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:10,677 INFO ]: Finished difference Result 33 states and 65 transitions. [2018-06-24 20:40:10,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:40:10,677 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:40:10,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:10,678 INFO ]: With dead ends: 33 [2018-06-24 20:40:10,678 INFO ]: Without dead ends: 33 [2018-06-24 20:40:10,678 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:40:10,678 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:40:10,680 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-24 20:40:10,680 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:40:10,681 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 59 transitions. [2018-06-24 20:40:10,681 INFO ]: Start accepts. Automaton has 27 states and 59 transitions. Word has length 11 [2018-06-24 20:40:10,681 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:10,681 INFO ]: Abstraction has 27 states and 59 transitions. [2018-06-24 20:40:10,681 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:40:10,681 INFO ]: Start isEmpty. Operand 27 states and 59 transitions. [2018-06-24 20:40:10,682 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:40:10,685 INFO ]: Found error trace [2018-06-24 20:40:10,685 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:40:10,685 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:10,685 INFO ]: Analyzing trace with hash 770810387, now seen corresponding path program 6 times [2018-06-24 20:40:10,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:10,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:10,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:10,686 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:10,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:10,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:11,022 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:11,022 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:11,022 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:11,027 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:11,157 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:40:11,157 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:11,162 INFO ]: Computing forward predicates... [2018-06-24 20:40:11,178 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:11,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:11,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:40:11,202 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:40:11,202 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:40:11,202 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:40:11,203 INFO ]: Start difference. First operand 27 states and 59 transitions. Second operand 9 states. [2018-06-24 20:40:11,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:11,260 INFO ]: Finished difference Result 84 states and 174 transitions. [2018-06-24 20:40:11,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:40:11,261 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:40:11,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:11,261 INFO ]: With dead ends: 84 [2018-06-24 20:40:11,261 INFO ]: Without dead ends: 84 [2018-06-24 20:40:11,262 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:40:11,262 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 20:40:11,265 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 28. [2018-06-24 20:40:11,265 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:40:11,266 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 62 transitions. [2018-06-24 20:40:11,266 INFO ]: Start accepts. Automaton has 28 states and 62 transitions. Word has length 11 [2018-06-24 20:40:11,266 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:11,266 INFO ]: Abstraction has 28 states and 62 transitions. [2018-06-24 20:40:11,266 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:40:11,266 INFO ]: Start isEmpty. Operand 28 states and 62 transitions. [2018-06-24 20:40:11,267 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:40:11,267 INFO ]: Found error trace [2018-06-24 20:40:11,267 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:40:11,267 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:11,267 INFO ]: Analyzing trace with hash -77802371, now seen corresponding path program 7 times [2018-06-24 20:40:11,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:11,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:11,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:11,267 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:11,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:11,293 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:11,571 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:11,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:11,571 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:11,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:11,693 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:11,700 INFO ]: Computing forward predicates... [2018-06-24 20:40:11,730 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:11,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:11,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:40:11,764 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:40:11,764 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:40:11,764 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:40:11,764 INFO ]: Start difference. First operand 28 states and 62 transitions. Second operand 10 states. [2018-06-24 20:40:11,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:11,889 INFO ]: Finished difference Result 37 states and 73 transitions. [2018-06-24 20:40:11,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:40:11,890 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:40:11,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:11,890 INFO ]: With dead ends: 37 [2018-06-24 20:40:11,890 INFO ]: Without dead ends: 37 [2018-06-24 20:40:11,890 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:40:11,890 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:40:11,892 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-06-24 20:40:11,893 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:40:11,893 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2018-06-24 20:40:11,893 INFO ]: Start accepts. Automaton has 30 states and 66 transitions. Word has length 12 [2018-06-24 20:40:11,893 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:11,893 INFO ]: Abstraction has 30 states and 66 transitions. [2018-06-24 20:40:11,893 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:40:11,893 INFO ]: Start isEmpty. Operand 30 states and 66 transitions. [2018-06-24 20:40:11,894 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:40:11,894 INFO ]: Found error trace [2018-06-24 20:40:11,894 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:40:11,894 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:11,894 INFO ]: Analyzing trace with hash -1874753730, now seen corresponding path program 7 times [2018-06-24 20:40:11,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:11,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:11,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:11,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:11,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:11,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:12,270 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:12,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:12,270 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:12,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:12,401 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:12,406 INFO ]: Computing forward predicates... [2018-06-24 20:40:12,425 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:12,451 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:12,451 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:40:12,451 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:40:12,451 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:40:12,451 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:40:12,452 INFO ]: Start difference. First operand 30 states and 66 transitions. Second operand 10 states. [2018-06-24 20:40:12,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:12,560 INFO ]: Finished difference Result 103 states and 213 transitions. [2018-06-24 20:40:12,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:40:12,561 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:40:12,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:12,562 INFO ]: With dead ends: 103 [2018-06-24 20:40:12,562 INFO ]: Without dead ends: 103 [2018-06-24 20:40:12,562 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:40:12,563 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 20:40:12,566 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 31. [2018-06-24 20:40:12,566 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:40:12,567 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 69 transitions. [2018-06-24 20:40:12,567 INFO ]: Start accepts. Automaton has 31 states and 69 transitions. Word has length 12 [2018-06-24 20:40:12,567 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:12,567 INFO ]: Abstraction has 31 states and 69 transitions. [2018-06-24 20:40:12,567 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:40:12,567 INFO ]: Start isEmpty. Operand 31 states and 69 transitions. [2018-06-24 20:40:12,568 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:40:12,568 INFO ]: Found error trace [2018-06-24 20:40:12,568 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 20:40:12,568 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:12,568 INFO ]: Analyzing trace with hash 1883021844, now seen corresponding path program 8 times [2018-06-24 20:40:12,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:12,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:12,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:12,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:12,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:12,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:12,738 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:12,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:12,738 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:12,744 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:12,911 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:12,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:12,916 INFO ]: Computing forward predicates... [2018-06-24 20:40:12,939 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:12,972 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:12,972 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:40:12,973 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:40:12,973 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:40:12,973 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:40:12,973 INFO ]: Start difference. First operand 31 states and 69 transitions. Second operand 11 states. [2018-06-24 20:40:13,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:13,348 INFO ]: Finished difference Result 41 states and 81 transitions. [2018-06-24 20:40:13,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:40:13,348 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:40:13,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:13,349 INFO ]: With dead ends: 41 [2018-06-24 20:40:13,349 INFO ]: Without dead ends: 41 [2018-06-24 20:40:13,349 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:40:13,349 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:40:13,351 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-24 20:40:13,351 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:40:13,352 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 73 transitions. [2018-06-24 20:40:13,352 INFO ]: Start accepts. Automaton has 33 states and 73 transitions. Word has length 13 [2018-06-24 20:40:13,352 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:13,352 INFO ]: Abstraction has 33 states and 73 transitions. [2018-06-24 20:40:13,352 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:40:13,352 INFO ]: Start isEmpty. Operand 33 states and 73 transitions. [2018-06-24 20:40:13,353 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:40:13,353 INFO ]: Found error trace [2018-06-24 20:40:13,353 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 20:40:13,353 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:13,353 INFO ]: Analyzing trace with hash 2012104563, now seen corresponding path program 8 times [2018-06-24 20:40:13,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:13,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:13,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:13,354 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:13,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:13,380 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:13,537 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:13,537 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:13,537 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:40:13,551 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:13,699 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:13,699 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:13,705 INFO ]: Computing forward predicates... [2018-06-24 20:40:13,724 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:13,757 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:13,757 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:40:13,757 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:40:13,757 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:40:13,757 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:40:13,757 INFO ]: Start difference. First operand 33 states and 73 transitions. Second operand 11 states. [2018-06-24 20:40:14,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:14,026 INFO ]: Finished difference Result 124 states and 256 transitions. [2018-06-24 20:40:14,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:40:14,027 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:40:14,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:14,027 INFO ]: With dead ends: 124 [2018-06-24 20:40:14,028 INFO ]: Without dead ends: 124 [2018-06-24 20:40:14,028 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:40:14,028 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-24 20:40:14,031 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 34. [2018-06-24 20:40:14,031 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:40:14,031 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 76 transitions. [2018-06-24 20:40:14,031 INFO ]: Start accepts. Automaton has 34 states and 76 transitions. Word has length 13 [2018-06-24 20:40:14,032 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:14,032 INFO ]: Abstraction has 34 states and 76 transitions. [2018-06-24 20:40:14,032 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:40:14,032 INFO ]: Start isEmpty. Operand 34 states and 76 transitions. [2018-06-24 20:40:14,032 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:40:14,032 INFO ]: Found error trace [2018-06-24 20:40:14,032 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 20:40:14,032 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:14,032 INFO ]: Analyzing trace with hash -1755936931, now seen corresponding path program 9 times [2018-06-24 20:40:14,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:14,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:14,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:14,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:14,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:14,057 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:14,766 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:14,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:14,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:14,772 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:14,935 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:40:14,935 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:14,945 INFO ]: Computing forward predicates... [2018-06-24 20:40:14,967 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:15,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:15,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:40:15,001 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:40:15,001 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:40:15,001 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:40:15,001 INFO ]: Start difference. First operand 34 states and 76 transitions. Second operand 12 states. [2018-06-24 20:40:15,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:15,113 INFO ]: Finished difference Result 45 states and 89 transitions. [2018-06-24 20:40:15,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:40:15,113 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:40:15,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:15,114 INFO ]: With dead ends: 45 [2018-06-24 20:40:15,114 INFO ]: Without dead ends: 45 [2018-06-24 20:40:15,114 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:40:15,114 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:40:15,116 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-06-24 20:40:15,116 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:40:15,117 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2018-06-24 20:40:15,117 INFO ]: Start accepts. Automaton has 36 states and 80 transitions. Word has length 14 [2018-06-24 20:40:15,117 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:15,117 INFO ]: Abstraction has 36 states and 80 transitions. [2018-06-24 20:40:15,117 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:40:15,117 INFO ]: Start isEmpty. Operand 36 states and 80 transitions. [2018-06-24 20:40:15,117 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:40:15,117 INFO ]: Found error trace [2018-06-24 20:40:15,117 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 20:40:15,117 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:15,118 INFO ]: Analyzing trace with hash -2049339938, now seen corresponding path program 9 times [2018-06-24 20:40:15,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:15,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:15,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:15,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:15,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:15,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:16,145 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:16,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:16,145 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:16,151 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:16,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:40:16,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:16,327 INFO ]: Computing forward predicates... [2018-06-24 20:40:16,347 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:16,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:16,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:40:16,381 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:40:16,382 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:40:16,382 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:40:16,382 INFO ]: Start difference. First operand 36 states and 80 transitions. Second operand 12 states. [2018-06-24 20:40:17,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:17,254 INFO ]: Finished difference Result 147 states and 303 transitions. [2018-06-24 20:40:17,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:40:17,255 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:40:17,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:17,256 INFO ]: With dead ends: 147 [2018-06-24 20:40:17,256 INFO ]: Without dead ends: 147 [2018-06-24 20:40:17,256 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:40:17,256 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-24 20:40:17,258 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 37. [2018-06-24 20:40:17,258 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:40:17,258 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 83 transitions. [2018-06-24 20:40:17,258 INFO ]: Start accepts. Automaton has 37 states and 83 transitions. Word has length 14 [2018-06-24 20:40:17,258 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:17,258 INFO ]: Abstraction has 37 states and 83 transitions. [2018-06-24 20:40:17,258 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:40:17,258 INFO ]: Start isEmpty. Operand 37 states and 83 transitions. [2018-06-24 20:40:17,390 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:40:17,390 INFO ]: Found error trace [2018-06-24 20:40:17,390 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 20:40:17,390 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:17,390 INFO ]: Analyzing trace with hash 1400458036, now seen corresponding path program 10 times [2018-06-24 20:40:17,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:17,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:17,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:17,391 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:17,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:17,418 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:18,549 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:18,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:18,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:18,562 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:18,720 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:18,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:18,726 INFO ]: Computing forward predicates... [2018-06-24 20:40:18,755 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:18,790 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:18,790 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:40:18,791 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:40:18,791 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:40:18,791 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:40:18,791 INFO ]: Start difference. First operand 37 states and 83 transitions. Second operand 13 states. [2018-06-24 20:40:18,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:18,980 INFO ]: Finished difference Result 49 states and 97 transitions. [2018-06-24 20:40:18,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:40:18,982 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:40:18,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:18,983 INFO ]: With dead ends: 49 [2018-06-24 20:40:18,983 INFO ]: Without dead ends: 49 [2018-06-24 20:40:18,983 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:40:18,983 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:40:18,985 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-06-24 20:40:18,985 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:40:18,986 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 87 transitions. [2018-06-24 20:40:18,986 INFO ]: Start accepts. Automaton has 39 states and 87 transitions. Word has length 15 [2018-06-24 20:40:18,986 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:18,986 INFO ]: Abstraction has 39 states and 87 transitions. [2018-06-24 20:40:18,986 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:40:18,986 INFO ]: Start isEmpty. Operand 39 states and 87 transitions. [2018-06-24 20:40:18,989 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:40:18,989 INFO ]: Found error trace [2018-06-24 20:40:18,989 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 20:40:18,989 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:18,989 INFO ]: Analyzing trace with hash 894899411, now seen corresponding path program 10 times [2018-06-24 20:40:18,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:18,989 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:18,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:18,990 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:18,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:19,017 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:19,575 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:19,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:19,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:19,590 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:19,767 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:19,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:19,774 INFO ]: Computing forward predicates... [2018-06-24 20:40:19,794 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:19,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:19,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:40:19,829 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:40:19,829 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:40:19,829 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:40:19,829 INFO ]: Start difference. First operand 39 states and 87 transitions. Second operand 13 states. [2018-06-24 20:40:20,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:20,154 INFO ]: Finished difference Result 172 states and 354 transitions. [2018-06-24 20:40:20,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:40:20,154 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:40:20,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:20,155 INFO ]: With dead ends: 172 [2018-06-24 20:40:20,155 INFO ]: Without dead ends: 172 [2018-06-24 20:40:20,155 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:40:20,155 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-24 20:40:20,158 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 40. [2018-06-24 20:40:20,159 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:40:20,159 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2018-06-24 20:40:20,159 INFO ]: Start accepts. Automaton has 40 states and 90 transitions. Word has length 15 [2018-06-24 20:40:20,159 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:20,159 INFO ]: Abstraction has 40 states and 90 transitions. [2018-06-24 20:40:20,159 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:40:20,159 INFO ]: Start isEmpty. Operand 40 states and 90 transitions. [2018-06-24 20:40:20,160 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:40:20,160 INFO ]: Found error trace [2018-06-24 20:40:20,160 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 20:40:20,160 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:20,160 INFO ]: Analyzing trace with hash 464454205, now seen corresponding path program 11 times [2018-06-24 20:40:20,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:20,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:20,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:20,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:20,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:20,181 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:20,317 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:20,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:20,317 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:20,323 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:20,547 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:40:20,547 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:20,556 INFO ]: Computing forward predicates... [2018-06-24 20:40:20,579 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:20,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:20,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:40:20,613 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:40:20,614 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:40:20,614 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:40:20,614 INFO ]: Start difference. First operand 40 states and 90 transitions. Second operand 14 states. [2018-06-24 20:40:20,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:20,738 INFO ]: Finished difference Result 53 states and 105 transitions. [2018-06-24 20:40:20,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:40:20,738 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:40:20,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:20,739 INFO ]: With dead ends: 53 [2018-06-24 20:40:20,739 INFO ]: Without dead ends: 53 [2018-06-24 20:40:20,739 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:40:20,739 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:40:20,741 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-06-24 20:40:20,741 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:40:20,741 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 94 transitions. [2018-06-24 20:40:20,741 INFO ]: Start accepts. Automaton has 42 states and 94 transitions. Word has length 16 [2018-06-24 20:40:20,741 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:20,741 INFO ]: Abstraction has 42 states and 94 transitions. [2018-06-24 20:40:20,741 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:40:20,741 INFO ]: Start isEmpty. Operand 42 states and 94 transitions. [2018-06-24 20:40:20,742 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:40:20,742 INFO ]: Found error trace [2018-06-24 20:40:20,742 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 20:40:20,742 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:20,742 INFO ]: Analyzing trace with hash 1972006014, now seen corresponding path program 11 times [2018-06-24 20:40:20,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:20,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:20,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:20,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:20,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:20,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:21,022 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:21,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:21,023 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:21,028 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:21,217 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:40:21,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:21,227 INFO ]: Computing forward predicates... [2018-06-24 20:40:21,254 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:21,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:21,288 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:40:21,288 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:40:21,289 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:40:21,289 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:40:21,289 INFO ]: Start difference. First operand 42 states and 94 transitions. Second operand 14 states. [2018-06-24 20:40:21,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:21,468 INFO ]: Finished difference Result 199 states and 409 transitions. [2018-06-24 20:40:21,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:40:21,469 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:40:21,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:21,470 INFO ]: With dead ends: 199 [2018-06-24 20:40:21,470 INFO ]: Without dead ends: 199 [2018-06-24 20:40:21,471 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:40:21,471 INFO ]: Start minimizeSevpa. Operand 199 states. [2018-06-24 20:40:21,474 INFO ]: Finished minimizeSevpa. Reduced states from 199 to 43. [2018-06-24 20:40:21,474 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:40:21,474 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 97 transitions. [2018-06-24 20:40:21,475 INFO ]: Start accepts. Automaton has 43 states and 97 transitions. Word has length 16 [2018-06-24 20:40:21,475 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:21,475 INFO ]: Abstraction has 43 states and 97 transitions. [2018-06-24 20:40:21,475 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:40:21,475 INFO ]: Start isEmpty. Operand 43 states and 97 transitions. [2018-06-24 20:40:21,475 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:40:21,475 INFO ]: Found error trace [2018-06-24 20:40:21,475 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 20:40:21,475 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:21,475 INFO ]: Analyzing trace with hash 1513106516, now seen corresponding path program 12 times [2018-06-24 20:40:21,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:21,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:21,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:21,476 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:21,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:21,498 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:22,146 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:22,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:22,146 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:22,152 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:22,368 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:40:22,369 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:22,376 INFO ]: Computing forward predicates... [2018-06-24 20:40:22,397 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:22,419 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:22,419 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:40:22,419 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:40:22,419 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:40:22,419 INFO ]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:40:22,419 INFO ]: Start difference. First operand 43 states and 97 transitions. Second operand 15 states. [2018-06-24 20:40:22,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:22,579 INFO ]: Finished difference Result 57 states and 113 transitions. [2018-06-24 20:40:22,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:40:22,580 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:40:22,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:22,580 INFO ]: With dead ends: 57 [2018-06-24 20:40:22,580 INFO ]: Without dead ends: 57 [2018-06-24 20:40:22,580 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:40:22,580 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:40:22,582 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 45. [2018-06-24 20:40:22,582 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:40:22,583 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 101 transitions. [2018-06-24 20:40:22,583 INFO ]: Start accepts. Automaton has 45 states and 101 transitions. Word has length 17 [2018-06-24 20:40:22,583 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:22,583 INFO ]: Abstraction has 45 states and 101 transitions. [2018-06-24 20:40:22,583 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:40:22,583 INFO ]: Start isEmpty. Operand 45 states and 101 transitions. [2018-06-24 20:40:22,583 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:40:22,583 INFO ]: Found error trace [2018-06-24 20:40:22,583 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 20:40:22,583 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:22,583 INFO ]: Analyzing trace with hash 1002572339, now seen corresponding path program 12 times [2018-06-24 20:40:22,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:22,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:22,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:22,584 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:22,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:22,612 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:22,847 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:22,847 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:22,847 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:22,852 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:23,062 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:40:23,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:23,070 INFO ]: Computing forward predicates... [2018-06-24 20:40:23,092 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:23,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:23,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:40:23,123 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:40:23,123 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:40:23,123 INFO ]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:40:23,123 INFO ]: Start difference. First operand 45 states and 101 transitions. Second operand 15 states. [2018-06-24 20:40:23,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:23,223 INFO ]: Finished difference Result 228 states and 468 transitions. [2018-06-24 20:40:23,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:40:23,223 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:40:23,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:23,224 INFO ]: With dead ends: 228 [2018-06-24 20:40:23,224 INFO ]: Without dead ends: 228 [2018-06-24 20:40:23,225 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:40:23,225 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-24 20:40:23,228 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 46. [2018-06-24 20:40:23,228 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:40:23,228 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 104 transitions. [2018-06-24 20:40:23,228 INFO ]: Start accepts. Automaton has 46 states and 104 transitions. Word has length 17 [2018-06-24 20:40:23,228 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:23,228 INFO ]: Abstraction has 46 states and 104 transitions. [2018-06-24 20:40:23,228 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:40:23,228 INFO ]: Start isEmpty. Operand 46 states and 104 transitions. [2018-06-24 20:40:23,229 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:40:23,229 INFO ]: Found error trace [2018-06-24 20:40:23,229 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 20:40:23,229 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:23,229 INFO ]: Analyzing trace with hash -338410211, now seen corresponding path program 13 times [2018-06-24 20:40:23,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:23,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:23,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:23,230 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:23,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:23,251 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:23,502 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:23,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:23,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:23,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:23,703 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:23,710 INFO ]: Computing forward predicates... [2018-06-24 20:40:23,733 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:23,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:23,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:40:23,763 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:40:23,763 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:40:23,763 INFO ]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:40:23,764 INFO ]: Start difference. First operand 46 states and 104 transitions. Second operand 16 states. [2018-06-24 20:40:23,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:23,970 INFO ]: Finished difference Result 61 states and 121 transitions. [2018-06-24 20:40:23,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:40:23,970 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:40:23,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:23,970 INFO ]: With dead ends: 61 [2018-06-24 20:40:23,970 INFO ]: Without dead ends: 61 [2018-06-24 20:40:23,971 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:40:23,971 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:40:23,972 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 48. [2018-06-24 20:40:23,972 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 20:40:23,973 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2018-06-24 20:40:23,973 INFO ]: Start accepts. Automaton has 48 states and 108 transitions. Word has length 18 [2018-06-24 20:40:23,973 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:23,973 INFO ]: Abstraction has 48 states and 108 transitions. [2018-06-24 20:40:23,973 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:40:23,973 INFO ]: Start isEmpty. Operand 48 states and 108 transitions. [2018-06-24 20:40:23,973 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:40:23,973 INFO ]: Found error trace [2018-06-24 20:40:23,973 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 20:40:23,973 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:23,973 INFO ]: Analyzing trace with hash 1014899486, now seen corresponding path program 13 times [2018-06-24 20:40:23,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:23,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:23,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:23,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:23,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:24,000 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:24,459 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:24,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:24,459 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:24,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:24,682 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:24,689 INFO ]: Computing forward predicates... [2018-06-24 20:40:24,712 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:24,745 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:24,745 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:40:24,745 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:40:24,746 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:40:24,746 INFO ]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:40:24,746 INFO ]: Start difference. First operand 48 states and 108 transitions. Second operand 16 states. [2018-06-24 20:40:25,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:25,140 INFO ]: Finished difference Result 259 states and 531 transitions. [2018-06-24 20:40:25,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:40:25,141 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:40:25,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:25,142 INFO ]: With dead ends: 259 [2018-06-24 20:40:25,142 INFO ]: Without dead ends: 259 [2018-06-24 20:40:25,142 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:40:25,143 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-24 20:40:25,146 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 49. [2018-06-24 20:40:25,146 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:40:25,147 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 111 transitions. [2018-06-24 20:40:25,147 INFO ]: Start accepts. Automaton has 49 states and 111 transitions. Word has length 18 [2018-06-24 20:40:25,147 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:25,147 INFO ]: Abstraction has 49 states and 111 transitions. [2018-06-24 20:40:25,147 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:40:25,147 INFO ]: Start isEmpty. Operand 49 states and 111 transitions. [2018-06-24 20:40:25,147 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:40:25,147 INFO ]: Found error trace [2018-06-24 20:40:25,147 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 20:40:25,147 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:25,147 INFO ]: Analyzing trace with hash -1900853900, now seen corresponding path program 14 times [2018-06-24 20:40:25,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:25,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:25,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:25,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:25,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:25,175 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:25,455 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:25,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:25,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:25,462 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:25,675 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:25,675 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:25,683 INFO ]: Computing forward predicates... [2018-06-24 20:40:25,706 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:25,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:25,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:40:25,731 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:40:25,732 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:40:25,732 INFO ]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:40:25,732 INFO ]: Start difference. First operand 49 states and 111 transitions. Second operand 17 states. [2018-06-24 20:40:25,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:25,844 INFO ]: Finished difference Result 65 states and 129 transitions. [2018-06-24 20:40:25,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:40:25,845 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:40:25,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:25,845 INFO ]: With dead ends: 65 [2018-06-24 20:40:25,845 INFO ]: Without dead ends: 65 [2018-06-24 20:40:25,846 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:40:25,846 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 20:40:25,847 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-06-24 20:40:25,847 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 20:40:25,847 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 115 transitions. [2018-06-24 20:40:25,848 INFO ]: Start accepts. Automaton has 51 states and 115 transitions. Word has length 19 [2018-06-24 20:40:25,848 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:25,848 INFO ]: Abstraction has 51 states and 115 transitions. [2018-06-24 20:40:25,848 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:40:25,848 INFO ]: Start isEmpty. Operand 51 states and 115 transitions. [2018-06-24 20:40:25,848 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:40:25,848 INFO ]: Found error trace [2018-06-24 20:40:25,848 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 20:40:25,848 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:25,848 INFO ]: Analyzing trace with hash 1397041043, now seen corresponding path program 14 times [2018-06-24 20:40:25,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:25,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:25,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:25,849 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:25,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:25,877 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:26,385 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:26,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:26,385 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:26,392 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:26,605 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:26,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:26,614 INFO ]: Computing forward predicates... [2018-06-24 20:40:26,635 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:26,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:26,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 20:40:26,669 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:40:26,669 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:40:26,669 INFO ]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:40:26,669 INFO ]: Start difference. First operand 51 states and 115 transitions. Second operand 17 states. [2018-06-24 20:40:27,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:27,704 INFO ]: Finished difference Result 292 states and 598 transitions. [2018-06-24 20:40:27,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:40:27,704 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:40:27,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:27,706 INFO ]: With dead ends: 292 [2018-06-24 20:40:27,706 INFO ]: Without dead ends: 292 [2018-06-24 20:40:27,706 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:40:27,706 INFO ]: Start minimizeSevpa. Operand 292 states. [2018-06-24 20:40:27,710 INFO ]: Finished minimizeSevpa. Reduced states from 292 to 52. [2018-06-24 20:40:27,710 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 20:40:27,711 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2018-06-24 20:40:27,711 INFO ]: Start accepts. Automaton has 52 states and 118 transitions. Word has length 19 [2018-06-24 20:40:27,711 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:27,711 INFO ]: Abstraction has 52 states and 118 transitions. [2018-06-24 20:40:27,711 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:40:27,711 INFO ]: Start isEmpty. Operand 52 states and 118 transitions. [2018-06-24 20:40:27,711 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:40:27,711 INFO ]: Found error trace [2018-06-24 20:40:27,711 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 20:40:27,711 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:27,711 INFO ]: Analyzing trace with hash 1202999293, now seen corresponding path program 15 times [2018-06-24 20:40:27,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:27,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:27,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:27,713 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:27,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:27,746 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:28,204 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:28,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:28,204 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:28,210 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:28,509 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:40:28,509 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:28,520 INFO ]: Computing forward predicates... [2018-06-24 20:40:28,548 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:28,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:28,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:40:28,586 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:40:28,586 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:40:28,586 INFO ]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:40:28,587 INFO ]: Start difference. First operand 52 states and 118 transitions. Second operand 18 states. [2018-06-24 20:40:28,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:28,850 INFO ]: Finished difference Result 69 states and 137 transitions. [2018-06-24 20:40:28,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:40:28,850 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:40:28,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:28,850 INFO ]: With dead ends: 69 [2018-06-24 20:40:28,850 INFO ]: Without dead ends: 69 [2018-06-24 20:40:28,851 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:40:28,851 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-24 20:40:28,852 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-06-24 20:40:28,852 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 20:40:28,853 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2018-06-24 20:40:28,853 INFO ]: Start accepts. Automaton has 54 states and 122 transitions. Word has length 20 [2018-06-24 20:40:28,853 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:28,853 INFO ]: Abstraction has 54 states and 122 transitions. [2018-06-24 20:40:28,853 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:40:28,853 INFO ]: Start isEmpty. Operand 54 states and 122 transitions. [2018-06-24 20:40:28,853 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:40:28,853 INFO ]: Found error trace [2018-06-24 20:40:28,853 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 20:40:28,853 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:28,854 INFO ]: Analyzing trace with hash 358527422, now seen corresponding path program 15 times [2018-06-24 20:40:28,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:28,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:28,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,854 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:28,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:28,878 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:29,162 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:29,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:29,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:29,167 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:29,443 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:40:29,443 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:29,454 INFO ]: Computing forward predicates... [2018-06-24 20:40:29,472 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:29,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:29,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:40:29,493 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:40:29,493 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:40:29,493 INFO ]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:40:29,494 INFO ]: Start difference. First operand 54 states and 122 transitions. Second operand 18 states. [2018-06-24 20:40:29,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:29,630 INFO ]: Finished difference Result 327 states and 669 transitions. [2018-06-24 20:40:29,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:40:29,630 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:40:29,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:29,632 INFO ]: With dead ends: 327 [2018-06-24 20:40:29,632 INFO ]: Without dead ends: 327 [2018-06-24 20:40:29,632 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:40:29,632 INFO ]: Start minimizeSevpa. Operand 327 states. [2018-06-24 20:40:29,638 INFO ]: Finished minimizeSevpa. Reduced states from 327 to 55. [2018-06-24 20:40:29,638 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 20:40:29,639 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 125 transitions. [2018-06-24 20:40:29,639 INFO ]: Start accepts. Automaton has 55 states and 125 transitions. Word has length 20 [2018-06-24 20:40:29,639 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:29,639 INFO ]: Abstraction has 55 states and 125 transitions. [2018-06-24 20:40:29,639 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:40:29,639 INFO ]: Start isEmpty. Operand 55 states and 125 transitions. [2018-06-24 20:40:29,639 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:40:29,639 INFO ]: Found error trace [2018-06-24 20:40:29,639 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 20:40:29,639 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:29,639 INFO ]: Analyzing trace with hash -1361799532, now seen corresponding path program 16 times [2018-06-24 20:40:29,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:29,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:29,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:29,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:29,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:29,669 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:29,931 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:29,932 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:29,932 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:29,944 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:30,203 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:30,203 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:30,211 INFO ]: Computing forward predicates... [2018-06-24 20:40:30,240 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:30,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:30,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:40:30,274 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:40:30,274 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:40:30,275 INFO ]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:40:30,275 INFO ]: Start difference. First operand 55 states and 125 transitions. Second operand 19 states. [2018-06-24 20:40:30,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:30,457 INFO ]: Finished difference Result 73 states and 145 transitions. [2018-06-24 20:40:30,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:40:30,457 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:40:30,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:30,458 INFO ]: With dead ends: 73 [2018-06-24 20:40:30,458 INFO ]: Without dead ends: 73 [2018-06-24 20:40:30,458 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:40:30,458 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 20:40:30,460 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-06-24 20:40:30,460 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 20:40:30,460 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 129 transitions. [2018-06-24 20:40:30,460 INFO ]: Start accepts. Automaton has 57 states and 129 transitions. Word has length 21 [2018-06-24 20:40:30,460 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:30,460 INFO ]: Abstraction has 57 states and 129 transitions. [2018-06-24 20:40:30,460 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:40:30,460 INFO ]: Start isEmpty. Operand 57 states and 129 transitions. [2018-06-24 20:40:30,461 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:40:30,461 INFO ]: Found error trace [2018-06-24 20:40:30,461 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 20:40:30,461 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:30,461 INFO ]: Analyzing trace with hash -1770623757, now seen corresponding path program 16 times [2018-06-24 20:40:30,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:30,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:30,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:30,461 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:30,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:30,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:31,328 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:31,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:31,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:31,335 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:31,577 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:31,577 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:31,588 INFO ]: Computing forward predicates... [2018-06-24 20:40:31,617 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:31,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:31,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 20:40:31,650 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:40:31,650 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:40:31,650 INFO ]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:40:31,651 INFO ]: Start difference. First operand 57 states and 129 transitions. Second operand 19 states. [2018-06-24 20:40:31,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:31,821 INFO ]: Finished difference Result 364 states and 744 transitions. [2018-06-24 20:40:31,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:40:31,822 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:40:31,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:31,823 INFO ]: With dead ends: 364 [2018-06-24 20:40:31,823 INFO ]: Without dead ends: 364 [2018-06-24 20:40:31,824 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:40:31,824 INFO ]: Start minimizeSevpa. Operand 364 states. [2018-06-24 20:40:31,827 INFO ]: Finished minimizeSevpa. Reduced states from 364 to 58. [2018-06-24 20:40:31,827 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-24 20:40:31,828 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 132 transitions. [2018-06-24 20:40:31,828 INFO ]: Start accepts. Automaton has 58 states and 132 transitions. Word has length 21 [2018-06-24 20:40:31,828 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:31,828 INFO ]: Abstraction has 58 states and 132 transitions. [2018-06-24 20:40:31,828 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:40:31,828 INFO ]: Start isEmpty. Operand 58 states and 132 transitions. [2018-06-24 20:40:31,828 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:40:31,828 INFO ]: Found error trace [2018-06-24 20:40:31,828 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 20:40:31,828 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:31,828 INFO ]: Analyzing trace with hash 733815517, now seen corresponding path program 17 times [2018-06-24 20:40:31,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:31,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:31,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,829 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:31,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:31,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:32,230 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:32,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:32,230 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:32,235 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:32,570 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:40:32,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:32,587 INFO ]: Computing forward predicates... [2018-06-24 20:40:32,605 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:32,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:32,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:40:32,627 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:40:32,627 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:40:32,627 INFO ]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:40:32,627 INFO ]: Start difference. First operand 58 states and 132 transitions. Second operand 20 states. [2018-06-24 20:40:32,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:32,791 INFO ]: Finished difference Result 77 states and 153 transitions. [2018-06-24 20:40:32,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:40:32,791 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:40:32,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:32,792 INFO ]: With dead ends: 77 [2018-06-24 20:40:32,792 INFO ]: Without dead ends: 77 [2018-06-24 20:40:32,792 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:40:32,792 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-24 20:40:32,794 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-06-24 20:40:32,794 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:40:32,795 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 136 transitions. [2018-06-24 20:40:32,795 INFO ]: Start accepts. Automaton has 60 states and 136 transitions. Word has length 22 [2018-06-24 20:40:32,795 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:32,795 INFO ]: Abstraction has 60 states and 136 transitions. [2018-06-24 20:40:32,795 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:40:32,795 INFO ]: Start isEmpty. Operand 60 states and 136 transitions. [2018-06-24 20:40:32,795 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:40:32,795 INFO ]: Found error trace [2018-06-24 20:40:32,795 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 20:40:32,796 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:32,796 INFO ]: Analyzing trace with hash 945166430, now seen corresponding path program 17 times [2018-06-24 20:40:32,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:32,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:32,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:32,796 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:32,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:32,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:33,121 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:33,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:33,121 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:33,127 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:33,469 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:40:33,469 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:33,486 INFO ]: Computing forward predicates... [2018-06-24 20:40:33,503 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:33,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:33,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:40:33,535 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:40:33,535 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:40:33,535 INFO ]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:40:33,535 INFO ]: Start difference. First operand 60 states and 136 transitions. Second operand 20 states. [2018-06-24 20:40:33,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:33,703 INFO ]: Finished difference Result 403 states and 823 transitions. [2018-06-24 20:40:33,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:40:33,704 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:40:33,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:33,705 INFO ]: With dead ends: 403 [2018-06-24 20:40:33,705 INFO ]: Without dead ends: 403 [2018-06-24 20:40:33,705 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:40:33,705 INFO ]: Start minimizeSevpa. Operand 403 states. [2018-06-24 20:40:33,709 INFO ]: Finished minimizeSevpa. Reduced states from 403 to 61. [2018-06-24 20:40:33,709 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 20:40:33,710 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 139 transitions. [2018-06-24 20:40:33,710 INFO ]: Start accepts. Automaton has 61 states and 139 transitions. Word has length 22 [2018-06-24 20:40:33,710 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:33,710 INFO ]: Abstraction has 61 states and 139 transitions. [2018-06-24 20:40:33,710 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:40:33,710 INFO ]: Start isEmpty. Operand 61 states and 139 transitions. [2018-06-24 20:40:33,710 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:40:33,710 INFO ]: Found error trace [2018-06-24 20:40:33,710 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 20:40:33,710 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:33,711 INFO ]: Analyzing trace with hash 1273372596, now seen corresponding path program 18 times [2018-06-24 20:40:33,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:33,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:33,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:33,711 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:33,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:33,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:34,813 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:34,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:34,813 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:34,819 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:35,149 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:40:35,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:35,162 INFO ]: Computing forward predicates... [2018-06-24 20:40:35,203 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:35,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:35,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:40:35,244 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:40:35,244 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:40:35,244 INFO ]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:40:35,244 INFO ]: Start difference. First operand 61 states and 139 transitions. Second operand 21 states. [2018-06-24 20:40:35,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:35,435 INFO ]: Finished difference Result 81 states and 161 transitions. [2018-06-24 20:40:35,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:40:35,437 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:40:35,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:35,437 INFO ]: With dead ends: 81 [2018-06-24 20:40:35,437 INFO ]: Without dead ends: 81 [2018-06-24 20:40:35,438 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:40:35,438 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-24 20:40:35,439 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 63. [2018-06-24 20:40:35,439 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-24 20:40:35,439 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 143 transitions. [2018-06-24 20:40:35,439 INFO ]: Start accepts. Automaton has 63 states and 143 transitions. Word has length 23 [2018-06-24 20:40:35,439 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:35,439 INFO ]: Abstraction has 63 states and 143 transitions. [2018-06-24 20:40:35,439 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:40:35,439 INFO ]: Start isEmpty. Operand 63 states and 143 transitions. [2018-06-24 20:40:35,439 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:40:35,439 INFO ]: Found error trace [2018-06-24 20:40:35,439 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 20:40:35,439 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:35,440 INFO ]: Analyzing trace with hash -764683693, now seen corresponding path program 18 times [2018-06-24 20:40:35,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:35,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:35,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:35,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:35,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:35,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:35,689 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:35,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:35,689 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:35,694 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:40:36,038 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:40:36,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:36,049 INFO ]: Computing forward predicates... [2018-06-24 20:40:36,069 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:36,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:36,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 20:40:36,097 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:40:36,097 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:40:36,097 INFO ]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:40:36,097 INFO ]: Start difference. First operand 63 states and 143 transitions. Second operand 21 states. [2018-06-24 20:40:36,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:36,475 INFO ]: Finished difference Result 444 states and 906 transitions. [2018-06-24 20:40:36,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:40:36,478 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:40:36,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:36,479 INFO ]: With dead ends: 444 [2018-06-24 20:40:36,479 INFO ]: Without dead ends: 444 [2018-06-24 20:40:36,479 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:40:36,480 INFO ]: Start minimizeSevpa. Operand 444 states. [2018-06-24 20:40:36,483 INFO ]: Finished minimizeSevpa. Reduced states from 444 to 64. [2018-06-24 20:40:36,484 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-24 20:40:36,484 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 146 transitions. [2018-06-24 20:40:36,484 INFO ]: Start accepts. Automaton has 64 states and 146 transitions. Word has length 23 [2018-06-24 20:40:36,484 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:36,484 INFO ]: Abstraction has 64 states and 146 transitions. [2018-06-24 20:40:36,484 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:40:36,484 INFO ]: Start isEmpty. Operand 64 states and 146 transitions. [2018-06-24 20:40:36,485 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:40:36,505 INFO ]: Found error trace [2018-06-24 20:40:36,505 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 20:40:36,505 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:36,505 INFO ]: Analyzing trace with hash 819772861, now seen corresponding path program 19 times [2018-06-24 20:40:36,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:36,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:36,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:36,505 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:36,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:36,535 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:36,830 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:36,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:36,830 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-24 20:40:36,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:37,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:37,122 INFO ]: Computing forward predicates... [2018-06-24 20:40:37,155 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:37,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:37,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:40:37,190 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:40:37,190 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:40:37,190 INFO ]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:40:37,190 INFO ]: Start difference. First operand 64 states and 146 transitions. Second operand 22 states. [2018-06-24 20:40:37,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:37,567 INFO ]: Finished difference Result 85 states and 169 transitions. [2018-06-24 20:40:37,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:40:37,568 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:40:37,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:37,568 INFO ]: With dead ends: 85 [2018-06-24 20:40:37,568 INFO ]: Without dead ends: 85 [2018-06-24 20:40:37,568 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:40:37,568 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-24 20:40:37,570 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 66. [2018-06-24 20:40:37,570 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 20:40:37,571 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 150 transitions. [2018-06-24 20:40:37,571 INFO ]: Start accepts. Automaton has 66 states and 150 transitions. Word has length 24 [2018-06-24 20:40:37,571 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:37,571 INFO ]: Abstraction has 66 states and 150 transitions. [2018-06-24 20:40:37,571 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:40:37,571 INFO ]: Start isEmpty. Operand 66 states and 150 transitions. [2018-06-24 20:40:37,571 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:40:37,571 INFO ]: Found error trace [2018-06-24 20:40:37,571 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 20:40:37,571 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:37,572 INFO ]: Analyzing trace with hash 2064537342, now seen corresponding path program 19 times [2018-06-24 20:40:37,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:37,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:37,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:37,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:37,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:37,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:37,883 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:37,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:37,883 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-24 20:40:37,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:38,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:38,175 INFO ]: Computing forward predicates... [2018-06-24 20:40:38,194 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:38,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:38,216 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:40:38,216 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:40:38,216 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:40:38,216 INFO ]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:40:38,216 INFO ]: Start difference. First operand 66 states and 150 transitions. Second operand 22 states. [2018-06-24 20:40:38,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:38,458 INFO ]: Finished difference Result 487 states and 993 transitions. [2018-06-24 20:40:38,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:40:38,458 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:40:38,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:38,460 INFO ]: With dead ends: 487 [2018-06-24 20:40:38,460 INFO ]: Without dead ends: 487 [2018-06-24 20:40:38,460 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:40:38,460 INFO ]: Start minimizeSevpa. Operand 487 states. [2018-06-24 20:40:38,465 INFO ]: Finished minimizeSevpa. Reduced states from 487 to 67. [2018-06-24 20:40:38,465 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 20:40:38,465 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 153 transitions. [2018-06-24 20:40:38,465 INFO ]: Start accepts. Automaton has 67 states and 153 transitions. Word has length 24 [2018-06-24 20:40:38,465 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:38,465 INFO ]: Abstraction has 67 states and 153 transitions. [2018-06-24 20:40:38,465 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:40:38,465 INFO ]: Start isEmpty. Operand 67 states and 153 transitions. [2018-06-24 20:40:38,466 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:40:38,466 INFO ]: Found error trace [2018-06-24 20:40:38,466 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 20:40:38,466 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:38,466 INFO ]: Analyzing trace with hash -356917036, now seen corresponding path program 20 times [2018-06-24 20:40:38,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:38,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:38,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:38,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:40:38,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:38,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:39,136 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:39,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:39,137 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-24 20:40:39,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:39,441 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:39,441 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:39,451 INFO ]: Computing forward predicates... [2018-06-24 20:40:39,477 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:39,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:39,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:40:39,505 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:40:39,505 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:40:39,505 INFO ]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:40:39,505 INFO ]: Start difference. First operand 67 states and 153 transitions. Second operand 23 states. [2018-06-24 20:40:39,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:39,662 INFO ]: Finished difference Result 89 states and 177 transitions. [2018-06-24 20:40:39,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:40:39,662 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:40:39,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:39,662 INFO ]: With dead ends: 89 [2018-06-24 20:40:39,662 INFO ]: Without dead ends: 89 [2018-06-24 20:40:39,662 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:40:39,662 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 20:40:39,664 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-06-24 20:40:39,664 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-24 20:40:39,664 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 157 transitions. [2018-06-24 20:40:39,664 INFO ]: Start accepts. Automaton has 69 states and 157 transitions. Word has length 25 [2018-06-24 20:40:39,664 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:39,664 INFO ]: Abstraction has 69 states and 157 transitions. [2018-06-24 20:40:39,664 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:40:39,665 INFO ]: Start isEmpty. Operand 69 states and 157 transitions. [2018-06-24 20:40:39,665 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:40:39,665 INFO ]: Found error trace [2018-06-24 20:40:39,665 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 20:40:39,665 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:39,665 INFO ]: Analyzing trace with hash -423923789, now seen corresponding path program 20 times [2018-06-24 20:40:39,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:39,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:39,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:39,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:39,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:39,696 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:40,055 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:40,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:40,055 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-24 20:40:40,060 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:40:40,424 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:40:40,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:40,462 INFO ]: Computing forward predicates... [2018-06-24 20:40:40,502 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:40,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:40,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-24 20:40:40,535 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:40:40,536 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:40:40,536 INFO ]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:40:40,536 INFO ]: Start difference. First operand 69 states and 157 transitions. Second operand 23 states. [2018-06-24 20:40:41,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:41,008 INFO ]: Finished difference Result 532 states and 1084 transitions. [2018-06-24 20:40:41,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:40:41,008 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:40:41,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:41,010 INFO ]: With dead ends: 532 [2018-06-24 20:40:41,010 INFO ]: Without dead ends: 532 [2018-06-24 20:40:41,010 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:40:41,010 INFO ]: Start minimizeSevpa. Operand 532 states. [2018-06-24 20:40:41,016 INFO ]: Finished minimizeSevpa. Reduced states from 532 to 70. [2018-06-24 20:40:41,016 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 20:40:41,016 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 160 transitions. [2018-06-24 20:40:41,016 INFO ]: Start accepts. Automaton has 70 states and 160 transitions. Word has length 25 [2018-06-24 20:40:41,017 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:41,017 INFO ]: Abstraction has 70 states and 160 transitions. [2018-06-24 20:40:41,017 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:40:41,017 INFO ]: Start isEmpty. Operand 70 states and 160 transitions. [2018-06-24 20:40:41,017 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:40:41,017 INFO ]: Found error trace [2018-06-24 20:40:41,017 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 20:40:41,017 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:41,017 INFO ]: Analyzing trace with hash 1820401821, now seen corresponding path program 21 times [2018-06-24 20:40:41,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:41,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:41,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:41,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:41,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:41,048 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:41,881 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:41,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:41,897 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-24 20:40:41,905 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:42,342 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:40:42,342 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:42,358 INFO ]: Computing forward predicates... [2018-06-24 20:40:42,390 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:42,425 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:42,425 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:40:42,425 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:40:42,425 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:40:42,425 INFO ]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:40:42,426 INFO ]: Start difference. First operand 70 states and 160 transitions. Second operand 24 states. [2018-06-24 20:40:45,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:45,489 INFO ]: Finished difference Result 93 states and 185 transitions. [2018-06-24 20:40:45,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:40:45,492 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:40:45,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:45,492 INFO ]: With dead ends: 93 [2018-06-24 20:40:45,492 INFO ]: Without dead ends: 93 [2018-06-24 20:40:45,493 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:40:45,493 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-24 20:40:45,494 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 72. [2018-06-24 20:40:45,494 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-24 20:40:45,495 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 164 transitions. [2018-06-24 20:40:45,495 INFO ]: Start accepts. Automaton has 72 states and 164 transitions. Word has length 26 [2018-06-24 20:40:45,495 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:45,495 INFO ]: Abstraction has 72 states and 164 transitions. [2018-06-24 20:40:45,495 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:40:45,495 INFO ]: Start isEmpty. Operand 72 states and 164 transitions. [2018-06-24 20:40:45,495 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:40:45,495 INFO ]: Found error trace [2018-06-24 20:40:45,495 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 20:40:45,495 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:45,495 INFO ]: Analyzing trace with hash -256807522, now seen corresponding path program 21 times [2018-06-24 20:40:45,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:45,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:45,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:45,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:45,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:45,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:45,930 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:45,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:45,930 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-24 20:40:45,937 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:40:46,345 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:40:46,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:46,362 INFO ]: Computing forward predicates... [2018-06-24 20:40:46,394 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:46,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:46,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:40:46,429 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:40:46,429 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:40:46,429 INFO ]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:40:46,430 INFO ]: Start difference. First operand 72 states and 164 transitions. Second operand 24 states. [2018-06-24 20:40:46,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:46,620 INFO ]: Finished difference Result 579 states and 1179 transitions. [2018-06-24 20:40:46,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:40:46,620 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:40:46,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:46,621 INFO ]: With dead ends: 579 [2018-06-24 20:40:46,621 INFO ]: Without dead ends: 579 [2018-06-24 20:40:46,621 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:40:46,622 INFO ]: Start minimizeSevpa. Operand 579 states. [2018-06-24 20:40:46,625 INFO ]: Finished minimizeSevpa. Reduced states from 579 to 73. [2018-06-24 20:40:46,625 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-24 20:40:46,626 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 167 transitions. [2018-06-24 20:40:46,626 INFO ]: Start accepts. Automaton has 73 states and 167 transitions. Word has length 26 [2018-06-24 20:40:46,626 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:46,626 INFO ]: Abstraction has 73 states and 167 transitions. [2018-06-24 20:40:46,626 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:40:46,626 INFO ]: Start isEmpty. Operand 73 states and 167 transitions. [2018-06-24 20:40:46,626 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:40:46,626 INFO ]: Found error trace [2018-06-24 20:40:46,626 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 20:40:46,626 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:46,627 INFO ]: Analyzing trace with hash 597809652, now seen corresponding path program 22 times [2018-06-24 20:40:46,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:46,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:46,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:46,627 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:46,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:46,660 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:47,218 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:47,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:47,242 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-24 20:40:47,247 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:47,569 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:47,569 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:47,581 INFO ]: Computing forward predicates... [2018-06-24 20:40:47,613 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:47,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:47,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:40:47,650 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:40:47,650 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:40:47,650 INFO ]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:40:47,650 INFO ]: Start difference. First operand 73 states and 167 transitions. Second operand 25 states. [2018-06-24 20:40:48,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:48,115 INFO ]: Finished difference Result 97 states and 193 transitions. [2018-06-24 20:40:48,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:40:48,115 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:40:48,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:48,115 INFO ]: With dead ends: 97 [2018-06-24 20:40:48,115 INFO ]: Without dead ends: 97 [2018-06-24 20:40:48,115 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:40:48,115 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 20:40:48,117 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 75. [2018-06-24 20:40:48,117 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 20:40:48,117 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 171 transitions. [2018-06-24 20:40:48,117 INFO ]: Start accepts. Automaton has 75 states and 171 transitions. Word has length 27 [2018-06-24 20:40:48,117 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:48,117 INFO ]: Abstraction has 75 states and 171 transitions. [2018-06-24 20:40:48,117 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:40:48,117 INFO ]: Start isEmpty. Operand 75 states and 171 transitions. [2018-06-24 20:40:48,118 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:40:48,118 INFO ]: Found error trace [2018-06-24 20:40:48,118 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 20:40:48,118 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:48,118 INFO ]: Analyzing trace with hash 628829459, now seen corresponding path program 22 times [2018-06-24 20:40:48,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:48,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:48,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:48,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:48,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:48,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:48,472 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:48,472 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:48,472 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-24 20:40:48,479 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:40:48,797 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:40:48,797 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:48,812 INFO ]: Computing forward predicates... [2018-06-24 20:40:48,842 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:48,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:48,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-24 20:40:48,876 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:40:48,877 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:40:48,877 INFO ]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:40:48,877 INFO ]: Start difference. First operand 75 states and 171 transitions. Second operand 25 states. [2018-06-24 20:40:49,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:49,044 INFO ]: Finished difference Result 628 states and 1278 transitions. [2018-06-24 20:40:49,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:40:49,044 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:40:49,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:49,045 INFO ]: With dead ends: 628 [2018-06-24 20:40:49,045 INFO ]: Without dead ends: 628 [2018-06-24 20:40:49,045 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:40:49,046 INFO ]: Start minimizeSevpa. Operand 628 states. [2018-06-24 20:40:49,049 INFO ]: Finished minimizeSevpa. Reduced states from 628 to 76. [2018-06-24 20:40:49,049 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-24 20:40:49,050 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 174 transitions. [2018-06-24 20:40:49,050 INFO ]: Start accepts. Automaton has 76 states and 174 transitions. Word has length 27 [2018-06-24 20:40:49,050 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:49,050 INFO ]: Abstraction has 76 states and 174 transitions. [2018-06-24 20:40:49,050 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:40:49,050 INFO ]: Start isEmpty. Operand 76 states and 174 transitions. [2018-06-24 20:40:49,050 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:40:49,050 INFO ]: Found error trace [2018-06-24 20:40:49,050 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 20:40:49,051 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:49,051 INFO ]: Analyzing trace with hash 1352158077, now seen corresponding path program 23 times [2018-06-24 20:40:49,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:49,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:49,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:49,051 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:49,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:49,085 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:50,104 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:50,104 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:50,104 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-24 20:40:50,115 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:50,596 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:40:50,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:50,622 INFO ]: Computing forward predicates... [2018-06-24 20:40:50,657 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:50,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:50,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 20:40:50,692 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:40:50,692 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:40:50,693 INFO ]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:40:50,693 INFO ]: Start difference. First operand 76 states and 174 transitions. Second operand 26 states. [2018-06-24 20:40:51,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:51,053 INFO ]: Finished difference Result 101 states and 201 transitions. [2018-06-24 20:40:51,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:40:51,054 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:40:51,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:51,054 INFO ]: With dead ends: 101 [2018-06-24 20:40:51,054 INFO ]: Without dead ends: 101 [2018-06-24 20:40:51,054 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:40:51,054 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-24 20:40:51,056 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 78. [2018-06-24 20:40:51,056 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 20:40:51,056 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 178 transitions. [2018-06-24 20:40:51,057 INFO ]: Start accepts. Automaton has 78 states and 178 transitions. Word has length 28 [2018-06-24 20:40:51,057 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:51,057 INFO ]: Abstraction has 78 states and 178 transitions. [2018-06-24 20:40:51,057 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:40:51,057 INFO ]: Start isEmpty. Operand 78 states and 178 transitions. [2018-06-24 20:40:51,057 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:40:51,057 INFO ]: Found error trace [2018-06-24 20:40:51,057 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 20:40:51,057 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:51,057 INFO ]: Analyzing trace with hash -1981195202, now seen corresponding path program 23 times [2018-06-24 20:40:51,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:51,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:51,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:51,058 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:51,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:51,100 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:51,459 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:51,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:51,459 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:51,464 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:40:51,987 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:40:51,987 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:52,017 INFO ]: Computing forward predicates... [2018-06-24 20:40:52,041 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:52,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:40:52,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 20:40:52,076 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:40:52,076 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:40:52,076 INFO ]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:40:52,077 INFO ]: Start difference. First operand 78 states and 178 transitions. Second operand 26 states. [2018-06-24 20:40:52,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:40:52,228 INFO ]: Finished difference Result 679 states and 1381 transitions. [2018-06-24 20:40:52,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:40:52,250 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:40:52,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:40:52,252 INFO ]: With dead ends: 679 [2018-06-24 20:40:52,252 INFO ]: Without dead ends: 679 [2018-06-24 20:40:52,252 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:40:52,253 INFO ]: Start minimizeSevpa. Operand 679 states. [2018-06-24 20:40:52,258 INFO ]: Finished minimizeSevpa. Reduced states from 679 to 79. [2018-06-24 20:40:52,258 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 20:40:52,258 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 181 transitions. [2018-06-24 20:40:52,258 INFO ]: Start accepts. Automaton has 79 states and 181 transitions. Word has length 28 [2018-06-24 20:40:52,258 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:40:52,258 INFO ]: Abstraction has 79 states and 181 transitions. [2018-06-24 20:40:52,258 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:40:52,258 INFO ]: Start isEmpty. Operand 79 states and 181 transitions. [2018-06-24 20:40:52,259 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:40:52,259 INFO ]: Found error trace [2018-06-24 20:40:52,260 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-24 20:40:52,260 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:40:52,260 INFO ]: Analyzing trace with hash -1032844524, now seen corresponding path program 24 times [2018-06-24 20:40:52,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:40:52,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:40:52,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:52,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:40:52,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:40:52,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:52,766 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:40:52,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:40:52,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:52,771 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-06-24 20:40:53,222 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-24 20:40:53,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:40:53,239 INFO ]: Computing forward predicates... [2018-06-24 20:40:53,240 INFO ]: Timeout while computing interpolants [2018-06-24 20:40:53,441 WARN ]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:40:53,441 WARN ]: Verification canceled [2018-06-24 20:40:53,442 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:40:53,443 WARN ]: Timeout [2018-06-24 20:40:53,443 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:40:53 BasicIcfg [2018-06-24 20:40:53,443 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:40:53,444 INFO ]: Toolchain (without parser) took 51345.33 ms. Allocated memory was 302.5 MB in the beginning and 986.2 MB in the end (delta: 683.7 MB). Free memory was 242.9 MB in the beginning and 573.4 MB in the end (delta: -330.5 MB). Peak memory consumption was 353.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:40:53,446 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:40:53,446 INFO ]: ChcToBoogie took 59.65 ms. Allocated memory is still 302.5 MB. Free memory was 242.9 MB in the beginning and 239.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:40:53,446 INFO ]: Boogie Preprocessor took 57.78 ms. Allocated memory is still 302.5 MB. Free memory was 239.9 MB in the beginning and 238.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:40:53,446 INFO ]: RCFGBuilder took 578.76 ms. Allocated memory is still 302.5 MB. Free memory was 238.9 MB in the beginning and 210.8 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:40:53,447 INFO ]: BlockEncodingV2 took 975.59 ms. Allocated memory was 302.5 MB in the beginning and 323.5 MB in the end (delta: 21.0 MB). Free memory was 210.8 MB in the beginning and 246.5 MB in the end (delta: -35.8 MB). Peak memory consumption was 35.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:40:53,447 INFO ]: TraceAbstraction took 49663.41 ms. Allocated memory was 323.5 MB in the beginning and 986.2 MB in the end (delta: 662.7 MB). Free memory was 246.5 MB in the beginning and 573.4 MB in the end (delta: -326.9 MB). Peak memory consumption was 335.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:40:53,452 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 35 edges - StatisticsResult: Encoded RCFG 6 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.65 ms. Allocated memory is still 302.5 MB. Free memory was 242.9 MB in the beginning and 239.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.78 ms. Allocated memory is still 302.5 MB. Free memory was 239.9 MB in the beginning and 238.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 578.76 ms. Allocated memory is still 302.5 MB. Free memory was 238.9 MB in the beginning and 210.8 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 975.59 ms. Allocated memory was 302.5 MB in the beginning and 323.5 MB in the end (delta: 21.0 MB). Free memory was 210.8 MB in the beginning and 246.5 MB in the end (delta: -35.8 MB). Peak memory consumption was 35.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49663.41 ms. Allocated memory was 323.5 MB in the beginning and 986.2 MB in the end (delta: 662.7 MB). Free memory was 246.5 MB in the beginning and 573.4 MB in the end (delta: -326.9 MB). Peak memory consumption was 335.8 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 30 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 8 quantified variables from 9 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 49.5s OverallTime, 50 OverallIterations, 24 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 439 SDtfs, 1 SDslu, 1266 SDs, 0 SdLazy, 3508 SolverSat, 1665 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1435 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 49 MinimizatonAttempts, 5477 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.1s SsaConstructionTime, 9.7s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 1580 NumberOfCodeBlocks, 1580 NumberOfCodeBlocksAsserted, 259 NumberOfCheckSat, 1485 ConstructedInterpolants, 0 QuantifiedInterpolants, 74051 SizeOfPredicates, 3726 NumberOfNonLiveVariables, 94714 ConjunctsInSsa, 4876 ConjunctsInUnsatCore, 95 InterpolantComputations, 3 PerfectInterpolantSequences, 1/9201 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/18.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-40-53-469.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/18.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-40-53-469.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/18.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-40-53-469.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/18.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-40-53-469.csv Completed graceful shutdown