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/reve/025d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:11:34,445 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:11:34,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:11:34,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:11:34,459 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:11:34,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:11:34,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:11:34,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:11:34,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:11:34,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:11:34,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:11:34,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:11:34,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:11:34,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:11:34,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:11:34,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:11:34,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:11:34,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:11:34,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:11:34,499 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:11:34,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:11:34,501 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:11:34,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:11:34,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:11:34,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:11:34,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:11:34,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:11:34,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:11:34,508 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:11:34,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:11:34,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:11:34,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:11:34,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:11:34,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:11:34,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:11:34,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:11:34,513 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:11:34,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:11:34,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:11:34,527 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:11:34,527 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:11:34,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:11:34,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:11:34,529 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:11:34,529 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:11:34,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:11:34,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:11:34,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:11:34,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:11:34,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:11:34,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:11:34,531 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:11:34,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:11:34,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:11:34,531 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:11:34,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:11:34,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:11:34,532 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:11:34,535 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:11:34,535 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:11:34,587 INFO ]: Repository-Root is: /tmp [2018-06-26 18:11:34,604 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:11:34,611 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:11:34,612 INFO ]: Initializing SmtParser... [2018-06-26 18:11:34,612 INFO ]: SmtParser initialized [2018-06-26 18:11:34,613 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-26 18:11:34,614 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:11:34,704 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 unknown [2018-06-26 18:11:34,917 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-26 18:11:34,922 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:11:34,925 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:11:34,926 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:11:34,926 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:11:34,926 INFO ]: ChcToBoogie initialized [2018-06-26 18:11:34,929 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:34,991 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34 Unit [2018-06-26 18:11:34,991 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:11:34,992 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:11:34,992 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:11:34,992 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:11:35,014 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,014 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,022 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,022 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,035 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,038 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,039 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... [2018-06-26 18:11:35,040 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:11:35,041 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:11:35,041 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:11:35,041 INFO ]: RCFGBuilder initialized [2018-06-26 18:11:35,051 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:11:35,064 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:11:35,064 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:11:35,064 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:11:35,064 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:11:35,064 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:11:35,065 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 18:11:35,408 INFO ]: Using library mode [2018-06-26 18:11:35,408 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:11:35 BoogieIcfgContainer [2018-06-26 18:11:35,408 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:11:35,408 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:11:35,408 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:11:35,409 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:11:35,410 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:11:35" (1/1) ... [2018-06-26 18:11:35,423 INFO ]: Initial Icfg 12 locations, 23 edges [2018-06-26 18:11:35,424 INFO ]: Using Remove infeasible edges [2018-06-26 18:11:35,425 INFO ]: Using Maximize final states [2018-06-26 18:11:35,425 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:11:35,425 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:11:35,427 INFO ]: Using Remove sink states [2018-06-26 18:11:35,428 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:11:35,428 INFO ]: Using Use SBE [2018-06-26 18:11:35,434 INFO ]: SBE split 0 edges [2018-06-26 18:11:35,438 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:11:35,440 INFO ]: 0 new accepting states [2018-06-26 18:11:35,481 INFO ]: Removed 6 edges and 2 locations by large block encoding [2018-06-26 18:11:35,483 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:11:35,487 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:11:35,487 INFO ]: 0 new accepting states [2018-06-26 18:11:35,487 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:11:35,487 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:11:35,487 INFO ]: Encoded RCFG 8 locations, 19 edges [2018-06-26 18:11:35,488 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:11:35 BasicIcfg [2018-06-26 18:11:35,488 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:11:35,489 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:11:35,489 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:11:35,492 INFO ]: TraceAbstraction initialized [2018-06-26 18:11:35,492 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:11:34" (1/4) ... [2018-06-26 18:11:35,493 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d790f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:11:35, skipping insertion in model container [2018-06-26 18:11:35,493 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:11:34" (2/4) ... [2018-06-26 18:11:35,493 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d790f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:11:35, skipping insertion in model container [2018-06-26 18:11:35,493 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:11:35" (3/4) ... [2018-06-26 18:11:35,494 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d790f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:11:35, skipping insertion in model container [2018-06-26 18:11:35,494 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:11:35" (4/4) ... [2018-06-26 18:11:35,496 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:11:35,505 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:11:35,513 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:11:35,558 INFO ]: Using default assertion order modulation [2018-06-26 18:11:35,558 INFO ]: Interprodecural is true [2018-06-26 18:11:35,558 INFO ]: Hoare is false [2018-06-26 18:11:35,559 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:11:35,559 INFO ]: Backedges is TWOTRACK [2018-06-26 18:11:35,559 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:11:35,559 INFO ]: Difference is false [2018-06-26 18:11:35,559 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:11:35,559 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:11:35,573 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 18:11:35,596 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:11:35,596 INFO ]: Found error trace [2018-06-26 18:11:35,597 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:11:35,598 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:35,602 INFO ]: Analyzing trace with hash 47809488, now seen corresponding path program 1 times [2018-06-26 18:11:35,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:35,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:35,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:35,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:35,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:35,682 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:35,874 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-26 18:11:35,877 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:35,878 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:11:35,878 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:11:35,880 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:11:35,892 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:11:35,893 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:11:35,896 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-26 18:11:36,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:36,057 INFO ]: Finished difference Result 12 states and 34 transitions. [2018-06-26 18:11:36,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:11:36,059 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:11:36,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:36,067 INFO ]: With dead ends: 12 [2018-06-26 18:11:36,067 INFO ]: Without dead ends: 12 [2018-06-26 18:11:36,068 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:11:36,083 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:11:36,113 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-26 18:11:36,114 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:11:36,115 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-06-26 18:11:36,117 INFO ]: Start accepts. Automaton has 9 states and 27 transitions. Word has length 5 [2018-06-26 18:11:36,118 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:36,118 INFO ]: Abstraction has 9 states and 27 transitions. [2018-06-26 18:11:36,118 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:11:36,118 INFO ]: Start isEmpty. Operand 9 states and 27 transitions. [2018-06-26 18:11:36,118 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:11:36,118 INFO ]: Found error trace [2018-06-26 18:11:36,118 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:11:36,118 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:36,119 INFO ]: Analyzing trace with hash 1481560945, now seen corresponding path program 1 times [2018-06-26 18:11:36,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:36,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:36,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:36,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:36,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:36,133 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:36,213 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:36,213 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:11:36,213 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:11:36,215 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:11:36,215 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:11:36,215 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:11:36,215 INFO ]: Start difference. First operand 9 states and 27 transitions. Second operand 3 states. [2018-06-26 18:11:36,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:36,410 INFO ]: Finished difference Result 12 states and 37 transitions. [2018-06-26 18:11:36,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:11:36,410 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:11:36,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:36,411 INFO ]: With dead ends: 12 [2018-06-26 18:11:36,411 INFO ]: Without dead ends: 12 [2018-06-26 18:11:36,412 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:11:36,412 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:11:36,414 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 18:11:36,414 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:11:36,414 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-06-26 18:11:36,414 INFO ]: Start accepts. Automaton has 10 states and 33 transitions. Word has length 6 [2018-06-26 18:11:36,415 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:36,415 INFO ]: Abstraction has 10 states and 33 transitions. [2018-06-26 18:11:36,415 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:11:36,415 INFO ]: Start isEmpty. Operand 10 states and 33 transitions. [2018-06-26 18:11:36,415 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:11:36,415 INFO ]: Found error trace [2018-06-26 18:11:36,415 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:11:36,415 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:36,415 INFO ]: Analyzing trace with hash 1481589775, now seen corresponding path program 1 times [2018-06-26 18:11:36,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:36,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:36,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:36,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:36,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:36,423 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:36,476 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:36,477 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:11:36,477 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:11:36,477 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:11:36,477 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:11:36,477 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:11:36,477 INFO ]: Start difference. First operand 10 states and 33 transitions. Second operand 3 states. [2018-06-26 18:11:36,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:36,499 INFO ]: Finished difference Result 8 states and 17 transitions. [2018-06-26 18:11:36,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:11:36,499 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:11:36,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:36,500 INFO ]: With dead ends: 8 [2018-06-26 18:11:36,500 INFO ]: Without dead ends: 8 [2018-06-26 18:11:36,500 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:11:36,500 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 18:11:36,501 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-26 18:11:36,501 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:11:36,501 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-06-26 18:11:36,501 INFO ]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 6 [2018-06-26 18:11:36,502 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:36,502 INFO ]: Abstraction has 7 states and 13 transitions. [2018-06-26 18:11:36,502 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:11:36,502 INFO ]: Start isEmpty. Operand 7 states and 13 transitions. [2018-06-26 18:11:36,502 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:11:36,502 INFO ]: Found error trace [2018-06-26 18:11:36,502 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:11:36,502 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:36,502 INFO ]: Analyzing trace with hash 1481650318, now seen corresponding path program 1 times [2018-06-26 18:11:36,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:36,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:36,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:36,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:36,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:36,513 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:36,581 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:36,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:36,581 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:36,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:36,618 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:36,627 INFO ]: Computing forward predicates... [2018-06-26 18:11:36,888 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:36,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:36,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 18:11:36,908 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:11:36,908 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:11:36,908 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:11:36,908 INFO ]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-06-26 18:11:37,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:37,104 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-26 18:11:37,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:11:37,105 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 18:11:37,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:37,105 INFO ]: With dead ends: 11 [2018-06-26 18:11:37,105 INFO ]: Without dead ends: 11 [2018-06-26 18:11:37,106 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:11:37,106 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:11:37,108 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 18:11:37,108 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:11:37,108 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-26 18:11:37,108 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 6 [2018-06-26 18:11:37,108 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:37,108 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-26 18:11:37,108 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:11:37,108 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-26 18:11:37,109 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:11:37,109 INFO ]: Found error trace [2018-06-26 18:11:37,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:11:37,109 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:37,109 INFO ]: Analyzing trace with hash 1481680109, now seen corresponding path program 1 times [2018-06-26 18:11:37,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:37,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:37,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:37,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:37,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:37,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:37,278 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:37,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:37,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:37,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:37,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:37,310 INFO ]: Computing forward predicates... [2018-06-26 18:11:37,337 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:37,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:37,357 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 18:11:37,357 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:11:37,357 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:11:37,357 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:11:37,357 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 5 states. [2018-06-26 18:11:37,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:37,546 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-26 18:11:37,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:11:37,546 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 18:11:37,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:37,546 INFO ]: With dead ends: 11 [2018-06-26 18:11:37,546 INFO ]: Without dead ends: 11 [2018-06-26 18:11:37,547 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:11:37,547 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:11:37,548 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 18:11:37,548 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:11:37,548 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-06-26 18:11:37,548 INFO ]: Start accepts. Automaton has 9 states and 21 transitions. Word has length 6 [2018-06-26 18:11:37,548 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:37,548 INFO ]: Abstraction has 9 states and 21 transitions. [2018-06-26 18:11:37,548 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:11:37,548 INFO ]: Start isEmpty. Operand 9 states and 21 transitions. [2018-06-26 18:11:37,549 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:11:37,549 INFO ]: Found error trace [2018-06-26 18:11:37,549 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:11:37,549 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:37,549 INFO ]: Analyzing trace with hash -1316694771, now seen corresponding path program 1 times [2018-06-26 18:11:37,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:37,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:37,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:37,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:37,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:37,561 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:37,607 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:37,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:37,607 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:37,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:37,640 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:37,641 INFO ]: Computing forward predicates... [2018-06-26 18:11:38,025 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:38,044 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:38,044 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-26 18:11:38,044 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:11:38,044 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:11:38,044 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:11:38,045 INFO ]: Start difference. First operand 9 states and 21 transitions. Second operand 7 states. [2018-06-26 18:11:38,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:38,149 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-26 18:11:38,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:11:38,149 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 18:11:38,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:38,150 INFO ]: With dead ends: 11 [2018-06-26 18:11:38,150 INFO ]: Without dead ends: 11 [2018-06-26 18:11:38,150 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:11:38,150 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:11:38,151 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:11:38,151 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:11:38,152 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2018-06-26 18:11:38,152 INFO ]: Start accepts. Automaton has 10 states and 25 transitions. Word has length 7 [2018-06-26 18:11:38,152 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:38,152 INFO ]: Abstraction has 10 states and 25 transitions. [2018-06-26 18:11:38,152 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:11:38,152 INFO ]: Start isEmpty. Operand 10 states and 25 transitions. [2018-06-26 18:11:38,152 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:11:38,152 INFO ]: Found error trace [2018-06-26 18:11:38,152 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:11:38,152 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:38,152 INFO ]: Analyzing trace with hash -1313000687, now seen corresponding path program 1 times [2018-06-26 18:11:38,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:38,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:38,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:38,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:38,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:38,167 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:38,200 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:38,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:38,200 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:38,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:38,220 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:38,222 INFO ]: Computing forward predicates... [2018-06-26 18:11:38,267 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:38,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:38,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:11:38,289 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:11:38,289 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:11:38,289 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:11:38,289 INFO ]: Start difference. First operand 10 states and 25 transitions. Second operand 8 states. [2018-06-26 18:11:38,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:38,402 INFO ]: Finished difference Result 19 states and 61 transitions. [2018-06-26 18:11:38,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:11:38,403 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:11:38,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:38,404 INFO ]: With dead ends: 19 [2018-06-26 18:11:38,404 INFO ]: Without dead ends: 19 [2018-06-26 18:11:38,404 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:11:38,404 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 18:11:38,407 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 11. [2018-06-26 18:11:38,407 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:11:38,407 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-06-26 18:11:38,407 INFO ]: Start accepts. Automaton has 11 states and 29 transitions. Word has length 7 [2018-06-26 18:11:38,407 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:38,407 INFO ]: Abstraction has 11 states and 29 transitions. [2018-06-26 18:11:38,407 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:11:38,407 INFO ]: Start isEmpty. Operand 11 states and 29 transitions. [2018-06-26 18:11:38,408 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:11:38,408 INFO ]: Found error trace [2018-06-26 18:11:38,408 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 18:11:38,408 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:38,408 INFO ]: Analyzing trace with hash -1312970896, now seen corresponding path program 2 times [2018-06-26 18:11:38,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:38,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:38,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:38,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:11:38,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:38,420 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:38,497 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:38,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:38,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:38,503 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:11:38,525 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:11:38,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:38,527 INFO ]: Computing forward predicates... [2018-06-26 18:11:38,604 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:38,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:38,623 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 18:11:38,623 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:11:38,624 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:11:38,624 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:11:38,624 INFO ]: Start difference. First operand 11 states and 29 transitions. Second operand 7 states. [2018-06-26 18:11:39,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:39,118 INFO ]: Finished difference Result 17 states and 53 transitions. [2018-06-26 18:11:39,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:11:39,118 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 18:11:39,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:39,119 INFO ]: With dead ends: 17 [2018-06-26 18:11:39,119 INFO ]: Without dead ends: 17 [2018-06-26 18:11:39,119 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:11:39,119 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:11:39,120 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-26 18:11:39,120 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:11:39,121 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2018-06-26 18:11:39,121 INFO ]: Start accepts. Automaton has 12 states and 33 transitions. Word has length 7 [2018-06-26 18:11:39,121 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:39,121 INFO ]: Abstraction has 12 states and 33 transitions. [2018-06-26 18:11:39,121 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:11:39,121 INFO ]: Start isEmpty. Operand 12 states and 33 transitions. [2018-06-26 18:11:39,121 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:11:39,121 INFO ]: Found error trace [2018-06-26 18:11:39,121 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:11:39,121 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:39,121 INFO ]: Analyzing trace with hash 2131691249, now seen corresponding path program 2 times [2018-06-26 18:11:39,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:39,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:39,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:39,122 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:11:39,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:39,134 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:39,236 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:39,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:39,236 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:39,245 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:11:39,274 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:11:39,274 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:39,275 INFO ]: Computing forward predicates... [2018-06-26 18:11:39,325 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:39,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:39,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-26 18:11:39,344 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:11:39,344 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:11:39,344 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:11:39,344 INFO ]: Start difference. First operand 12 states and 33 transitions. Second operand 9 states. [2018-06-26 18:11:39,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:39,787 INFO ]: Finished difference Result 24 states and 81 transitions. [2018-06-26 18:11:39,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:11:39,788 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-26 18:11:39,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:39,789 INFO ]: With dead ends: 24 [2018-06-26 18:11:39,789 INFO ]: Without dead ends: 24 [2018-06-26 18:11:39,789 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:11:39,789 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:11:39,791 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 13. [2018-06-26 18:11:39,791 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:11:39,791 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2018-06-26 18:11:39,791 INFO ]: Start accepts. Automaton has 13 states and 37 transitions. Word has length 8 [2018-06-26 18:11:39,791 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:39,791 INFO ]: Abstraction has 13 states and 37 transitions. [2018-06-26 18:11:39,791 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:11:39,791 INFO ]: Start isEmpty. Operand 13 states and 37 transitions. [2018-06-26 18:11:39,796 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:11:39,796 INFO ]: Found error trace [2018-06-26 18:11:39,796 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:11:39,796 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:39,796 INFO ]: Analyzing trace with hash -2047835922, now seen corresponding path program 2 times [2018-06-26 18:11:39,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:39,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:39,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:39,797 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:11:39,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:39,820 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:39,861 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:39,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:39,861 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:39,868 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:11:39,879 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:11:39,879 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:39,881 INFO ]: Computing forward predicates... [2018-06-26 18:11:40,019 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:40,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:40,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 18:11:40,040 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:11:40,040 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:11:40,040 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:11:40,040 INFO ]: Start difference. First operand 13 states and 37 transitions. Second operand 10 states. [2018-06-26 18:11:40,893 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2018-06-26 18:11:42,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:42,687 INFO ]: Finished difference Result 29 states and 101 transitions. [2018-06-26 18:11:42,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:11:42,688 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-26 18:11:42,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:42,689 INFO ]: With dead ends: 29 [2018-06-26 18:11:42,689 INFO ]: Without dead ends: 29 [2018-06-26 18:11:42,689 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:11:42,689 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:11:42,691 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 14. [2018-06-26 18:11:42,691 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:11:42,692 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2018-06-26 18:11:42,692 INFO ]: Start accepts. Automaton has 14 states and 41 transitions. Word has length 8 [2018-06-26 18:11:42,692 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:42,693 INFO ]: Abstraction has 14 states and 41 transitions. [2018-06-26 18:11:42,693 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:11:42,693 INFO ]: Start isEmpty. Operand 14 states and 41 transitions. [2018-06-26 18:11:42,693 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:11:42,693 INFO ]: Found error trace [2018-06-26 18:11:42,693 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:11:42,693 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:42,693 INFO ]: Analyzing trace with hash 1657475469, now seen corresponding path program 3 times [2018-06-26 18:11:42,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:42,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:42,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:42,694 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:11:42,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:42,708 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:42,789 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:42,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:42,790 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:42,796 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:11:42,828 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:11:42,828 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:42,829 INFO ]: Computing forward predicates... [2018-06-26 18:11:42,919 INFO ]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:42,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:42,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 18:11:42,938 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:11:42,938 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:11:42,938 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:11:42,938 INFO ]: Start difference. First operand 14 states and 41 transitions. Second operand 12 states. [2018-06-26 18:11:43,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:43,576 INFO ]: Finished difference Result 26 states and 89 transitions. [2018-06-26 18:11:43,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:11:43,577 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-26 18:11:43,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:43,578 INFO ]: With dead ends: 26 [2018-06-26 18:11:43,578 INFO ]: Without dead ends: 26 [2018-06-26 18:11:43,578 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:11:43,579 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:11:43,580 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-06-26 18:11:43,580 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:11:43,581 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2018-06-26 18:11:43,581 INFO ]: Start accepts. Automaton has 16 states and 49 transitions. Word has length 9 [2018-06-26 18:11:43,581 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:43,581 INFO ]: Abstraction has 16 states and 49 transitions. [2018-06-26 18:11:43,581 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:11:43,581 INFO ]: Start isEmpty. Operand 16 states and 49 transitions. [2018-06-26 18:11:43,581 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:11:43,581 INFO ]: Found error trace [2018-06-26 18:11:43,581 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-26 18:11:43,581 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:43,582 INFO ]: Analyzing trace with hash 941152048, now seen corresponding path program 3 times [2018-06-26 18:11:43,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:43,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:43,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:43,582 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:11:43,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:43,592 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:43,641 INFO ]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:11:43,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:43,641 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:43,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:11:43,662 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:11:43,662 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:43,663 INFO ]: Computing forward predicates... [2018-06-26 18:11:43,796 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:43,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:43,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-26 18:11:43,816 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:11:43,816 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:11:43,816 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:11:43,816 INFO ]: Start difference. First operand 16 states and 49 transitions. Second operand 10 states. [2018-06-26 18:11:44,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:44,077 INFO ]: Finished difference Result 81 states and 303 transitions. [2018-06-26 18:11:44,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:11:44,077 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-26 18:11:44,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:44,079 INFO ]: With dead ends: 81 [2018-06-26 18:11:44,079 INFO ]: Without dead ends: 81 [2018-06-26 18:11:44,079 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:11:44,079 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-26 18:11:44,092 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 32. [2018-06-26 18:11:44,092 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:11:44,093 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 116 transitions. [2018-06-26 18:11:44,093 INFO ]: Start accepts. Automaton has 32 states and 116 transitions. Word has length 9 [2018-06-26 18:11:44,093 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:44,093 INFO ]: Abstraction has 32 states and 116 transitions. [2018-06-26 18:11:44,093 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:11:44,093 INFO ]: Start isEmpty. Operand 32 states and 116 transitions. [2018-06-26 18:11:44,093 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:11:44,093 INFO ]: Found error trace [2018-06-26 18:11:44,093 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:11:44,093 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:44,094 INFO ]: Analyzing trace with hash 942075569, now seen corresponding path program 4 times [2018-06-26 18:11:44,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:44,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:44,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:44,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:11:44,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:44,105 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:44,146 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:44,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:44,146 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:44,157 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:11:44,198 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:11:44,198 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:44,199 INFO ]: Computing forward predicates... [2018-06-26 18:11:44,335 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:44,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:44,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 18:11:44,362 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:11:44,362 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:11:44,362 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:11:44,363 INFO ]: Start difference. First operand 32 states and 116 transitions. Second operand 12 states. [2018-06-26 18:11:53,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:11:53,697 INFO ]: Finished difference Result 86 states and 332 transitions. [2018-06-26 18:11:53,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:11:53,698 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-26 18:11:53,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:11:53,699 INFO ]: With dead ends: 86 [2018-06-26 18:11:53,699 INFO ]: Without dead ends: 86 [2018-06-26 18:11:53,699 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-06-26 18:11:53,699 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 18:11:53,703 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 32. [2018-06-26 18:11:53,704 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:11:53,704 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 116 transitions. [2018-06-26 18:11:53,704 INFO ]: Start accepts. Automaton has 32 states and 116 transitions. Word has length 9 [2018-06-26 18:11:53,704 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:11:53,705 INFO ]: Abstraction has 32 states and 116 transitions. [2018-06-26 18:11:53,705 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:11:53,705 INFO ]: Start isEmpty. Operand 32 states and 116 transitions. [2018-06-26 18:11:53,705 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:11:53,705 INFO ]: Found error trace [2018-06-26 18:11:53,705 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 18:11:53,705 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:11:53,705 INFO ]: Analyzing trace with hash 942105360, now seen corresponding path program 3 times [2018-06-26 18:11:53,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:11:53,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:11:53,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:53,706 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:11:53,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:11:53,727 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:53,801 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:53,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:11:53,801 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:11:53,807 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:11:53,821 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:11:53,821 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:11:53,823 INFO ]: Computing forward predicates... [2018-06-26 18:11:54,269 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:11:54,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:11:54,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-26 18:11:54,306 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:11:54,306 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:11:54,306 INFO ]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2018-06-26 18:11:54,306 INFO ]: Start difference. First operand 32 states and 116 transitions. Second operand 11 states. [2018-06-26 18:11:55,421 WARN ]: Spent 965.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-06-26 18:12:03,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:12:03,759 INFO ]: Finished difference Result 39 states and 144 transitions. [2018-06-26 18:12:03,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:12:03,761 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-26 18:12:03,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:12:03,762 INFO ]: With dead ends: 39 [2018-06-26 18:12:03,762 INFO ]: Without dead ends: 39 [2018-06-26 18:12:03,762 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=82, Invalid=189, Unknown=1, NotChecked=0, Total=272 [2018-06-26 18:12:03,762 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:12:03,767 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-06-26 18:12:03,767 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:12:03,768 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2018-06-26 18:12:03,768 INFO ]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 9 [2018-06-26 18:12:03,768 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:12:03,768 INFO ]: Abstraction has 34 states and 124 transitions. [2018-06-26 18:12:03,768 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:12:03,768 INFO ]: Start isEmpty. Operand 34 states and 124 transitions. [2018-06-26 18:12:03,768 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:12:03,768 INFO ]: Found error trace [2018-06-26 18:12:03,768 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:12:03,769 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:12:03,769 INFO ]: Analyzing trace with hash 730145170, now seen corresponding path program 1 times [2018-06-26 18:12:03,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:12:03,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:12:03,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:03,769 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:12:03,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:03,782 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:03,832 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:03,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:12:03,832 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:12:03,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:12:03,857 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:03,859 INFO ]: Computing forward predicates... [2018-06-26 18:12:04,200 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:04,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:12:04,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:12:04,219 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:12:04,219 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:12:04,219 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:12:04,219 INFO ]: Start difference. First operand 34 states and 124 transitions. Second operand 14 states. [2018-06-26 18:12:04,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:12:04,475 INFO ]: Finished difference Result 77 states and 296 transitions. [2018-06-26 18:12:04,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:12:04,475 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-26 18:12:04,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:12:04,476 INFO ]: With dead ends: 77 [2018-06-26 18:12:04,476 INFO ]: Without dead ends: 77 [2018-06-26 18:12:04,477 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:12:04,477 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-26 18:12:04,480 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 35. [2018-06-26 18:12:04,480 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:12:04,481 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 128 transitions. [2018-06-26 18:12:04,481 INFO ]: Start accepts. Automaton has 35 states and 128 transitions. Word has length 10 [2018-06-26 18:12:04,481 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:12:04,481 INFO ]: Abstraction has 35 states and 128 transitions. [2018-06-26 18:12:04,481 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:12:04,481 INFO ]: Start isEmpty. Operand 35 states and 128 transitions. [2018-06-26 18:12:04,482 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:12:04,482 INFO ]: Found error trace [2018-06-26 18:12:04,482 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:12:04,482 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:12:04,482 INFO ]: Analyzing trace with hash 757850800, now seen corresponding path program 2 times [2018-06-26 18:12:04,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:12:04,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:12:04,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:04,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:12:04,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:04,492 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:04,580 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:04,580 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:12:04,580 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:12:04,586 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:12:04,602 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:12:04,602 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:04,604 INFO ]: Computing forward predicates... [2018-06-26 18:12:04,749 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:04,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:12:04,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-26 18:12:04,768 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:12:04,768 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:12:04,769 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:12:04,769 INFO ]: Start difference. First operand 35 states and 128 transitions. Second operand 13 states. [2018-06-26 18:12:06,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:12:06,785 INFO ]: Finished difference Result 122 states and 476 transitions. [2018-06-26 18:12:06,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-26 18:12:06,785 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-26 18:12:06,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:12:06,786 INFO ]: With dead ends: 122 [2018-06-26 18:12:06,786 INFO ]: Without dead ends: 122 [2018-06-26 18:12:06,787 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=612, Invalid=1838, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 18:12:06,787 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-26 18:12:06,793 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 34. [2018-06-26 18:12:06,793 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:12:06,793 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2018-06-26 18:12:06,793 INFO ]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 10 [2018-06-26 18:12:06,794 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:12:06,794 INFO ]: Abstraction has 34 states and 124 transitions. [2018-06-26 18:12:06,794 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:12:06,794 INFO ]: Start isEmpty. Operand 34 states and 124 transitions. [2018-06-26 18:12:06,794 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:12:06,794 INFO ]: Found error trace [2018-06-26 18:12:06,794 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:12:06,794 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:12:06,794 INFO ]: Analyzing trace with hash -859948722, now seen corresponding path program 5 times [2018-06-26 18:12:06,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:12:06,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:12:06,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:06,795 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:12:06,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:06,807 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:07,136 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:07,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:12:07,136 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:12:07,142 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:12:07,159 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:12:07,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:07,160 INFO ]: Computing forward predicates... [2018-06-26 18:12:07,193 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:07,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:12:07,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:12:07,212 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:12:07,212 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:12:07,212 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:12:07,212 INFO ]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2018-06-26 18:12:07,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:12:07,397 INFO ]: Finished difference Result 75 states and 288 transitions. [2018-06-26 18:12:07,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:12:07,398 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 18:12:07,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:12:07,398 INFO ]: With dead ends: 75 [2018-06-26 18:12:07,398 INFO ]: Without dead ends: 75 [2018-06-26 18:12:07,399 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:12:07,399 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 18:12:07,402 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 34. [2018-06-26 18:12:07,402 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:12:07,402 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2018-06-26 18:12:07,402 INFO ]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 10 [2018-06-26 18:12:07,403 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:12:07,403 INFO ]: Abstraction has 34 states and 124 transitions. [2018-06-26 18:12:07,403 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:12:07,403 INFO ]: Start isEmpty. Operand 34 states and 124 transitions. [2018-06-26 18:12:07,403 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:12:07,403 INFO ]: Found error trace [2018-06-26 18:12:07,403 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:12:07,403 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:12:07,403 INFO ]: Analyzing trace with hash 1159219980, now seen corresponding path program 3 times [2018-06-26 18:12:07,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:12:07,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:12:07,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:07,404 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:12:07,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:07,413 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:07,495 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:07,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:12:07,495 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:12:07,502 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:12:07,521 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:12:07,521 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:07,522 INFO ]: Computing forward predicates... [2018-06-26 18:12:07,680 INFO ]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:07,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:12:07,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 18:12:07,700 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:12:07,700 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:12:07,700 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:12:07,700 INFO ]: Start difference. First operand 34 states and 124 transitions. Second operand 16 states. [2018-06-26 18:12:10,681 WARN ]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-26 18:12:13,085 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-06-26 18:12:14,135 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-06-26 18:12:15,564 WARN ]: Spent 558.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-06-26 18:12:15,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:12:15,641 INFO ]: Finished difference Result 157 states and 516 transitions. [2018-06-26 18:12:15,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 18:12:15,641 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-26 18:12:15,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:12:15,642 INFO ]: With dead ends: 157 [2018-06-26 18:12:15,642 INFO ]: Without dead ends: 157 [2018-06-26 18:12:15,643 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=329, Invalid=1470, Unknown=7, NotChecked=0, Total=1806 [2018-06-26 18:12:15,643 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-26 18:12:15,650 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 93. [2018-06-26 18:12:15,650 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-26 18:12:15,651 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 324 transitions. [2018-06-26 18:12:15,651 INFO ]: Start accepts. Automaton has 93 states and 324 transitions. Word has length 11 [2018-06-26 18:12:15,651 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:12:15,651 INFO ]: Abstraction has 93 states and 324 transitions. [2018-06-26 18:12:15,651 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:12:15,651 INFO ]: Start isEmpty. Operand 93 states and 324 transitions. [2018-06-26 18:12:15,652 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:12:15,652 INFO ]: Found error trace [2018-06-26 18:12:15,652 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:12:15,652 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:12:15,652 INFO ]: Analyzing trace with hash 1159249771, now seen corresponding path program 4 times [2018-06-26 18:12:15,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:12:15,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:12:15,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:15,653 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:12:15,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:15,661 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:15,800 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:15,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:12:15,800 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:12:15,816 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:12:15,834 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:12:15,834 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:12:15,836 INFO ]: Computing forward predicates... [2018-06-26 18:12:15,966 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:12:15,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:12:15,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 18:12:15,985 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:12:15,986 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:12:15,986 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:12:15,986 INFO ]: Start difference. First operand 93 states and 324 transitions. Second operand 16 states. [2018-06-26 18:12:16,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:12:16,277 INFO ]: Finished difference Result 178 states and 634 transitions. [2018-06-26 18:12:16,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:12:16,278 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-26 18:12:16,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:12:16,279 INFO ]: With dead ends: 178 [2018-06-26 18:12:16,279 INFO ]: Without dead ends: 178 [2018-06-26 18:12:16,280 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:12:16,280 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-26 18:12:16,376 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 95. [2018-06-26 18:12:16,376 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-26 18:12:16,382 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 332 transitions. [2018-06-26 18:12:16,382 INFO ]: Start accepts. Automaton has 95 states and 332 transitions. Word has length 11 [2018-06-26 18:12:16,383 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:12:16,383 INFO ]: Abstraction has 95 states and 332 transitions. [2018-06-26 18:12:16,383 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:12:16,383 INFO ]: Start isEmpty. Operand 95 states and 332 transitions. [2018-06-26 18:12:16,384 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:12:16,384 INFO ]: Found error trace [2018-06-26 18:12:16,384 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:12:16,384 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:12:16,384 INFO ]: Analyzing trace with hash 2018124301, now seen corresponding path program 5 times [2018-06-26 18:12:16,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:12:16,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:12:16,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:16,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:12:16,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:12:16,395 INFO ]: Conjunction of SSA is sat [2018-06-26 18:12:16,396 INFO ]: Counterexample might be feasible [2018-06-26 18:12:16,409 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:12:16,410 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:12:16 BasicIcfg [2018-06-26 18:12:16,410 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:12:16,411 INFO ]: Toolchain (without parser) took 41488.71 ms. Allocated memory was 309.3 MB in the beginning and 550.0 MB in the end (delta: 240.6 MB). Free memory was 263.6 MB in the beginning and 530.6 MB in the end (delta: -267.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:12:16,412 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:12:16,412 INFO ]: ChcToBoogie took 65.55 ms. Allocated memory is still 309.3 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:12:16,412 INFO ]: Boogie Preprocessor took 48.45 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:12:16,412 INFO ]: RCFGBuilder took 367.12 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 248.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:12:16,415 INFO ]: BlockEncodingV2 took 79.29 ms. Allocated memory is still 309.3 MB. Free memory was 248.7 MB in the beginning and 245.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:12:16,415 INFO ]: TraceAbstraction took 40921.50 ms. Allocated memory was 309.3 MB in the beginning and 550.0 MB in the end (delta: 240.6 MB). Free memory was 245.7 MB in the beginning and 530.6 MB in the end (delta: -284.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:12:16,418 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 23 edges - StatisticsResult: Encoded RCFG 8 locations, 19 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.55 ms. Allocated memory is still 309.3 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.45 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 367.12 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 248.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 79.29 ms. Allocated memory is still 309.3 MB. Free memory was 248.7 MB in the beginning and 245.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 40921.50 ms. Allocated memory was 309.3 MB in the beginning and 550.0 MB in the end (delta: 240.6 MB). Free memory was 245.7 MB in the beginning and 530.6 MB in the end (delta: -284.9 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] assume (-1 * hbv_False_3_Int == 0 && !(hbv_False_4_Int == hbv_False_5_Int)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] havoc hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -32 == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -31 == hbv_REC_f_f_3_Int) && hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 40.8s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 34.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 38 SDslu, 464 SDs, 0 SdLazy, 2047 SolverSat, 1244 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=19, 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 486 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 256 ConstructedInterpolants, 28 QuantifiedInterpolants, 13490 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 436 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 21/301 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-12-16-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-12-16-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-12-16-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-12-16-429.csv Received shutdown request...