java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.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/021-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:31:30,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:31:30,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:31:30,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:31:30,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:31:30,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:31:30,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:31:30,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:31:30,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:31:30,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:31:30,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:31:30,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:31:30,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:31:30,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:31:30,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:31:30,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:31:30,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:31:30,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:31:30,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:31:30,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:31:30,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:31:30,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:31:30,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:31:30,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:31:30,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:31:30,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:31:30,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:31:30,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:31:30,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:31:30,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:31:30,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:31:30,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:31:30,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:31:30,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:31:30,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:31:30,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:31:30,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:31:30,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:31:30,548 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:31:30,548 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:31:30,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:31:30,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:31:30,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:31:30,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:31:30,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:31:30,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:31:30,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:31:30,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:31:30,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:31:30,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:31:30,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:31:30,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:31:30,552 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:31:30,553 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:31:30,553 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:31:30,594 INFO ]: Repository-Root is: /tmp [2018-06-22 01:31:30,609 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:31:30,614 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:31:30,615 INFO ]: Initializing SmtParser... [2018-06-22 01:31:30,615 INFO ]: SmtParser initialized [2018-06-22 01:31:30,615 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 [2018-06-22 01:31:30,617 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:31:30,709 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 unknown [2018-06-22 01:31:30,924 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/021-horn.smt2 [2018-06-22 01:31:30,928 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:31:30,934 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:31:30,934 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:31:30,934 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:31:30,935 INFO ]: ChcToBoogie initialized [2018-06-22 01:31:30,938 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:30,993 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30 Unit [2018-06-22 01:31:30,993 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:31:30,994 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:31:30,994 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:31:30,994 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:31:31,016 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,016 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,021 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,021 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,028 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,031 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,032 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... [2018-06-22 01:31:31,034 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:31:31,034 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:31:31,034 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:31:31,034 INFO ]: RCFGBuilder initialized [2018-06-22 01:31:31,035 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:31:31,055 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:31:31,055 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:31:31,055 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:31:31,055 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:31:31,055 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:31:31,055 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:31:31,538 INFO ]: Using library mode [2018-06-22 01:31:31,538 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:31:31 BoogieIcfgContainer [2018-06-22 01:31:31,538 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:31:31,540 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:31:31,540 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:31:31,543 INFO ]: TraceAbstraction initialized [2018-06-22 01:31:31,543 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:31:30" (1/3) ... [2018-06-22 01:31:31,544 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b6b69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:31:31, skipping insertion in model container [2018-06-22 01:31:31,544 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:31:30" (2/3) ... [2018-06-22 01:31:31,545 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b6b69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:31:31, skipping insertion in model container [2018-06-22 01:31:31,545 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:31:31" (3/3) ... [2018-06-22 01:31:31,547 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:31:31,556 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:31:31,564 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:31:31,610 INFO ]: Using default assertion order modulation [2018-06-22 01:31:31,610 INFO ]: Interprodecural is true [2018-06-22 01:31:31,610 INFO ]: Hoare is false [2018-06-22 01:31:31,610 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:31:31,610 INFO ]: Backedges is TWOTRACK [2018-06-22 01:31:31,610 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:31:31,610 INFO ]: Difference is false [2018-06-22 01:31:31,611 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:31:31,611 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:31:31,629 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 01:31:31,645 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:31:31,645 INFO ]: Found error trace [2018-06-22 01:31:31,646 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:31,646 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:31,650 INFO ]: Analyzing trace with hash 18628553, now seen corresponding path program 1 times [2018-06-22 01:31:31,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:31,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:31,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:31,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:31,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:31,715 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:31,793 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:31,795 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:31:31,795 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:31:31,796 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:31:31,806 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:31:31,806 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:31:31,808 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-22 01:31:32,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:32,292 INFO ]: Finished difference Result 47 states and 73 transitions. [2018-06-22 01:31:32,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:31:32,293 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:31:32,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:32,303 INFO ]: With dead ends: 47 [2018-06-22 01:31:32,303 INFO ]: Without dead ends: 47 [2018-06-22 01:31:32,305 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:31:32,321 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:31:32,360 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-22 01:31:32,361 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:31:32,366 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-06-22 01:31:32,367 INFO ]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 7 [2018-06-22 01:31:32,368 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:32,368 INFO ]: Abstraction has 47 states and 73 transitions. [2018-06-22 01:31:32,368 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:31:32,372 INFO ]: Start isEmpty. Operand 47 states and 73 transitions. [2018-06-22 01:31:32,374 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:31:32,374 INFO ]: Found error trace [2018-06-22 01:31:32,375 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:32,375 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:32,375 INFO ]: Analyzing trace with hash 579073406, now seen corresponding path program 1 times [2018-06-22 01:31:32,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:32,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:32,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:32,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:32,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:32,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:32,433 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:32,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:31:32,433 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:31:32,434 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:31:32,435 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:31:32,435 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:31:32,435 INFO ]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-06-22 01:31:32,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:32,665 INFO ]: Finished difference Result 69 states and 108 transitions. [2018-06-22 01:31:32,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:31:32,665 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:31:32,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:32,668 INFO ]: With dead ends: 69 [2018-06-22 01:31:32,668 INFO ]: Without dead ends: 69 [2018-06-22 01:31:32,669 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:31:32,669 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:31:32,680 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-22 01:31:32,680 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:31:32,683 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2018-06-22 01:31:32,683 INFO ]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 8 [2018-06-22 01:31:32,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:32,684 INFO ]: Abstraction has 69 states and 108 transitions. [2018-06-22 01:31:32,684 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:31:32,684 INFO ]: Start isEmpty. Operand 69 states and 108 transitions. [2018-06-22 01:31:32,685 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:31:32,685 INFO ]: Found error trace [2018-06-22 01:31:32,686 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:32,686 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:32,686 INFO ]: Analyzing trace with hash 783391724, now seen corresponding path program 1 times [2018-06-22 01:31:32,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:32,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:32,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:32,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:32,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:32,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:32,738 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:32,738 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:31:32,738 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:31:32,738 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:31:32,738 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:31:32,738 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:31:32,738 INFO ]: Start difference. First operand 69 states and 108 transitions. Second operand 4 states. [2018-06-22 01:31:33,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:33,213 INFO ]: Finished difference Result 91 states and 143 transitions. [2018-06-22 01:31:33,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:31:33,214 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:31:33,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:33,217 INFO ]: With dead ends: 91 [2018-06-22 01:31:33,217 INFO ]: Without dead ends: 91 [2018-06-22 01:31:33,217 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:31:33,217 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:31:33,229 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-06-22 01:31:33,229 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 01:31:33,231 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2018-06-22 01:31:33,231 INFO ]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 9 [2018-06-22 01:31:33,231 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:33,231 INFO ]: Abstraction has 91 states and 143 transitions. [2018-06-22 01:31:33,231 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:31:33,232 INFO ]: Start isEmpty. Operand 91 states and 143 transitions. [2018-06-22 01:31:33,237 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:31:33,237 INFO ]: Found error trace [2018-06-22 01:31:33,237 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:33,237 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:33,237 INFO ]: Analyzing trace with hash 1575027805, now seen corresponding path program 1 times [2018-06-22 01:31:33,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:33,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:33,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:33,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:33,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:33,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:33,587 WARN ]: Spent 241.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-22 01:31:33,789 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 01:31:34,004 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-06-22 01:31:34,008 INFO ]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:31:34,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:34,008 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-22 01:31:34,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:34,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:34,048 INFO ]: Computing forward predicates... [2018-06-22 01:31:34,305 INFO ]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:31:34,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:34,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:31:34,331 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:31:34,331 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:31:34,331 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:31:34,331 INFO ]: Start difference. First operand 91 states and 143 transitions. Second operand 12 states. [2018-06-22 01:31:35,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:35,463 INFO ]: Finished difference Result 189 states and 428 transitions. [2018-06-22 01:31:35,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:31:35,474 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-22 01:31:35,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:35,482 INFO ]: With dead ends: 189 [2018-06-22 01:31:35,482 INFO ]: Without dead ends: 187 [2018-06-22 01:31:35,482 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:31:35,483 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-22 01:31:35,534 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 103. [2018-06-22 01:31:35,534 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:31:35,537 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2018-06-22 01:31:35,537 INFO ]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 18 [2018-06-22 01:31:35,537 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:35,537 INFO ]: Abstraction has 103 states and 171 transitions. [2018-06-22 01:31:35,537 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:31:35,537 INFO ]: Start isEmpty. Operand 103 states and 171 transitions. [2018-06-22 01:31:35,540 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:31:35,540 INFO ]: Found error trace [2018-06-22 01:31:35,540 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:35,540 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:35,541 INFO ]: Analyzing trace with hash -1929229825, now seen corresponding path program 1 times [2018-06-22 01:31:35,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:35,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:35,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:35,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:35,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:35,549 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:35,573 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:31:35,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:31:35,574 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:31:35,574 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:31:35,574 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:31:35,574 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:31:35,574 INFO ]: Start difference. First operand 103 states and 171 transitions. Second operand 4 states. [2018-06-22 01:31:35,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:35,790 INFO ]: Finished difference Result 129 states and 212 transitions. [2018-06-22 01:31:35,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:31:35,791 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-22 01:31:35,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:35,793 INFO ]: With dead ends: 129 [2018-06-22 01:31:35,793 INFO ]: Without dead ends: 103 [2018-06-22 01:31:35,793 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:31:35,793 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:31:35,812 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-22 01:31:35,812 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:31:35,814 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2018-06-22 01:31:35,814 INFO ]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 19 [2018-06-22 01:31:35,814 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:35,814 INFO ]: Abstraction has 103 states and 165 transitions. [2018-06-22 01:31:35,814 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:31:35,814 INFO ]: Start isEmpty. Operand 103 states and 165 transitions. [2018-06-22 01:31:35,817 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:31:35,817 INFO ]: Found error trace [2018-06-22 01:31:35,817 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:35,817 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:35,817 INFO ]: Analyzing trace with hash -1502332805, now seen corresponding path program 1 times [2018-06-22 01:31:35,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:35,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:35,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:35,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:35,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:35,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:35,924 INFO ]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:31:35,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:35,925 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-22 01:31:35,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:35,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:35,962 INFO ]: Computing forward predicates... [2018-06-22 01:31:36,038 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:31:36,063 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:31:36,063 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2018-06-22 01:31:36,064 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:31:36,064 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:31:36,064 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:31:36,064 INFO ]: Start difference. First operand 103 states and 165 transitions. Second operand 14 states. [2018-06-22 01:31:38,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:38,503 INFO ]: Finished difference Result 277 states and 774 transitions. [2018-06-22 01:31:38,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:31:38,503 INFO ]: Start accepts. Automaton has 14 states. Word has length 26 [2018-06-22 01:31:38,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:38,510 INFO ]: With dead ends: 277 [2018-06-22 01:31:38,510 INFO ]: Without dead ends: 253 [2018-06-22 01:31:38,511 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:31:38,511 INFO ]: Start minimizeSevpa. Operand 253 states. [2018-06-22 01:31:38,570 INFO ]: Finished minimizeSevpa. Reduced states from 253 to 135. [2018-06-22 01:31:38,570 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 01:31:38,574 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 254 transitions. [2018-06-22 01:31:38,574 INFO ]: Start accepts. Automaton has 135 states and 254 transitions. Word has length 26 [2018-06-22 01:31:38,575 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:38,575 INFO ]: Abstraction has 135 states and 254 transitions. [2018-06-22 01:31:38,575 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:31:38,575 INFO ]: Start isEmpty. Operand 135 states and 254 transitions. [2018-06-22 01:31:38,582 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:31:38,582 INFO ]: Found error trace [2018-06-22 01:31:38,582 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:38,582 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:38,582 INFO ]: Analyzing trace with hash 2107330171, now seen corresponding path program 2 times [2018-06-22 01:31:38,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:38,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:38,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:38,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:38,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:38,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:38,719 INFO ]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:31:38,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:38,720 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-22 01:31:38,727 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:31:38,749 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:31:38,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:38,751 INFO ]: Computing forward predicates... [2018-06-22 01:31:38,787 INFO ]: Checked inductivity of 15 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:31:38,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:38,811 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:31:38,812 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:31:38,812 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:31:38,812 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:31:38,812 INFO ]: Start difference. First operand 135 states and 254 transitions. Second operand 9 states. [2018-06-22 01:31:39,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:39,130 INFO ]: Finished difference Result 182 states and 414 transitions. [2018-06-22 01:31:39,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:31:39,134 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-22 01:31:39,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:39,137 INFO ]: With dead ends: 182 [2018-06-22 01:31:39,137 INFO ]: Without dead ends: 182 [2018-06-22 01:31:39,137 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:31:39,137 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 01:31:39,153 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 145. [2018-06-22 01:31:39,153 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 01:31:39,155 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 273 transitions. [2018-06-22 01:31:39,156 INFO ]: Start accepts. Automaton has 145 states and 273 transitions. Word has length 26 [2018-06-22 01:31:39,156 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:39,156 INFO ]: Abstraction has 145 states and 273 transitions. [2018-06-22 01:31:39,156 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:31:39,156 INFO ]: Start isEmpty. Operand 145 states and 273 transitions. [2018-06-22 01:31:39,158 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:31:39,158 INFO ]: Found error trace [2018-06-22 01:31:39,158 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:39,158 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:39,159 INFO ]: Analyzing trace with hash -1007135633, now seen corresponding path program 1 times [2018-06-22 01:31:39,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:39,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:39,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:39,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:31:39,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:39,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:39,305 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:31:39,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:39,305 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-22 01:31:39,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:39,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:39,329 INFO ]: Computing forward predicates... [2018-06-22 01:31:39,558 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:31:39,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:39,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 01:31:39,577 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:31:39,578 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:31:39,578 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:31:39,578 INFO ]: Start difference. First operand 145 states and 273 transitions. Second operand 20 states. [2018-06-22 01:31:44,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:44,824 INFO ]: Finished difference Result 409 states and 1560 transitions. [2018-06-22 01:31:44,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-06-22 01:31:44,824 INFO ]: Start accepts. Automaton has 20 states. Word has length 27 [2018-06-22 01:31:44,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:44,834 INFO ]: With dead ends: 409 [2018-06-22 01:31:44,834 INFO ]: Without dead ends: 395 [2018-06-22 01:31:44,836 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2653 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1053, Invalid=6957, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 01:31:44,837 INFO ]: Start minimizeSevpa. Operand 395 states. [2018-06-22 01:31:44,902 INFO ]: Finished minimizeSevpa. Reduced states from 395 to 188. [2018-06-22 01:31:44,902 INFO ]: Start removeUnreachable. Operand 188 states. [2018-06-22 01:31:44,907 INFO ]: Finished removeUnreachable. Reduced from 188 states to 188 states and 385 transitions. [2018-06-22 01:31:44,907 INFO ]: Start accepts. Automaton has 188 states and 385 transitions. Word has length 27 [2018-06-22 01:31:44,907 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:44,907 INFO ]: Abstraction has 188 states and 385 transitions. [2018-06-22 01:31:44,907 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:31:44,907 INFO ]: Start isEmpty. Operand 188 states and 385 transitions. [2018-06-22 01:31:44,910 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:31:44,910 INFO ]: Found error trace [2018-06-22 01:31:44,910 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:44,910 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:44,910 INFO ]: Analyzing trace with hash -1327385507, now seen corresponding path program 2 times [2018-06-22 01:31:44,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:44,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:44,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:44,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:44,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:44,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:45,184 INFO ]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:31:45,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:45,185 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-22 01:31:45,192 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:31:45,207 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:31:45,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:45,210 INFO ]: Computing forward predicates... [2018-06-22 01:31:45,481 INFO ]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:31:45,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:45,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 01:31:45,513 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:31:45,513 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:31:45,513 INFO ]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:31:45,513 INFO ]: Start difference. First operand 188 states and 385 transitions. Second operand 22 states. [2018-06-22 01:31:47,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:47,244 INFO ]: Finished difference Result 285 states and 784 transitions. [2018-06-22 01:31:47,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:31:47,244 INFO ]: Start accepts. Automaton has 22 states. Word has length 27 [2018-06-22 01:31:47,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:47,251 INFO ]: With dead ends: 285 [2018-06-22 01:31:47,251 INFO ]: Without dead ends: 285 [2018-06-22 01:31:47,251 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:31:47,251 INFO ]: Start minimizeSevpa. Operand 285 states. [2018-06-22 01:31:47,273 INFO ]: Finished minimizeSevpa. Reduced states from 285 to 222. [2018-06-22 01:31:47,273 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-22 01:31:47,279 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 504 transitions. [2018-06-22 01:31:47,279 INFO ]: Start accepts. Automaton has 222 states and 504 transitions. Word has length 27 [2018-06-22 01:31:47,280 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:47,280 INFO ]: Abstraction has 222 states and 504 transitions. [2018-06-22 01:31:47,280 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:31:47,280 INFO ]: Start isEmpty. Operand 222 states and 504 transitions. [2018-06-22 01:31:47,283 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:31:47,283 INFO ]: Found error trace [2018-06-22 01:31:47,283 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:47,283 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:47,284 INFO ]: Analyzing trace with hash -1001380740, now seen corresponding path program 1 times [2018-06-22 01:31:47,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:47,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:47,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:47,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:31:47,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:47,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:47,396 INFO ]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:31:47,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:47,396 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-22 01:31:47,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:47,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:47,417 INFO ]: Computing forward predicates... [2018-06-22 01:31:47,473 INFO ]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:31:47,492 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:31:47,492 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2018-06-22 01:31:47,492 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:31:47,492 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:31:47,492 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:31:47,493 INFO ]: Start difference. First operand 222 states and 504 transitions. Second operand 14 states. [2018-06-22 01:31:48,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:48,700 INFO ]: Finished difference Result 349 states and 990 transitions. [2018-06-22 01:31:48,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:31:48,700 INFO ]: Start accepts. Automaton has 14 states. Word has length 28 [2018-06-22 01:31:48,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:48,706 INFO ]: With dead ends: 349 [2018-06-22 01:31:48,706 INFO ]: Without dead ends: 349 [2018-06-22 01:31:48,707 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:31:48,707 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-22 01:31:48,734 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 234. [2018-06-22 01:31:48,734 INFO ]: Start removeUnreachable. Operand 234 states. [2018-06-22 01:31:48,737 INFO ]: Finished removeUnreachable. Reduced from 234 states to 234 states and 562 transitions. [2018-06-22 01:31:48,737 INFO ]: Start accepts. Automaton has 234 states and 562 transitions. Word has length 28 [2018-06-22 01:31:48,738 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:48,738 INFO ]: Abstraction has 234 states and 562 transitions. [2018-06-22 01:31:48,738 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:31:48,738 INFO ]: Start isEmpty. Operand 234 states and 562 transitions. [2018-06-22 01:31:48,741 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:31:48,741 INFO ]: Found error trace [2018-06-22 01:31:48,741 INFO ]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:48,741 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:48,742 INFO ]: Analyzing trace with hash -2129292589, now seen corresponding path program 1 times [2018-06-22 01:31:48,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:48,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:48,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:48,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:48,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:48,761 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:49,363 INFO ]: Checked inductivity of 64 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 01:31:49,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:49,363 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-22 01:31:49,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:49,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:49,410 INFO ]: Computing forward predicates... [2018-06-22 01:31:49,610 INFO ]: Checked inductivity of 64 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:31:49,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:49,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-22 01:31:49,630 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:31:49,630 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:31:49,630 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:31:49,630 INFO ]: Start difference. First operand 234 states and 562 transitions. Second operand 18 states. [2018-06-22 01:31:50,907 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 01:31:52,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:52,508 INFO ]: Finished difference Result 464 states and 1441 transitions. [2018-06-22 01:31:52,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 01:31:52,508 INFO ]: Start accepts. Automaton has 18 states. Word has length 44 [2018-06-22 01:31:52,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:52,518 INFO ]: With dead ends: 464 [2018-06-22 01:31:52,518 INFO ]: Without dead ends: 438 [2018-06-22 01:31:52,519 INFO ]: 0 DeclaredPredicates, 129 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=605, Invalid=4087, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:31:52,519 INFO ]: Start minimizeSevpa. Operand 438 states. [2018-06-22 01:31:52,557 INFO ]: Finished minimizeSevpa. Reduced states from 438 to 280. [2018-06-22 01:31:52,557 INFO ]: Start removeUnreachable. Operand 280 states. [2018-06-22 01:31:52,562 INFO ]: Finished removeUnreachable. Reduced from 280 states to 280 states and 633 transitions. [2018-06-22 01:31:52,562 INFO ]: Start accepts. Automaton has 280 states and 633 transitions. Word has length 44 [2018-06-22 01:31:52,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:52,562 INFO ]: Abstraction has 280 states and 633 transitions. [2018-06-22 01:31:52,562 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:31:52,562 INFO ]: Start isEmpty. Operand 280 states and 633 transitions. [2018-06-22 01:31:52,568 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:31:52,568 INFO ]: Found error trace [2018-06-22 01:31:52,568 INFO ]: trace histogram [5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:52,568 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:52,568 INFO ]: Analyzing trace with hash -704200992, now seen corresponding path program 1 times [2018-06-22 01:31:52,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:52,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:52,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:52,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:52,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:52,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:52,716 INFO ]: Checked inductivity of 55 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:31:52,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:52,716 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-22 01:31:52,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:52,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:52,765 INFO ]: Computing forward predicates... [2018-06-22 01:31:52,858 INFO ]: Checked inductivity of 55 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:31:52,878 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:52,878 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-22 01:31:52,878 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:31:52,878 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:31:52,878 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:31:52,878 INFO ]: Start difference. First operand 280 states and 633 transitions. Second operand 18 states. [2018-06-22 01:31:54,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:54,662 INFO ]: Finished difference Result 475 states and 1277 transitions. [2018-06-22 01:31:54,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:31:54,662 INFO ]: Start accepts. Automaton has 18 states. Word has length 43 [2018-06-22 01:31:54,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:54,670 INFO ]: With dead ends: 475 [2018-06-22 01:31:54,670 INFO ]: Without dead ends: 475 [2018-06-22 01:31:54,671 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=2344, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:31:54,671 INFO ]: Start minimizeSevpa. Operand 475 states. [2018-06-22 01:31:54,706 INFO ]: Finished minimizeSevpa. Reduced states from 475 to 358. [2018-06-22 01:31:54,706 INFO ]: Start removeUnreachable. Operand 358 states. [2018-06-22 01:31:54,711 INFO ]: Finished removeUnreachable. Reduced from 358 states to 358 states and 806 transitions. [2018-06-22 01:31:54,712 INFO ]: Start accepts. Automaton has 358 states and 806 transitions. Word has length 43 [2018-06-22 01:31:54,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:54,712 INFO ]: Abstraction has 358 states and 806 transitions. [2018-06-22 01:31:54,712 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:31:54,712 INFO ]: Start isEmpty. Operand 358 states and 806 transitions. [2018-06-22 01:31:54,719 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:31:54,719 INFO ]: Found error trace [2018-06-22 01:31:54,719 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:54,719 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:54,719 INFO ]: Analyzing trace with hash 1429100683, now seen corresponding path program 3 times [2018-06-22 01:31:54,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:54,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:54,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:54,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:54,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:54,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:55,142 INFO ]: Checked inductivity of 47 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:31:55,143 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:55,143 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-22 01:31:55,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:31:55,188 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:31:55,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:55,190 INFO ]: Computing forward predicates... [2018-06-22 01:31:55,265 INFO ]: Checked inductivity of 47 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:31:55,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:55,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-22 01:31:55,291 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:31:55,291 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:31:55,292 INFO ]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:31:55,292 INFO ]: Start difference. First operand 358 states and 806 transitions. Second operand 19 states. [2018-06-22 01:31:57,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:57,729 INFO ]: Finished difference Result 573 states and 1659 transitions. [2018-06-22 01:31:57,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:31:57,729 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-22 01:31:57,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:57,738 INFO ]: With dead ends: 573 [2018-06-22 01:31:57,738 INFO ]: Without dead ends: 573 [2018-06-22 01:31:57,739 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:31:57,739 INFO ]: Start minimizeSevpa. Operand 573 states. [2018-06-22 01:31:57,778 INFO ]: Finished minimizeSevpa. Reduced states from 573 to 366. [2018-06-22 01:31:57,778 INFO ]: Start removeUnreachable. Operand 366 states. [2018-06-22 01:31:57,788 INFO ]: Finished removeUnreachable. Reduced from 366 states to 366 states and 834 transitions. [2018-06-22 01:31:57,788 INFO ]: Start accepts. Automaton has 366 states and 834 transitions. Word has length 36 [2018-06-22 01:31:57,788 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:57,788 INFO ]: Abstraction has 366 states and 834 transitions. [2018-06-22 01:31:57,788 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:31:57,788 INFO ]: Start isEmpty. Operand 366 states and 834 transitions. [2018-06-22 01:31:57,802 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 01:31:57,802 INFO ]: Found error trace [2018-06-22 01:31:57,802 INFO ]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:57,802 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:57,803 INFO ]: Analyzing trace with hash -1786308827, now seen corresponding path program 1 times [2018-06-22 01:31:57,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:57,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:57,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:57,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:31:57,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:57,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:57,885 INFO ]: Checked inductivity of 100 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:31:57,885 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:57,885 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-22 01:31:57,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:57,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:57,918 INFO ]: Computing forward predicates... [2018-06-22 01:31:58,049 INFO ]: Checked inductivity of 100 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 01:31:58,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:58,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 14] total 16 [2018-06-22 01:31:58,068 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:31:58,068 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:31:58,068 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:31:58,068 INFO ]: Start difference. First operand 366 states and 834 transitions. Second operand 16 states. [2018-06-22 01:31:59,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:59,689 INFO ]: Finished difference Result 500 states and 1226 transitions. [2018-06-22 01:31:59,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:31:59,691 INFO ]: Start accepts. Automaton has 16 states. Word has length 55 [2018-06-22 01:31:59,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:59,696 INFO ]: With dead ends: 500 [2018-06-22 01:31:59,696 INFO ]: Without dead ends: 477 [2018-06-22 01:31:59,697 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1667, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:31:59,697 INFO ]: Start minimizeSevpa. Operand 477 states. [2018-06-22 01:31:59,723 INFO ]: Finished minimizeSevpa. Reduced states from 477 to 373. [2018-06-22 01:31:59,723 INFO ]: Start removeUnreachable. Operand 373 states. [2018-06-22 01:31:59,727 INFO ]: Finished removeUnreachable. Reduced from 373 states to 373 states and 770 transitions. [2018-06-22 01:31:59,727 INFO ]: Start accepts. Automaton has 373 states and 770 transitions. Word has length 55 [2018-06-22 01:31:59,728 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:59,728 INFO ]: Abstraction has 373 states and 770 transitions. [2018-06-22 01:31:59,728 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:31:59,728 INFO ]: Start isEmpty. Operand 373 states and 770 transitions. [2018-06-22 01:31:59,735 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:31:59,736 INFO ]: Found error trace [2018-06-22 01:31:59,736 INFO ]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:59,736 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:59,736 INFO ]: Analyzing trace with hash -1213099972, now seen corresponding path program 1 times [2018-06-22 01:31:59,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:59,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:59,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:59,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:59,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:59,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:59,920 INFO ]: Checked inductivity of 69 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 01:31:59,920 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:59,920 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) [2018-06-22 01:31:59,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:31:59,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:59,973 INFO ]: Computing forward predicates... [2018-06-22 01:32:00,386 INFO ]: Checked inductivity of 69 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 01:32:00,409 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:00,409 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-06-22 01:32:00,409 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:32:00,409 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:32:00,409 INFO ]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:32:00,409 INFO ]: Start difference. First operand 373 states and 770 transitions. Second operand 23 states. [2018-06-22 01:32:02,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:02,963 INFO ]: Finished difference Result 654 states and 1808 transitions. [2018-06-22 01:32:02,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:32:02,963 INFO ]: Start accepts. Automaton has 23 states. Word has length 46 [2018-06-22 01:32:02,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:02,976 INFO ]: With dead ends: 654 [2018-06-22 01:32:02,976 INFO ]: Without dead ends: 654 [2018-06-22 01:32:02,981 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=490, Invalid=3670, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:32:02,981 INFO ]: Start minimizeSevpa. Operand 654 states. [2018-06-22 01:32:03,023 INFO ]: Finished minimizeSevpa. Reduced states from 654 to 431. [2018-06-22 01:32:03,023 INFO ]: Start removeUnreachable. Operand 431 states. [2018-06-22 01:32:03,028 INFO ]: Finished removeUnreachable. Reduced from 431 states to 431 states and 847 transitions. [2018-06-22 01:32:03,028 INFO ]: Start accepts. Automaton has 431 states and 847 transitions. Word has length 46 [2018-06-22 01:32:03,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:03,028 INFO ]: Abstraction has 431 states and 847 transitions. [2018-06-22 01:32:03,028 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:32:03,028 INFO ]: Start isEmpty. Operand 431 states and 847 transitions. [2018-06-22 01:32:03,040 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:32:03,040 INFO ]: Found error trace [2018-06-22 01:32:03,040 INFO ]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:03,040 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:03,040 INFO ]: Analyzing trace with hash -50800595, now seen corresponding path program 2 times [2018-06-22 01:32:03,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:03,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:03,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:03,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:03,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:03,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:03,875 INFO ]: Checked inductivity of 64 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 01:32:03,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:03,876 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-22 01:32:03,881 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:32:03,902 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:32:03,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:03,905 INFO ]: Computing forward predicates... [2018-06-22 01:32:04,057 INFO ]: Checked inductivity of 64 backedges. 38 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 01:32:04,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:04,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 26 [2018-06-22 01:32:04,076 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:32:04,076 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:32:04,077 INFO ]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:32:04,077 INFO ]: Start difference. First operand 431 states and 847 transitions. Second operand 26 states. [2018-06-22 01:32:06,173 WARN ]: Spent 303.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-06-22 01:32:08,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:08,053 INFO ]: Finished difference Result 728 states and 1802 transitions. [2018-06-22 01:32:08,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-06-22 01:32:08,085 INFO ]: Start accepts. Automaton has 26 states. Word has length 44 [2018-06-22 01:32:08,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:08,095 INFO ]: With dead ends: 728 [2018-06-22 01:32:08,095 INFO ]: Without dead ends: 728 [2018-06-22 01:32:08,097 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=817, Invalid=7925, Unknown=0, NotChecked=0, Total=8742 [2018-06-22 01:32:08,098 INFO ]: Start minimizeSevpa. Operand 728 states. [2018-06-22 01:32:08,139 INFO ]: Finished minimizeSevpa. Reduced states from 728 to 455. [2018-06-22 01:32:08,139 INFO ]: Start removeUnreachable. Operand 455 states. [2018-06-22 01:32:08,148 INFO ]: Finished removeUnreachable. Reduced from 455 states to 455 states and 930 transitions. [2018-06-22 01:32:08,148 INFO ]: Start accepts. Automaton has 455 states and 930 transitions. Word has length 44 [2018-06-22 01:32:08,148 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:08,148 INFO ]: Abstraction has 455 states and 930 transitions. [2018-06-22 01:32:08,148 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:32:08,148 INFO ]: Start isEmpty. Operand 455 states and 930 transitions. [2018-06-22 01:32:08,160 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:32:08,161 INFO ]: Found error trace [2018-06-22 01:32:08,161 INFO ]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:08,161 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:08,161 INFO ]: Analyzing trace with hash -257911639, now seen corresponding path program 3 times [2018-06-22 01:32:08,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:08,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:08,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:08,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:32:08,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:08,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:08,988 INFO ]: Checked inductivity of 64 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:32:08,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:08,988 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-22 01:32:08,994 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:32:09,027 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:32:09,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:09,030 INFO ]: Computing forward predicates... [2018-06-22 01:32:09,193 INFO ]: Checked inductivity of 64 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 01:32:09,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:09,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-22 01:32:09,213 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:32:09,213 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:32:09,213 INFO ]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:32:09,213 INFO ]: Start difference. First operand 455 states and 930 transitions. Second operand 25 states. [2018-06-22 01:32:12,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:12,516 INFO ]: Finished difference Result 776 states and 2071 transitions. [2018-06-22 01:32:12,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 01:32:12,516 INFO ]: Start accepts. Automaton has 25 states. Word has length 44 [2018-06-22 01:32:12,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:12,525 INFO ]: With dead ends: 776 [2018-06-22 01:32:12,525 INFO ]: Without dead ends: 776 [2018-06-22 01:32:12,527 INFO ]: 0 DeclaredPredicates, 129 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=555, Invalid=4847, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:32:12,527 INFO ]: Start minimizeSevpa. Operand 776 states. [2018-06-22 01:32:12,572 INFO ]: Finished minimizeSevpa. Reduced states from 776 to 547. [2018-06-22 01:32:12,572 INFO ]: Start removeUnreachable. Operand 547 states. [2018-06-22 01:32:12,579 INFO ]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1146 transitions. [2018-06-22 01:32:12,579 INFO ]: Start accepts. Automaton has 547 states and 1146 transitions. Word has length 44 [2018-06-22 01:32:12,579 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:12,579 INFO ]: Abstraction has 547 states and 1146 transitions. [2018-06-22 01:32:12,579 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:32:12,579 INFO ]: Start isEmpty. Operand 547 states and 1146 transitions. [2018-06-22 01:32:12,592 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:32:12,592 INFO ]: Found error trace [2018-06-22 01:32:12,592 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:12,592 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:12,592 INFO ]: Analyzing trace with hash -1635437585, now seen corresponding path program 4 times [2018-06-22 01:32:12,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:12,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:12,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:12,593 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:32:12,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:12,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:13,130 INFO ]: Checked inductivity of 84 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:32:13,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:13,152 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-22 01:32:13,157 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:32:13,180 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:32:13,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:13,182 INFO ]: Computing forward predicates... [2018-06-22 01:32:13,437 INFO ]: Checked inductivity of 84 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:32:13,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:13,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-22 01:32:13,457 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:32:13,458 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:32:13,458 INFO ]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:32:13,458 INFO ]: Start difference. First operand 547 states and 1146 transitions. Second operand 32 states. [2018-06-22 01:32:24,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:24,425 INFO ]: Finished difference Result 1431 states and 4953 transitions. [2018-06-22 01:32:24,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-06-22 01:32:24,425 INFO ]: Start accepts. Automaton has 32 states. Word has length 45 [2018-06-22 01:32:24,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:24,463 INFO ]: With dead ends: 1431 [2018-06-22 01:32:24,463 INFO ]: Without dead ends: 1431 [2018-06-22 01:32:24,470 INFO ]: 0 DeclaredPredicates, 307 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30137 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5470, Invalid=68786, Unknown=0, NotChecked=0, Total=74256 [2018-06-22 01:32:24,470 INFO ]: Start minimizeSevpa. Operand 1431 states. [2018-06-22 01:32:24,591 INFO ]: Finished minimizeSevpa. Reduced states from 1431 to 696. [2018-06-22 01:32:24,592 INFO ]: Start removeUnreachable. Operand 696 states. [2018-06-22 01:32:24,602 INFO ]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1681 transitions. [2018-06-22 01:32:24,602 INFO ]: Start accepts. Automaton has 696 states and 1681 transitions. Word has length 45 [2018-06-22 01:32:24,602 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:24,602 INFO ]: Abstraction has 696 states and 1681 transitions. [2018-06-22 01:32:24,602 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:32:24,602 INFO ]: Start isEmpty. Operand 696 states and 1681 transitions. [2018-06-22 01:32:24,621 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-22 01:32:24,621 INFO ]: Found error trace [2018-06-22 01:32:24,621 INFO ]: trace histogram [8, 8, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:24,621 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:24,621 INFO ]: Analyzing trace with hash -524094422, now seen corresponding path program 2 times [2018-06-22 01:32:24,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:24,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:24,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:24,623 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:32:24,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:24,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:24,923 INFO ]: Checked inductivity of 169 backedges. 52 proven. 13 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-22 01:32:24,923 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:24,923 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-22 01:32:24,930 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:32:24,963 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:32:24,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:24,966 INFO ]: Computing forward predicates... [2018-06-22 01:32:25,080 INFO ]: Checked inductivity of 169 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 01:32:25,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:25,105 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 01:32:25,105 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:32:25,105 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:32:25,106 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:32:25,106 INFO ]: Start difference. First operand 696 states and 1681 transitions. Second operand 15 states. [2018-06-22 01:32:26,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:26,109 INFO ]: Finished difference Result 792 states and 2046 transitions. [2018-06-22 01:32:26,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:32:26,109 INFO ]: Start accepts. Automaton has 15 states. Word has length 68 [2018-06-22 01:32:26,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:26,119 INFO ]: With dead ends: 792 [2018-06-22 01:32:26,120 INFO ]: Without dead ends: 792 [2018-06-22 01:32:26,120 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:32:26,120 INFO ]: Start minimizeSevpa. Operand 792 states. [2018-06-22 01:32:26,157 INFO ]: Finished minimizeSevpa. Reduced states from 792 to 703. [2018-06-22 01:32:26,158 INFO ]: Start removeUnreachable. Operand 703 states. [2018-06-22 01:32:26,168 INFO ]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1726 transitions. [2018-06-22 01:32:26,168 INFO ]: Start accepts. Automaton has 703 states and 1726 transitions. Word has length 68 [2018-06-22 01:32:26,168 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:26,168 INFO ]: Abstraction has 703 states and 1726 transitions. [2018-06-22 01:32:26,168 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:32:26,168 INFO ]: Start isEmpty. Operand 703 states and 1726 transitions. [2018-06-22 01:32:26,183 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 01:32:26,183 INFO ]: Found error trace [2018-06-22 01:32:26,183 INFO ]: trace histogram [6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:26,183 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:26,183 INFO ]: Analyzing trace with hash 2055054097, now seen corresponding path program 1 times [2018-06-22 01:32:26,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:26,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:26,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:26,184 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:32:26,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:26,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:26,325 INFO ]: Checked inductivity of 80 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 01:32:26,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:26,325 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-22 01:32:26,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:26,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:26,355 INFO ]: Computing forward predicates... [2018-06-22 01:32:26,443 INFO ]: Checked inductivity of 80 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 01:32:26,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:26,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2018-06-22 01:32:26,463 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:32:26,463 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:32:26,463 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:32:26,463 INFO ]: Start difference. First operand 703 states and 1726 transitions. Second operand 21 states. [2018-06-22 01:32:28,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:28,048 INFO ]: Finished difference Result 867 states and 2494 transitions. [2018-06-22 01:32:28,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:32:28,048 INFO ]: Start accepts. Automaton has 21 states. Word has length 53 [2018-06-22 01:32:28,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:28,066 INFO ]: With dead ends: 867 [2018-06-22 01:32:28,066 INFO ]: Without dead ends: 867 [2018-06-22 01:32:28,067 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=2460, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:32:28,067 INFO ]: Start minimizeSevpa. Operand 867 states. [2018-06-22 01:32:28,118 INFO ]: Finished minimizeSevpa. Reduced states from 867 to 783. [2018-06-22 01:32:28,118 INFO ]: Start removeUnreachable. Operand 783 states. [2018-06-22 01:32:28,133 INFO ]: Finished removeUnreachable. Reduced from 783 states to 783 states and 2080 transitions. [2018-06-22 01:32:28,133 INFO ]: Start accepts. Automaton has 783 states and 2080 transitions. Word has length 53 [2018-06-22 01:32:28,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:28,133 INFO ]: Abstraction has 783 states and 2080 transitions. [2018-06-22 01:32:28,133 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:32:28,133 INFO ]: Start isEmpty. Operand 783 states and 2080 transitions. [2018-06-22 01:32:28,210 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 01:32:28,210 INFO ]: Found error trace [2018-06-22 01:32:28,210 INFO ]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:28,210 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:28,211 INFO ]: Analyzing trace with hash 161614740, now seen corresponding path program 1 times [2018-06-22 01:32:28,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:28,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:28,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:28,211 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:28,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:28,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:28,927 INFO ]: Checked inductivity of 86 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 01:32:28,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:28,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:28,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:28,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:28,955 INFO ]: Computing forward predicates... [2018-06-22 01:32:29,161 INFO ]: Checked inductivity of 86 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 01:32:29,179 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:29,180 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-06-22 01:32:29,180 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:32:29,180 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:32:29,180 INFO ]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:32:29,180 INFO ]: Start difference. First operand 783 states and 2080 transitions. Second operand 23 states. [2018-06-22 01:32:30,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:30,728 INFO ]: Finished difference Result 934 states and 2676 transitions. [2018-06-22 01:32:30,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:32:30,728 INFO ]: Start accepts. Automaton has 23 states. Word has length 55 [2018-06-22 01:32:30,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:30,744 INFO ]: With dead ends: 934 [2018-06-22 01:32:30,744 INFO ]: Without dead ends: 934 [2018-06-22 01:32:30,745 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:32:30,745 INFO ]: Start minimizeSevpa. Operand 934 states. [2018-06-22 01:32:30,798 INFO ]: Finished minimizeSevpa. Reduced states from 934 to 783. [2018-06-22 01:32:30,798 INFO ]: Start removeUnreachable. Operand 783 states. [2018-06-22 01:32:30,813 INFO ]: Finished removeUnreachable. Reduced from 783 states to 783 states and 2080 transitions. [2018-06-22 01:32:30,813 INFO ]: Start accepts. Automaton has 783 states and 2080 transitions. Word has length 55 [2018-06-22 01:32:30,813 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:30,813 INFO ]: Abstraction has 783 states and 2080 transitions. [2018-06-22 01:32:30,813 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:32:30,813 INFO ]: Start isEmpty. Operand 783 states and 2080 transitions. [2018-06-22 01:32:30,834 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-22 01:32:30,834 INFO ]: Found error trace [2018-06-22 01:32:30,834 INFO ]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:30,834 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:30,834 INFO ]: Analyzing trace with hash -1234900725, now seen corresponding path program 5 times [2018-06-22 01:32:30,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:30,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:30,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:30,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:31,250 INFO ]: Checked inductivity of 132 backedges. 15 proven. 54 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 01:32:31,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:31,251 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:31,311 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... [2018-06-22 01:32:31,344 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:32:31,344 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:31,346 INFO ]: Computing forward predicates... [2018-06-22 01:32:31,356 INFO ]: Timeout while computing interpolants [2018-06-22 01:32:31,556 WARN ]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:31,556 WARN ]: Verification canceled [2018-06-22 01:32:31,560 WARN ]: Timeout [2018-06-22 01:32:31,560 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:31 BoogieIcfgContainer [2018-06-22 01:32:31,560 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:32:31,561 INFO ]: Toolchain (without parser) took 60631.80 ms. Allocated memory was 307.2 MB in the beginning and 803.7 MB in the end (delta: 496.5 MB). Free memory was 261.8 MB in the beginning and 684.5 MB in the end (delta: -422.8 MB). Peak memory consumption was 73.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:31,561 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:32:31,561 INFO ]: ChcToBoogie took 58.89 ms. Allocated memory is still 307.2 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:31,562 INFO ]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 307.2 MB. Free memory was 259.8 MB in the beginning and 257.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:31,562 INFO ]: RCFGBuilder took 504.26 ms. Allocated memory is still 307.2 MB. Free memory was 257.8 MB in the beginning and 245.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:31,562 INFO ]: TraceAbstraction took 60020.03 ms. Allocated memory was 307.2 MB in the beginning and 803.7 MB in the end (delta: 496.5 MB). Free memory was 245.8 MB in the beginning and 684.5 MB in the end (delta: -438.7 MB). Peak memory consumption was 57.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:31,565 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.89 ms. Allocated memory is still 307.2 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 307.2 MB. Free memory was 259.8 MB in the beginning and 257.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 504.26 ms. Allocated memory is still 307.2 MB. Free memory was 257.8 MB in the beginning and 245.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60020.03 ms. Allocated memory was 307.2 MB in the beginning and 803.7 MB in the end (delta: 496.5 MB). Free memory was 245.8 MB in the beginning and 684.5 MB in the end (delta: -438.7 MB). Peak memory consumption was 57.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. TIMEOUT Result, 59.9s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 47.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1857 SDtfs, 3231 SDslu, 14254 SDs, 0 SdLazy, 50313 SolverSat, 5474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1828 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 1085 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42847 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=783occurred in iteration=20, 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.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 2994 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1413 NumberOfCodeBlocks, 1404 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 145340 SizeOfPredicates, 192 NumberOfNonLiveVariables, 3005 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 1624/1962 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/021-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-32-31-578.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/021-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-32-31-578.csv Completed graceful shutdown