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/020b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:30:14,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:30:14,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:30:14,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:30:14,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:30:14,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:30:14,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:30:14,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:30:14,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:30:14,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:30:14,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:30:14,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:30:14,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:30:14,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:30:14,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:30:14,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:30:14,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:30:14,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:30:14,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:30:14,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:30:14,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:30:14,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:30:14,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:30:14,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:30:14,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:30:14,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:30:14,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:30:14,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:30:14,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:30:14,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:30:14,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:30:14,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:30:14,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:30:14,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:30:14,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:30:14,658 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:30:14,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:30:14,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:30:14,672 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:30:14,672 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:30:14,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:30:14,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:30:14,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:30:14,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:30:14,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:30:14,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:30:14,674 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:30:14,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:30:14,675 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:30:14,675 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:30:14,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:30:14,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:30:14,676 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:30:14,677 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:30:14,677 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:30:14,711 INFO ]: Repository-Root is: /tmp [2018-06-22 01:30:14,729 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:30:14,735 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:30:14,736 INFO ]: Initializing SmtParser... [2018-06-22 01:30:14,737 INFO ]: SmtParser initialized [2018-06-22 01:30:14,738 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/020b-horn.smt2 [2018-06-22 01:30:14,739 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:30:14,832 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/020b-horn.smt2 unknown [2018-06-22 01:30:14,997 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/020b-horn.smt2 [2018-06-22 01:30:15,008 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:30:15,013 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:30:15,014 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:30:15,014 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:30:15,014 INFO ]: ChcToBoogie initialized [2018-06-22 01:30:15,022 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,077 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15 Unit [2018-06-22 01:30:15,077 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:30:15,078 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:30:15,078 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:30:15,078 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:30:15,100 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,101 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,110 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,110 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,114 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,115 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,116 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (1/1) ... [2018-06-22 01:30:15,125 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:30:15,125 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:30:15,125 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:30:15,125 INFO ]: RCFGBuilder initialized [2018-06-22 01:30:15,126 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (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:30:15,147 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:30:15,147 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:30:15,147 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:30:15,147 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:30:15,147 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:30:15,147 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:30:15,401 INFO ]: Using library mode [2018-06-22 01:30:15,402 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:30:15 BoogieIcfgContainer [2018-06-22 01:30:15,402 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:30:15,403 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:30:15,403 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:30:15,409 INFO ]: TraceAbstraction initialized [2018-06-22 01:30:15,409 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:30:15" (1/3) ... [2018-06-22 01:30:15,410 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767f4b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:30:15, skipping insertion in model container [2018-06-22 01:30:15,410 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:30:15" (2/3) ... [2018-06-22 01:30:15,410 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767f4b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:30:15, skipping insertion in model container [2018-06-22 01:30:15,410 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:30:15" (3/3) ... [2018-06-22 01:30:15,413 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:30:15,423 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:30:15,431 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:30:15,471 INFO ]: Using default assertion order modulation [2018-06-22 01:30:15,472 INFO ]: Interprodecural is true [2018-06-22 01:30:15,472 INFO ]: Hoare is false [2018-06-22 01:30:15,472 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:30:15,472 INFO ]: Backedges is TWOTRACK [2018-06-22 01:30:15,472 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:30:15,472 INFO ]: Difference is false [2018-06-22 01:30:15,472 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:30:15,472 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:30:15,485 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:30:15,495 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:30:15,495 INFO ]: Found error trace [2018-06-22 01:30:15,496 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:15,497 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:15,500 INFO ]: Analyzing trace with hash -204902306, now seen corresponding path program 1 times [2018-06-22 01:30:15,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:15,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:15,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:15,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:15,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:15,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:15,683 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:30:15,685 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:30:15,685 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:30:15,686 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:30:15,696 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:30:15,697 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:30:15,698 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:30:15,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:15,749 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 01:30:15,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:30:15,751 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:30:15,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:15,758 INFO ]: With dead ends: 9 [2018-06-22 01:30:15,758 INFO ]: Without dead ends: 9 [2018-06-22 01:30:15,760 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:30:15,776 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:30:15,804 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:30:15,805 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:30:15,806 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:30:15,807 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 01:30:15,807 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:15,807 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:30:15,807 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:30:15,807 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:30:15,807 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:30:15,807 INFO ]: Found error trace [2018-06-22 01:30:15,808 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:15,808 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:15,808 INFO ]: Analyzing trace with hash -2054566951, now seen corresponding path program 1 times [2018-06-22 01:30:15,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:15,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:15,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:15,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:15,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:15,823 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:15,961 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:15,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:30:15,962 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:30:15,963 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:30:15,963 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:30:15,963 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:30:15,963 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-22 01:30:16,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:16,101 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-22 01:30:16,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:30:16,102 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:30:16,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:16,103 INFO ]: With dead ends: 10 [2018-06-22 01:30:16,103 INFO ]: Without dead ends: 10 [2018-06-22 01:30:16,104 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:30:16,104 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:30:16,105 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:30:16,105 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:30:16,105 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 01:30:16,105 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 01:30:16,106 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:16,106 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 01:30:16,106 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:30:16,106 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 01:30:16,106 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:30:16,106 INFO ]: Found error trace [2018-06-22 01:30:16,106 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:16,106 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:16,106 INFO ]: Analyzing trace with hash -2050872867, now seen corresponding path program 1 times [2018-06-22 01:30:16,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:16,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:16,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:16,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:16,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:16,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:16,229 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:16,229 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:30:16,229 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:30:16,229 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:30:16,229 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:30:16,229 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:30:16,230 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2018-06-22 01:30:16,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:16,349 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-22 01:30:16,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:30:16,349 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:30:16,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:16,350 INFO ]: With dead ends: 12 [2018-06-22 01:30:16,350 INFO ]: Without dead ends: 12 [2018-06-22 01:30:16,350 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:30:16,350 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:30:16,351 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-22 01:30:16,351 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:30:16,352 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:30:16,352 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 8 [2018-06-22 01:30:16,352 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:16,352 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:30:16,352 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:30:16,352 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:30:16,352 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:30:16,352 INFO ]: Found error trace [2018-06-22 01:30:16,352 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:16,352 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:16,353 INFO ]: Analyzing trace with hash -2049025825, now seen corresponding path program 1 times [2018-06-22 01:30:16,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:16,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:16,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:16,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:16,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:16,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:16,415 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:16,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:16,415 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:30:16,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:16,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:16,475 INFO ]: Computing forward predicates... [2018-06-22 01:30:16,653 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:16,685 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:16,685 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:30:16,685 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:30:16,685 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:30:16,685 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:30:16,685 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2018-06-22 01:30:16,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:16,941 INFO ]: Finished difference Result 14 states and 26 transitions. [2018-06-22 01:30:16,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:30:16,941 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:30:16,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:16,942 INFO ]: With dead ends: 14 [2018-06-22 01:30:16,942 INFO ]: Without dead ends: 14 [2018-06-22 01:30:16,942 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:30:16,942 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:30:16,944 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:30:16,944 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:30:16,944 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-22 01:30:16,945 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-22 01:30:16,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:16,945 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-22 01:30:16,945 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:30:16,945 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-22 01:30:16,945 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:30:16,945 INFO ]: Found error trace [2018-06-22 01:30:16,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:16,945 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:16,945 INFO ]: Analyzing trace with hash 855428928, now seen corresponding path program 1 times [2018-06-22 01:30:16,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:16,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:16,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:16,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:16,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:16,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:17,085 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:30:17,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:17,085 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:30:17,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:17,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:17,131 INFO ]: Computing forward predicates... [2018-06-22 01:30:17,212 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:30:17,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:17,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:30:17,244 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:30:17,244 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:30:17,244 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:30:17,245 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. [2018-06-22 01:30:17,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:17,303 INFO ]: Finished difference Result 14 states and 26 transitions. [2018-06-22 01:30:17,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:30:17,304 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:30:17,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:17,304 INFO ]: With dead ends: 14 [2018-06-22 01:30:17,304 INFO ]: Without dead ends: 14 [2018-06-22 01:30:17,305 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:30:17,305 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:30:17,306 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:30:17,306 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:30:17,307 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-06-22 01:30:17,307 INFO ]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 9 [2018-06-22 01:30:17,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:17,307 INFO ]: Abstraction has 14 states and 26 transitions. [2018-06-22 01:30:17,307 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:30:17,307 INFO ]: Start isEmpty. Operand 14 states and 26 transitions. [2018-06-22 01:30:17,308 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:30:17,308 INFO ]: Found error trace [2018-06-22 01:30:17,308 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:17,308 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:17,308 INFO ]: Analyzing trace with hash 699213055, now seen corresponding path program 2 times [2018-06-22 01:30:17,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:17,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:17,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:17,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:17,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:17,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:17,419 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:17,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:17,419 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:30:17,442 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:30:17,480 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:30:17,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:17,482 INFO ]: Computing forward predicates... [2018-06-22 01:30:17,546 INFO ]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:17,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:17,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:30:17,565 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:30:17,565 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:30:17,565 INFO ]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:30:17,566 INFO ]: Start difference. First operand 14 states and 26 transitions. Second operand 8 states. [2018-06-22 01:30:17,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:17,892 INFO ]: Finished difference Result 23 states and 39 transitions. [2018-06-22 01:30:17,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:30:17,894 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:30:17,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:17,894 INFO ]: With dead ends: 23 [2018-06-22 01:30:17,894 INFO ]: Without dead ends: 23 [2018-06-22 01:30:17,895 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:30:17,895 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:30:17,897 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-22 01:30:17,897 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:30:17,898 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-22 01:30:17,898 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 10 [2018-06-22 01:30:17,900 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:17,900 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-22 01:30:17,900 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:30:17,900 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-22 01:30:17,900 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:30:17,900 INFO ]: Found error trace [2018-06-22 01:30:17,900 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:17,900 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:17,901 INFO ]: Analyzing trace with hash 756471357, now seen corresponding path program 3 times [2018-06-22 01:30:17,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:17,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:17,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:17,902 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:17,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:17,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:18,057 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:18,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:18,057 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:30:18,070 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:30:18,129 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:30:18,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:18,132 INFO ]: Computing forward predicates... [2018-06-22 01:30:18,309 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:18,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:18,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 01:30:18,332 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:30:18,332 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:30:18,333 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:30:18,333 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 8 states. [2018-06-22 01:30:18,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:18,551 INFO ]: Finished difference Result 26 states and 40 transitions. [2018-06-22 01:30:18,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:30:18,551 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:30:18,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:18,552 INFO ]: With dead ends: 26 [2018-06-22 01:30:18,552 INFO ]: Without dead ends: 26 [2018-06-22 01:30:18,552 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:30:18,552 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:30:18,555 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-22 01:30:18,555 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:30:18,555 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-06-22 01:30:18,555 INFO ]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 10 [2018-06-22 01:30:18,556 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:18,556 INFO ]: Abstraction has 21 states and 33 transitions. [2018-06-22 01:30:18,556 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:30:18,556 INFO ]: Start isEmpty. Operand 21 states and 33 transitions. [2018-06-22 01:30:18,556 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:30:18,556 INFO ]: Found error trace [2018-06-22 01:30:18,556 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:18,556 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:18,556 INFO ]: Analyzing trace with hash 208746590, now seen corresponding path program 4 times [2018-06-22 01:30:18,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:18,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:18,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:18,557 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:18,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:18,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:18,683 INFO ]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:30:18,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:18,684 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:30:18,691 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:30:18,732 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:30:18,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:18,734 INFO ]: Computing forward predicates... [2018-06-22 01:30:18,873 INFO ]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:30:18,893 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:18,893 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:30:18,893 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:30:18,893 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:30:18,893 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:30:18,893 INFO ]: Start difference. First operand 21 states and 33 transitions. Second operand 5 states. [2018-06-22 01:30:18,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:18,957 INFO ]: Finished difference Result 32 states and 54 transitions. [2018-06-22 01:30:18,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:30:18,957 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:30:18,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:18,958 INFO ]: With dead ends: 32 [2018-06-22 01:30:18,958 INFO ]: Without dead ends: 32 [2018-06-22 01:30:18,958 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:30:18,958 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:30:18,961 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-06-22 01:30:18,961 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:30:18,961 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-06-22 01:30:18,961 INFO ]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 11 [2018-06-22 01:30:18,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:18,961 INFO ]: Abstraction has 20 states and 31 transitions. [2018-06-22 01:30:18,961 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:30:18,961 INFO ]: Start isEmpty. Operand 20 states and 31 transitions. [2018-06-22 01:30:18,962 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:30:18,962 INFO ]: Found error trace [2018-06-22 01:30:18,962 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:18,962 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:18,962 INFO ]: Analyzing trace with hash -2110811937, now seen corresponding path program 5 times [2018-06-22 01:30:18,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:18,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:18,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:18,963 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:18,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:18,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:19,099 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:19,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:19,099 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:30:19,112 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:30:19,184 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:30:19,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:19,186 INFO ]: Computing forward predicates... [2018-06-22 01:30:19,538 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:19,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:19,557 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 01:30:19,557 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:30:19,557 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:30:19,558 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:30:19,558 INFO ]: Start difference. First operand 20 states and 31 transitions. Second operand 11 states. [2018-06-22 01:30:20,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:20,052 INFO ]: Finished difference Result 41 states and 60 transitions. [2018-06-22 01:30:20,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:30:20,052 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-22 01:30:20,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:20,053 INFO ]: With dead ends: 41 [2018-06-22 01:30:20,053 INFO ]: Without dead ends: 41 [2018-06-22 01:30:20,053 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:30:20,053 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:30:20,056 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 23. [2018-06-22 01:30:20,056 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:30:20,057 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-06-22 01:30:20,057 INFO ]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 12 [2018-06-22 01:30:20,057 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:20,057 INFO ]: Abstraction has 23 states and 35 transitions. [2018-06-22 01:30:20,057 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:30:20,057 INFO ]: Start isEmpty. Operand 23 states and 35 transitions. [2018-06-22 01:30:20,058 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:30:20,058 INFO ]: Found error trace [2018-06-22 01:30:20,058 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:20,058 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:20,058 INFO ]: Analyzing trace with hash -193335616, now seen corresponding path program 6 times [2018-06-22 01:30:20,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:20,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:20,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:20,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:20,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:20,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:20,156 INFO ]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:30:20,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:20,156 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:30:20,164 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:30:20,225 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:30:20,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:20,228 INFO ]: Computing forward predicates... [2018-06-22 01:30:20,296 INFO ]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:30:20,326 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:20,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:30:20,326 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:30:20,326 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:30:20,326 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:30:20,326 INFO ]: Start difference. First operand 23 states and 35 transitions. Second operand 6 states. [2018-06-22 01:30:20,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:20,363 INFO ]: Finished difference Result 41 states and 68 transitions. [2018-06-22 01:30:20,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:30:20,363 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 01:30:20,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:20,364 INFO ]: With dead ends: 41 [2018-06-22 01:30:20,364 INFO ]: Without dead ends: 41 [2018-06-22 01:30:20,364 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:30:20,364 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:30:20,367 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-22 01:30:20,368 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:30:20,368 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2018-06-22 01:30:20,368 INFO ]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 13 [2018-06-22 01:30:20,369 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:20,369 INFO ]: Abstraction has 33 states and 55 transitions. [2018-06-22 01:30:20,369 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:30:20,369 INFO ]: Start isEmpty. Operand 33 states and 55 transitions. [2018-06-22 01:30:20,369 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:30:20,369 INFO ]: Found error trace [2018-06-22 01:30:20,369 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:20,369 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:20,369 INFO ]: Analyzing trace with hash -881111809, now seen corresponding path program 7 times [2018-06-22 01:30:20,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:20,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:20,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:20,370 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:20,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:20,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:20,478 INFO ]: Checked inductivity of 28 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:30:20,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:20,478 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:30:20,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:20,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:20,539 INFO ]: Computing forward predicates... [2018-06-22 01:30:20,710 INFO ]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:20,729 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:20,729 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 01:30:20,730 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:30:20,730 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:30:20,730 INFO ]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:30:20,730 INFO ]: Start difference. First operand 33 states and 55 transitions. Second operand 14 states. [2018-06-22 01:30:21,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:21,343 INFO ]: Finished difference Result 83 states and 148 transitions. [2018-06-22 01:30:21,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:30:21,344 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-22 01:30:21,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:21,345 INFO ]: With dead ends: 83 [2018-06-22 01:30:21,345 INFO ]: Without dead ends: 83 [2018-06-22 01:30:21,345 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=460, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:30:21,346 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 01:30:21,350 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 36. [2018-06-22 01:30:21,350 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:30:21,351 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2018-06-22 01:30:21,351 INFO ]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 14 [2018-06-22 01:30:21,351 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:21,351 INFO ]: Abstraction has 36 states and 61 transitions. [2018-06-22 01:30:21,351 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:30:21,351 INFO ]: Start isEmpty. Operand 36 states and 61 transitions. [2018-06-22 01:30:21,351 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:30:21,351 INFO ]: Found error trace [2018-06-22 01:30:21,352 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:21,352 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:21,352 INFO ]: Analyzing trace with hash -1690458435, now seen corresponding path program 8 times [2018-06-22 01:30:21,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:21,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:21,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:21,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:21,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:21,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:21,486 INFO ]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:21,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:21,486 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:30:21,492 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:30:21,525 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:30:21,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:21,528 INFO ]: Computing forward predicates... [2018-06-22 01:30:21,726 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:21,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:21,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 01:30:21,758 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:30:21,758 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:30:21,758 INFO ]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:30:21,758 INFO ]: Start difference. First operand 36 states and 61 transitions. Second operand 14 states. [2018-06-22 01:30:22,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:22,549 INFO ]: Finished difference Result 75 states and 108 transitions. [2018-06-22 01:30:22,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:30:22,549 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-22 01:30:22,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:22,550 INFO ]: With dead ends: 75 [2018-06-22 01:30:22,550 INFO ]: Without dead ends: 75 [2018-06-22 01:30:22,551 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=1079, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:30:22,551 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 01:30:22,554 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 38. [2018-06-22 01:30:22,554 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:30:22,555 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-06-22 01:30:22,555 INFO ]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 14 [2018-06-22 01:30:22,555 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:22,555 INFO ]: Abstraction has 38 states and 63 transitions. [2018-06-22 01:30:22,555 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:30:22,555 INFO ]: Start isEmpty. Operand 38 states and 63 transitions. [2018-06-22 01:30:22,556 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:30:22,556 INFO ]: Found error trace [2018-06-22 01:30:22,556 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:22,556 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:22,556 INFO ]: Analyzing trace with hash -1536683938, now seen corresponding path program 9 times [2018-06-22 01:30:22,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:22,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:22,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:22,556 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:22,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:22,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:22,746 INFO ]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:30:22,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:22,747 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:30:22,753 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:30:22,784 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:30:22,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:22,787 INFO ]: Computing forward predicates... [2018-06-22 01:30:22,814 INFO ]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:30:22,835 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:22,835 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:30:22,835 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:30:22,835 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:30:22,835 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:30:22,835 INFO ]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-06-22 01:30:22,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:22,886 INFO ]: Finished difference Result 68 states and 117 transitions. [2018-06-22 01:30:22,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:30:22,886 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-22 01:30:22,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:22,887 INFO ]: With dead ends: 68 [2018-06-22 01:30:22,887 INFO ]: Without dead ends: 68 [2018-06-22 01:30:22,887 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 11 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:30:22,887 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:30:22,891 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 39. [2018-06-22 01:30:22,891 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:30:22,892 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2018-06-22 01:30:22,892 INFO ]: Start accepts. Automaton has 39 states and 65 transitions. Word has length 15 [2018-06-22 01:30:22,892 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:22,892 INFO ]: Abstraction has 39 states and 65 transitions. [2018-06-22 01:30:22,892 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:30:22,892 INFO ]: Start isEmpty. Operand 39 states and 65 transitions. [2018-06-22 01:30:22,892 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:30:22,892 INFO ]: Found error trace [2018-06-22 01:30:22,892 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:22,892 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:22,893 INFO ]: Analyzing trace with hash -384583457, now seen corresponding path program 10 times [2018-06-22 01:30:22,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:22,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:22,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:22,893 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:22,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:22,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:23,075 INFO ]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:23,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:23,076 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:23,081 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:30:23,110 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:30:23,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:23,113 INFO ]: Computing forward predicates... [2018-06-22 01:30:23,546 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:23,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:23,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-22 01:30:23,565 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:30:23,565 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:30:23,566 INFO ]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:30:23,566 INFO ]: Start difference. First operand 39 states and 65 transitions. Second operand 17 states. [2018-06-22 01:30:23,967 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2018-06-22 01:30:24,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:24,773 INFO ]: Finished difference Result 99 states and 135 transitions. [2018-06-22 01:30:24,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 01:30:24,773 INFO ]: Start accepts. Automaton has 17 states. Word has length 16 [2018-06-22 01:30:24,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:24,774 INFO ]: With dead ends: 99 [2018-06-22 01:30:24,774 INFO ]: Without dead ends: 99 [2018-06-22 01:30:24,775 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=936, Invalid=2256, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:30:24,775 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 01:30:24,779 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 42. [2018-06-22 01:30:24,779 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:30:24,780 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. [2018-06-22 01:30:24,780 INFO ]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 16 [2018-06-22 01:30:24,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:24,780 INFO ]: Abstraction has 42 states and 69 transitions. [2018-06-22 01:30:24,780 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:30:24,780 INFO ]: Start isEmpty. Operand 42 states and 69 transitions. [2018-06-22 01:30:24,780 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:30:24,780 INFO ]: Found error trace [2018-06-22 01:30:24,780 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:24,781 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:24,781 INFO ]: Analyzing trace with hash 1363820096, now seen corresponding path program 11 times [2018-06-22 01:30:24,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:24,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:24,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:24,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:24,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:24,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:25,263 INFO ]: Checked inductivity of 55 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:30:25,263 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:25,263 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:30:25,270 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:30:25,321 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:30:25,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:25,324 INFO ]: Computing forward predicates... [2018-06-22 01:30:25,413 INFO ]: Checked inductivity of 55 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:30:25,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:25,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:30:25,433 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:30:25,433 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:30:25,433 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:30:25,434 INFO ]: Start difference. First operand 42 states and 69 transitions. Second operand 8 states. [2018-06-22 01:30:25,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:25,501 INFO ]: Finished difference Result 90 states and 155 transitions. [2018-06-22 01:30:25,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:30:25,501 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 01:30:25,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:25,502 INFO ]: With dead ends: 90 [2018-06-22 01:30:25,502 INFO ]: Without dead ends: 90 [2018-06-22 01:30:25,502 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:30:25,502 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 01:30:25,505 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 38. [2018-06-22 01:30:25,505 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:30:25,506 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2018-06-22 01:30:25,506 INFO ]: Start accepts. Automaton has 38 states and 61 transitions. Word has length 17 [2018-06-22 01:30:25,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:25,506 INFO ]: Abstraction has 38 states and 61 transitions. [2018-06-22 01:30:25,506 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:30:25,506 INFO ]: Start isEmpty. Operand 38 states and 61 transitions. [2018-06-22 01:30:25,507 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:30:25,507 INFO ]: Found error trace [2018-06-22 01:30:25,507 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:25,507 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:25,507 INFO ]: Analyzing trace with hash -663271619, now seen corresponding path program 12 times [2018-06-22 01:30:25,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:25,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:25,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:25,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:25,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:25,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:25,627 INFO ]: Checked inductivity of 66 backedges. 10 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:25,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:25,628 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:30:25,633 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:30:25,673 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:30:25,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:25,676 INFO ]: Computing forward predicates... [2018-06-22 01:30:25,965 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:25,994 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:25,995 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 01:30:25,995 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:30:25,995 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:30:25,995 INFO ]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:30:25,995 INFO ]: Start difference. First operand 38 states and 61 transitions. Second operand 20 states. [2018-06-22 01:30:27,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:27,918 INFO ]: Finished difference Result 122 states and 162 transitions. [2018-06-22 01:30:27,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-22 01:30:27,919 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-22 01:30:27,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:27,919 INFO ]: With dead ends: 122 [2018-06-22 01:30:27,919 INFO ]: Without dead ends: 122 [2018-06-22 01:30:27,920 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1650, Invalid=4202, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 01:30:27,920 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 01:30:27,926 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 41. [2018-06-22 01:30:27,926 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:30:27,927 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2018-06-22 01:30:27,927 INFO ]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 18 [2018-06-22 01:30:27,927 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:27,927 INFO ]: Abstraction has 41 states and 65 transitions. [2018-06-22 01:30:27,927 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:30:27,927 INFO ]: Start isEmpty. Operand 41 states and 65 transitions. [2018-06-22 01:30:27,927 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:30:27,927 INFO ]: Found error trace [2018-06-22 01:30:27,927 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:27,928 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:27,928 INFO ]: Analyzing trace with hash 220330078, now seen corresponding path program 13 times [2018-06-22 01:30:27,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:27,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:27,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:27,928 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:27,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:27,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:28,113 INFO ]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:30:28,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:28,202 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:30:28,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:28,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:28,265 INFO ]: Computing forward predicates... [2018-06-22 01:30:28,398 INFO ]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:30:28,421 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:28,421 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:30:28,421 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:30:28,421 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:30:28,421 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:30:28,421 INFO ]: Start difference. First operand 41 states and 65 transitions. Second operand 9 states. [2018-06-22 01:30:28,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:28,514 INFO ]: Finished difference Result 108 states and 184 transitions. [2018-06-22 01:30:28,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:30:28,514 INFO ]: Start accepts. Automaton has 9 states. Word has length 19 [2018-06-22 01:30:28,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:28,515 INFO ]: With dead ends: 108 [2018-06-22 01:30:28,515 INFO ]: Without dead ends: 108 [2018-06-22 01:30:28,515 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 18 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:30:28,515 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 01:30:28,520 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 91. [2018-06-22 01:30:28,520 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 01:30:28,521 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 165 transitions. [2018-06-22 01:30:28,521 INFO ]: Start accepts. Automaton has 91 states and 165 transitions. Word has length 19 [2018-06-22 01:30:28,521 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:28,521 INFO ]: Abstraction has 91 states and 165 transitions. [2018-06-22 01:30:28,521 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:30:28,521 INFO ]: Start isEmpty. Operand 91 states and 165 transitions. [2018-06-22 01:30:28,522 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:30:28,522 INFO ]: Found error trace [2018-06-22 01:30:28,522 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:28,522 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:28,522 INFO ]: Analyzing trace with hash 1842178909, now seen corresponding path program 14 times [2018-06-22 01:30:28,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:28,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:28,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:28,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:28,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:28,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:29,269 INFO ]: Checked inductivity of 91 backedges. 49 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:30:29,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:29,270 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:30:29,276 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:30:29,320 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:30:29,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:29,323 INFO ]: Computing forward predicates... [2018-06-22 01:30:29,582 INFO ]: Checked inductivity of 91 backedges. 70 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:29,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:29,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 23 [2018-06-22 01:30:29,601 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:30:29,601 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:30:29,602 INFO ]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:30:29,602 INFO ]: Start difference. First operand 91 states and 165 transitions. Second operand 23 states. [2018-06-22 01:30:30,606 WARN ]: Spent 181.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 15 [2018-06-22 01:30:31,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:31,005 INFO ]: Finished difference Result 311 states and 562 transitions. [2018-06-22 01:30:31,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-22 01:30:31,005 INFO ]: Start accepts. Automaton has 23 states. Word has length 20 [2018-06-22 01:30:31,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:31,007 INFO ]: With dead ends: 311 [2018-06-22 01:30:31,007 INFO ]: Without dead ends: 311 [2018-06-22 01:30:31,008 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1500, Invalid=2660, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:30:31,008 INFO ]: Start minimizeSevpa. Operand 311 states. [2018-06-22 01:30:31,016 INFO ]: Finished minimizeSevpa. Reduced states from 311 to 67. [2018-06-22 01:30:31,016 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:30:31,017 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 117 transitions. [2018-06-22 01:30:31,017 INFO ]: Start accepts. Automaton has 67 states and 117 transitions. Word has length 20 [2018-06-22 01:30:31,017 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:31,017 INFO ]: Abstraction has 67 states and 117 transitions. [2018-06-22 01:30:31,017 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:30:31,017 INFO ]: Start isEmpty. Operand 67 states and 117 transitions. [2018-06-22 01:30:31,018 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:30:31,018 INFO ]: Found error trace [2018-06-22 01:30:31,018 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:31,018 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:31,018 INFO ]: Analyzing trace with hash -1751723809, now seen corresponding path program 15 times [2018-06-22 01:30:31,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:31,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:31,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:31,019 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:31,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:31,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:31,606 INFO ]: Checked inductivity of 91 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:31,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:31,606 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:30:31,621 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:31,681 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:30:31,681 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:31,685 INFO ]: Computing forward predicates... [2018-06-22 01:30:31,917 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:31,936 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:31,936 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-22 01:30:31,937 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:30:31,937 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:30:31,937 INFO ]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:30:31,937 INFO ]: Start difference. First operand 67 states and 117 transitions. Second operand 23 states. [2018-06-22 01:30:32,278 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-06-22 01:30:33,386 WARN ]: Spent 279.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 11 [2018-06-22 01:30:34,336 WARN ]: Spent 307.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-06-22 01:30:35,276 WARN ]: Spent 251.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 15 [2018-06-22 01:30:35,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:35,963 INFO ]: Finished difference Result 190 states and 253 transitions. [2018-06-22 01:30:35,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-06-22 01:30:35,963 INFO ]: Start accepts. Automaton has 23 states. Word has length 20 [2018-06-22 01:30:35,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:35,964 INFO ]: With dead ends: 190 [2018-06-22 01:30:35,964 INFO ]: Without dead ends: 190 [2018-06-22 01:30:35,966 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3589 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2704, Invalid=7196, Unknown=0, NotChecked=0, Total=9900 [2018-06-22 01:30:35,966 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 01:30:35,973 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 67. [2018-06-22 01:30:35,973 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:30:35,974 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-06-22 01:30:35,974 INFO ]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-06-22 01:30:35,974 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:35,974 INFO ]: Abstraction has 67 states and 115 transitions. [2018-06-22 01:30:35,974 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:30:35,974 INFO ]: Start isEmpty. Operand 67 states and 115 transitions. [2018-06-22 01:30:35,982 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:30:35,982 INFO ]: Found error trace [2018-06-22 01:30:35,982 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:35,982 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:35,982 INFO ]: Analyzing trace with hash 1280949696, now seen corresponding path program 16 times [2018-06-22 01:30:35,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:35,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:35,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:35,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:35,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:36,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:36,212 INFO ]: Checked inductivity of 105 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:30:36,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:36,212 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:30:36,218 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:30:36,266 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:30:36,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:36,270 INFO ]: Computing forward predicates... [2018-06-22 01:30:36,382 INFO ]: Checked inductivity of 105 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:30:36,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:36,401 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:30:36,401 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:30:36,401 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:30:36,401 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:30:36,402 INFO ]: Start difference. First operand 67 states and 115 transitions. Second operand 10 states. [2018-06-22 01:30:36,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:36,500 INFO ]: Finished difference Result 150 states and 260 transitions. [2018-06-22 01:30:36,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:30:36,500 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 01:30:36,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:36,501 INFO ]: With dead ends: 150 [2018-06-22 01:30:36,501 INFO ]: Without dead ends: 150 [2018-06-22 01:30:36,501 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 17 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:30:36,501 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 01:30:36,506 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 69. [2018-06-22 01:30:36,506 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:30:36,507 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 119 transitions. [2018-06-22 01:30:36,507 INFO ]: Start accepts. Automaton has 69 states and 119 transitions. Word has length 21 [2018-06-22 01:30:36,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:36,507 INFO ]: Abstraction has 69 states and 119 transitions. [2018-06-22 01:30:36,507 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:30:36,507 INFO ]: Start isEmpty. Operand 69 states and 119 transitions. [2018-06-22 01:30:36,508 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:30:36,508 INFO ]: Found error trace [2018-06-22 01:30:36,508 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:36,508 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:36,508 INFO ]: Analyzing trace with hash 1062713277, now seen corresponding path program 17 times [2018-06-22 01:30:36,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:36,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:36,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:36,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:36,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:36,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:37,302 INFO ]: Checked inductivity of 120 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:37,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:37,302 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:30:37,307 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:30:37,361 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:30:37,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:37,365 INFO ]: Computing forward predicates... [2018-06-22 01:30:37,626 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:37,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:37,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-22 01:30:37,646 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:30:37,646 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:30:37,646 INFO ]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:30:37,646 INFO ]: Start difference. First operand 69 states and 119 transitions. Second operand 26 states. [2018-06-22 01:30:41,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:41,135 INFO ]: Finished difference Result 228 states and 294 transitions. [2018-06-22 01:30:41,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-06-22 01:30:41,136 INFO ]: Start accepts. Automaton has 26 states. Word has length 22 [2018-06-22 01:30:41,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:41,136 INFO ]: With dead ends: 228 [2018-06-22 01:30:41,136 INFO ]: Without dead ends: 228 [2018-06-22 01:30:41,140 INFO ]: 0 DeclaredPredicates, 139 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6071 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4191, Invalid=11559, Unknown=0, NotChecked=0, Total=15750 [2018-06-22 01:30:41,140 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-22 01:30:41,143 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 71. [2018-06-22 01:30:41,143 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 01:30:41,144 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 121 transitions. [2018-06-22 01:30:41,144 INFO ]: Start accepts. Automaton has 71 states and 121 transitions. Word has length 22 [2018-06-22 01:30:41,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:41,144 INFO ]: Abstraction has 71 states and 121 transitions. [2018-06-22 01:30:41,144 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:30:41,144 INFO ]: Start isEmpty. Operand 71 states and 121 transitions. [2018-06-22 01:30:41,145 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:30:41,145 INFO ]: Found error trace [2018-06-22 01:30:41,145 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:41,145 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:41,145 INFO ]: Analyzing trace with hash -820842402, now seen corresponding path program 18 times [2018-06-22 01:30:41,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:41,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:41,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:41,146 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:41,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:41,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:41,598 INFO ]: Checked inductivity of 136 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:30:41,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:41,598 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:41,609 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:30:41,666 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:30:41,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:41,670 INFO ]: Computing forward predicates... [2018-06-22 01:30:41,749 INFO ]: Checked inductivity of 136 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:30:41,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:41,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:30:41,769 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:30:41,769 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:30:41,769 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:30:41,769 INFO ]: Start difference. First operand 71 states and 121 transitions. Second operand 11 states. [2018-06-22 01:30:41,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:41,869 INFO ]: Finished difference Result 178 states and 307 transitions. [2018-06-22 01:30:41,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:30:41,869 INFO ]: Start accepts. Automaton has 11 states. Word has length 23 [2018-06-22 01:30:41,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:41,870 INFO ]: With dead ends: 178 [2018-06-22 01:30:41,871 INFO ]: Without dead ends: 178 [2018-06-22 01:30:41,871 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 23 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:30:41,871 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 01:30:41,874 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 72. [2018-06-22 01:30:41,874 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:30:41,874 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 123 transitions. [2018-06-22 01:30:41,874 INFO ]: Start accepts. Automaton has 72 states and 123 transitions. Word has length 23 [2018-06-22 01:30:41,874 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:41,874 INFO ]: Abstraction has 72 states and 123 transitions. [2018-06-22 01:30:41,874 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:30:41,874 INFO ]: Start isEmpty. Operand 72 states and 123 transitions. [2018-06-22 01:30:41,875 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:30:41,875 INFO ]: Found error trace [2018-06-22 01:30:41,875 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:41,875 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:41,875 INFO ]: Analyzing trace with hash 331667679, now seen corresponding path program 19 times [2018-06-22 01:30:41,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:41,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:41,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:41,876 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:41,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:41,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:42,124 INFO ]: Checked inductivity of 153 backedges. 28 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:42,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:42,125 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:42,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:42,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:42,200 INFO ]: Computing forward predicates... [2018-06-22 01:30:43,297 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:43,316 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:43,316 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-22 01:30:43,316 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:30:43,316 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:30:43,316 INFO ]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:30:43,316 INFO ]: Start difference. First operand 72 states and 123 transitions. Second operand 29 states. [2018-06-22 01:30:47,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:47,929 INFO ]: Finished difference Result 269 states and 338 transitions. [2018-06-22 01:30:47,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-06-22 01:30:47,929 INFO ]: Start accepts. Automaton has 29 states. Word has length 24 [2018-06-22 01:30:47,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:47,931 INFO ]: With dead ends: 269 [2018-06-22 01:30:47,931 INFO ]: Without dead ends: 269 [2018-06-22 01:30:47,936 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9669 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6214, Invalid=17656, Unknown=0, NotChecked=0, Total=23870 [2018-06-22 01:30:47,936 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-22 01:30:47,939 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 75. [2018-06-22 01:30:47,939 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 01:30:47,940 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 127 transitions. [2018-06-22 01:30:47,940 INFO ]: Start accepts. Automaton has 75 states and 127 transitions. Word has length 24 [2018-06-22 01:30:47,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:47,940 INFO ]: Abstraction has 75 states and 127 transitions. [2018-06-22 01:30:47,940 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:30:47,940 INFO ]: Start isEmpty. Operand 75 states and 127 transitions. [2018-06-22 01:30:47,941 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:30:47,941 INFO ]: Found error trace [2018-06-22 01:30:47,941 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:47,942 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:47,942 INFO ]: Analyzing trace with hash -1584108224, now seen corresponding path program 20 times [2018-06-22 01:30:47,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:47,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:47,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:47,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:30:47,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:47,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:48,178 INFO ]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:30:48,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:48,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:48,184 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:30:48,243 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:30:48,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:48,247 INFO ]: Computing forward predicates... [2018-06-22 01:30:48,320 INFO ]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:30:48,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:48,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:30:48,341 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:30:48,341 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:30:48,341 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:30:48,342 INFO ]: Start difference. First operand 75 states and 127 transitions. Second operand 12 states. [2018-06-22 01:30:48,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:48,463 INFO ]: Finished difference Result 216 states and 373 transitions. [2018-06-22 01:30:48,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:30:48,463 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 01:30:48,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:48,464 INFO ]: With dead ends: 216 [2018-06-22 01:30:48,464 INFO ]: Without dead ends: 216 [2018-06-22 01:30:48,464 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:30:48,464 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 01:30:48,467 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 67. [2018-06-22 01:30:48,468 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:30:48,468 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 111 transitions. [2018-06-22 01:30:48,468 INFO ]: Start accepts. Automaton has 67 states and 111 transitions. Word has length 25 [2018-06-22 01:30:48,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:48,468 INFO ]: Abstraction has 67 states and 111 transitions. [2018-06-22 01:30:48,468 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:30:48,468 INFO ]: Start isEmpty. Operand 67 states and 111 transitions. [2018-06-22 01:30:48,469 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:30:48,469 INFO ]: Found error trace [2018-06-22 01:30:48,469 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:48,470 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:48,470 INFO ]: Analyzing trace with hash -1854736323, now seen corresponding path program 21 times [2018-06-22 01:30:48,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:48,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:48,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:48,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:48,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:48,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:49,161 INFO ]: Checked inductivity of 190 backedges. 36 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:49,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:49,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:49,189 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:30:49,325 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 01:30:49,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:49,330 INFO ]: Computing forward predicates... [2018-06-22 01:30:49,716 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:49,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:49,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-22 01:30:49,737 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:30:49,737 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:30:49,737 INFO ]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:30:49,737 INFO ]: Start difference. First operand 67 states and 111 transitions. Second operand 32 states. [2018-06-22 01:30:56,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:56,180 INFO ]: Finished difference Result 305 states and 378 transitions. [2018-06-22 01:30:56,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-06-22 01:30:56,180 INFO ]: Start accepts. Automaton has 32 states. Word has length 26 [2018-06-22 01:30:56,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:56,181 INFO ]: With dead ends: 305 [2018-06-22 01:30:56,181 INFO ]: Without dead ends: 305 [2018-06-22 01:30:56,183 INFO ]: 0 DeclaredPredicates, 202 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14679 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8888, Invalid=25894, Unknown=0, NotChecked=0, Total=34782 [2018-06-22 01:30:56,184 INFO ]: Start minimizeSevpa. Operand 305 states. [2018-06-22 01:30:56,187 INFO ]: Finished minimizeSevpa. Reduced states from 305 to 70. [2018-06-22 01:30:56,187 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:30:56,187 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2018-06-22 01:30:56,187 INFO ]: Start accepts. Automaton has 70 states and 115 transitions. Word has length 26 [2018-06-22 01:30:56,187 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:56,187 INFO ]: Abstraction has 70 states and 115 transitions. [2018-06-22 01:30:56,187 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:30:56,187 INFO ]: Start isEmpty. Operand 70 states and 115 transitions. [2018-06-22 01:30:56,188 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:30:56,188 INFO ]: Found error trace [2018-06-22 01:30:56,188 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:56,188 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:56,188 INFO ]: Analyzing trace with hash -374409122, now seen corresponding path program 22 times [2018-06-22 01:30:56,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:56,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:56,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:56,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:56,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:56,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:56,461 INFO ]: Checked inductivity of 210 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:30:56,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:56,461 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:56,467 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:30:56,526 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:30:56,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:56,532 INFO ]: Computing forward predicates... [2018-06-22 01:30:56,629 INFO ]: Checked inductivity of 210 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:30:56,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:56,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:30:56,648 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:30:56,648 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:30:56,648 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:30:56,649 INFO ]: Start difference. First operand 70 states and 115 transitions. Second operand 13 states. [2018-06-22 01:30:56,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:30:56,797 INFO ]: Finished difference Result 248 states and 426 transitions. [2018-06-22 01:30:56,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:30:56,797 INFO ]: Start accepts. Automaton has 13 states. Word has length 27 [2018-06-22 01:30:56,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:30:56,798 INFO ]: With dead ends: 248 [2018-06-22 01:30:56,799 INFO ]: Without dead ends: 248 [2018-06-22 01:30:56,799 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 28 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:30:56,799 INFO ]: Start minimizeSevpa. Operand 248 states. [2018-06-22 01:30:56,810 INFO ]: Finished minimizeSevpa. Reduced states from 248 to 200. [2018-06-22 01:30:56,810 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 01:30:56,812 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 375 transitions. [2018-06-22 01:30:56,812 INFO ]: Start accepts. Automaton has 200 states and 375 transitions. Word has length 27 [2018-06-22 01:30:56,812 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:30:56,812 INFO ]: Abstraction has 200 states and 375 transitions. [2018-06-22 01:30:56,812 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:30:56,812 INFO ]: Start isEmpty. Operand 200 states and 375 transitions. [2018-06-22 01:30:56,812 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:30:56,813 INFO ]: Found error trace [2018-06-22 01:30:56,813 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:30:56,813 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:30:56,814 INFO ]: Analyzing trace with hash -1728906147, now seen corresponding path program 23 times [2018-06-22 01:30:56,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:30:56,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:30:56,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:56,815 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:30:56,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:30:56,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:57,087 INFO ]: Checked inductivity of 231 backedges. 121 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:30:57,087 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:30:57,087 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:30:57,093 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:30:57,167 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:30:57,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:30:57,172 INFO ]: Computing forward predicates... [2018-06-22 01:30:57,673 INFO ]: Checked inductivity of 231 backedges. 176 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:30:57,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:30:57,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2018-06-22 01:30:57,692 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:30:57,693 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:30:57,693 INFO ]: CoverageRelationStatistics Valid=365, Invalid=825, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:30:57,693 INFO ]: Start difference. First operand 200 states and 375 transitions. Second operand 35 states. [2018-06-22 01:31:01,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:01,490 INFO ]: Finished difference Result 963 states and 1765 transitions. [2018-06-22 01:31:01,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-06-22 01:31:01,492 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-22 01:31:01,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:01,497 INFO ]: With dead ends: 963 [2018-06-22 01:31:01,497 INFO ]: Without dead ends: 963 [2018-06-22 01:31:01,499 INFO ]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4139 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6578, Invalid=12882, Unknown=0, NotChecked=0, Total=19460 [2018-06-22 01:31:01,499 INFO ]: Start minimizeSevpa. Operand 963 states. [2018-06-22 01:31:01,511 INFO ]: Finished minimizeSevpa. Reduced states from 963 to 125. [2018-06-22 01:31:01,511 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 01:31:01,512 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 225 transitions. [2018-06-22 01:31:01,512 INFO ]: Start accepts. Automaton has 125 states and 225 transitions. Word has length 28 [2018-06-22 01:31:01,512 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:01,512 INFO ]: Abstraction has 125 states and 225 transitions. [2018-06-22 01:31:01,512 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:31:01,512 INFO ]: Start isEmpty. Operand 125 states and 225 transitions. [2018-06-22 01:31:01,512 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:31:01,512 INFO ]: Found error trace [2018-06-22 01:31:01,512 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:01,512 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:01,513 INFO ]: Analyzing trace with hash 1286197471, now seen corresponding path program 24 times [2018-06-22 01:31:01,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:01,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:01,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:01,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:31:01,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:01,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:01,838 INFO ]: Checked inductivity of 231 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:01,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:01,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:31:01,844 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:31:01,915 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 01:31:01,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:01,920 INFO ]: Computing forward predicates... [2018-06-22 01:31:02,425 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:02,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:02,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-22 01:31:02,444 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:31:02,445 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:31:02,445 INFO ]: CoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:31:02,445 INFO ]: Start difference. First operand 125 states and 225 transitions. Second operand 35 states. [2018-06-22 01:31:10,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:10,929 INFO ]: Finished difference Result 438 states and 559 transitions. [2018-06-22 01:31:10,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-06-22 01:31:10,930 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-22 01:31:10,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:10,931 INFO ]: With dead ends: 438 [2018-06-22 01:31:10,931 INFO ]: Without dead ends: 438 [2018-06-22 01:31:10,934 INFO ]: 0 DeclaredPredicates, 238 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21431 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12338, Invalid=36724, Unknown=0, NotChecked=0, Total=49062 [2018-06-22 01:31:10,934 INFO ]: Start minimizeSevpa. Operand 438 states. [2018-06-22 01:31:10,939 INFO ]: Finished minimizeSevpa. Reduced states from 438 to 123. [2018-06-22 01:31:10,939 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-22 01:31:10,940 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-06-22 01:31:10,940 INFO ]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 28 [2018-06-22 01:31:10,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:10,940 INFO ]: Abstraction has 123 states and 219 transitions. [2018-06-22 01:31:10,940 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:31:10,940 INFO ]: Start isEmpty. Operand 123 states and 219 transitions. [2018-06-22 01:31:10,940 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:31:10,940 INFO ]: Found error trace [2018-06-22 01:31:10,941 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:10,941 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:10,941 INFO ]: Analyzing trace with hash -2048504640, now seen corresponding path program 25 times [2018-06-22 01:31:10,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:10,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:10,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:10,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:31:10,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:10,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:11,210 INFO ]: Checked inductivity of 253 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:31:11,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:11,211 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:31:11,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:11,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:11,283 INFO ]: Computing forward predicates... [2018-06-22 01:31:11,445 INFO ]: Checked inductivity of 253 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:31:11,464 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:11,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:31:11,465 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:31:11,465 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:31:11,465 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:31:11,465 INFO ]: Start difference. First operand 123 states and 219 transitions. Second operand 14 states. [2018-06-22 01:31:11,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:31:11,650 INFO ]: Finished difference Result 343 states and 604 transitions. [2018-06-22 01:31:11,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:31:11,711 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 01:31:11,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:31:11,713 INFO ]: With dead ends: 343 [2018-06-22 01:31:11,713 INFO ]: Without dead ends: 343 [2018-06-22 01:31:11,713 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 32 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:31:11,713 INFO ]: Start minimizeSevpa. Operand 343 states. [2018-06-22 01:31:11,719 INFO ]: Finished minimizeSevpa. Reduced states from 343 to 127. [2018-06-22 01:31:11,720 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 01:31:11,721 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 227 transitions. [2018-06-22 01:31:11,721 INFO ]: Start accepts. Automaton has 127 states and 227 transitions. Word has length 29 [2018-06-22 01:31:11,722 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:31:11,722 INFO ]: Abstraction has 127 states and 227 transitions. [2018-06-22 01:31:11,722 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:31:11,722 INFO ]: Start isEmpty. Operand 127 states and 227 transitions. [2018-06-22 01:31:11,722 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:31:11,722 INFO ]: Found error trace [2018-06-22 01:31:11,722 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:31:11,722 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:31:11,722 INFO ]: Analyzing trace with hash 928843965, now seen corresponding path program 26 times [2018-06-22 01:31:11,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:31:11,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:31:11,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:11,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:31:11,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:31:11,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:12,656 INFO ]: Checked inductivity of 276 backedges. 55 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:12,656 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:31:12,656 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:31:12,669 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:31:12,735 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:31:12,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:31:12,740 INFO ]: Computing forward predicates... [2018-06-22 01:31:13,218 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:31:13,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:31:13,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-22 01:31:13,237 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:31:13,238 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:31:13,238 INFO ]: CoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:31:13,238 INFO ]: Start difference. First operand 127 states and 227 transitions. Second operand 38 states. Received shutdown request... [2018-06-22 01:31:17,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-06-22 01:31:17,095 WARN ]: Verification canceled [2018-06-22 01:31:17,098 WARN ]: Timeout [2018-06-22 01:31:17,098 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:31:17 BoogieIcfgContainer [2018-06-22 01:31:17,098 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:31:17,099 INFO ]: Toolchain (without parser) took 62090.49 ms. Allocated memory was 308.8 MB in the beginning and 678.4 MB in the end (delta: 369.6 MB). Free memory was 265.2 MB in the beginning and 352.7 MB in the end (delta: -87.5 MB). Peak memory consumption was 282.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:31:17,100 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:31:17,100 INFO ]: ChcToBoogie took 63.56 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 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:31:17,100 INFO ]: Boogie Preprocessor took 46.70 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 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:31:17,101 INFO ]: RCFGBuilder took 276.81 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:31:17,101 INFO ]: TraceAbstraction took 61695.06 ms. Allocated memory was 308.8 MB in the beginning and 678.4 MB in the end (delta: 369.6 MB). Free memory was 251.2 MB in the beginning and 352.7 MB in the end (delta: -101.5 MB). Peak memory consumption was 268.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:31:17,103 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.56 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.70 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 276.81 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61695.06 ms. Allocated memory was 308.8 MB in the beginning and 678.4 MB in the end (delta: 369.6 MB). Free memory was 251.2 MB in the beginning and 352.7 MB in the end (delta: -101.5 MB). Peak memory consumption was 268.1 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 constructing difference of abstraction (127states) and interpolant automaton (currently 110 states, 38 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 136 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 61.6s OverallTime, 30 OverallIterations, 12 TraceHistogramMax, 43.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 220 SDtfs, 151 SDslu, 1042 SDs, 0 SdLazy, 4870 SolverSat, 1366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1953 GetRequests, 242 SyntacticMatches, 261 SemanticMatches, 1449 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69686 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 3080 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 984 ConstructedInterpolants, 122 QuantifiedInterpolants, 128403 SizeOfPredicates, 86 NumberOfNonLiveVariables, 10010 ConjunctsInSsa, 1875 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 833/5314 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/020b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-31-17-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/020b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-31-17-115.csv Completed graceful shutdown