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/hopv/lia/mochi/file.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:46:11,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:46:11,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:46:11,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:46:11,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:46:11,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:46:11,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:46:11,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:46:11,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:46:11,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:46:11,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:46:11,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:46:11,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:46:11,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:46:11,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:46:11,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:46:11,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:46:11,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:46:11,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:46:11,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:46:11,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:46:11,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:46:11,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:46:11,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:46:11,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:46:11,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:46:11,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:46:11,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:46:11,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:46:11,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:46:11,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:46:11,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:46:11,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:46:11,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:46:11,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:46:11,621 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:46:11,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:46:11,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:46:11,642 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:46:11,642 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:46:11,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:46:11,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:46:11,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:46:11,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:46:11,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:46:11,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:46:11,644 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:46:11,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:46:11,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:46:11,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:46:11,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:46:11,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:46:11,646 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:46:11,647 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:46:11,647 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:46:11,698 INFO ]: Repository-Root is: /tmp [2018-06-22 01:46:11,713 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:46:11,718 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:46:11,719 INFO ]: Initializing SmtParser... [2018-06-22 01:46:11,719 INFO ]: SmtParser initialized [2018-06-22 01:46:11,720 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/file.smt2 [2018-06-22 01:46:11,722 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:46:11,812 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/file.smt2 unknown [2018-06-22 01:46:12,058 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/file.smt2 [2018-06-22 01:46:12,063 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:46:12,070 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:46:12,070 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:46:12,070 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:46:12,070 INFO ]: ChcToBoogie initialized [2018-06-22 01:46:12,074 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,138 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12 Unit [2018-06-22 01:46:12,138 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:46:12,139 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:46:12,139 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:46:12,139 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:46:12,162 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,162 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,169 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,169 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,182 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,194 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,195 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... [2018-06-22 01:46:12,197 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:46:12,198 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:46:12,198 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:46:12,198 INFO ]: RCFGBuilder initialized [2018-06-22 01:46:12,199 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:46:12,215 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:46:12,215 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:46:12,215 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:46:12,216 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:46:12,216 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:46:12,216 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:46:12,792 INFO ]: Using library mode [2018-06-22 01:46:12,793 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:46:12 BoogieIcfgContainer [2018-06-22 01:46:12,793 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:46:12,793 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:46:12,793 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:46:12,796 INFO ]: TraceAbstraction initialized [2018-06-22 01:46:12,797 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:46:12" (1/3) ... [2018-06-22 01:46:12,798 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e62ee16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:46:12, skipping insertion in model container [2018-06-22 01:46:12,798 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:46:12" (2/3) ... [2018-06-22 01:46:12,798 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e62ee16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:46:12, skipping insertion in model container [2018-06-22 01:46:12,798 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:46:12" (3/3) ... [2018-06-22 01:46:12,800 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:46:12,809 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:46:12,819 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:46:12,869 INFO ]: Using default assertion order modulation [2018-06-22 01:46:12,870 INFO ]: Interprodecural is true [2018-06-22 01:46:12,870 INFO ]: Hoare is false [2018-06-22 01:46:12,870 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:46:12,870 INFO ]: Backedges is TWOTRACK [2018-06-22 01:46:12,870 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:46:12,870 INFO ]: Difference is false [2018-06-22 01:46:12,870 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:46:12,870 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:46:12,885 INFO ]: Start isEmpty. Operand 40 states. [2018-06-22 01:46:12,899 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:46:12,899 INFO ]: Found error trace [2018-06-22 01:46:12,901 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:12,901 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:12,906 INFO ]: Analyzing trace with hash -1565485202, now seen corresponding path program 1 times [2018-06-22 01:46:12,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:12,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:12,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:12,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:12,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:12,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:13,103 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:46:13,105 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:13,105 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:46:13,106 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:13,117 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:13,117 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:13,119 INFO ]: Start difference. First operand 40 states. Second operand 4 states. [2018-06-22 01:46:13,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:13,683 INFO ]: Finished difference Result 70 states and 117 transitions. [2018-06-22 01:46:13,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:13,685 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:46:13,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:13,701 INFO ]: With dead ends: 70 [2018-06-22 01:46:13,701 INFO ]: Without dead ends: 69 [2018-06-22 01:46:13,703 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:13,721 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:46:13,769 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-22 01:46:13,773 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:46:13,779 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 115 transitions. [2018-06-22 01:46:13,782 INFO ]: Start accepts. Automaton has 69 states and 115 transitions. Word has length 7 [2018-06-22 01:46:13,782 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:13,782 INFO ]: Abstraction has 69 states and 115 transitions. [2018-06-22 01:46:13,783 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:13,783 INFO ]: Start isEmpty. Operand 69 states and 115 transitions. [2018-06-22 01:46:13,784 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:46:13,784 INFO ]: Found error trace [2018-06-22 01:46:13,784 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:13,784 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:13,784 INFO ]: Analyzing trace with hash -1355197470, now seen corresponding path program 1 times [2018-06-22 01:46:13,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:13,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:13,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:13,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:13,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:13,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:13,946 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:46:13,946 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:13,946 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:46:13,947 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:13,948 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:13,948 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:13,948 INFO ]: Start difference. First operand 69 states and 115 transitions. Second operand 4 states. [2018-06-22 01:46:14,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:14,829 INFO ]: Finished difference Result 101 states and 169 transitions. [2018-06-22 01:46:14,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:14,829 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:46:14,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:14,834 INFO ]: With dead ends: 101 [2018-06-22 01:46:14,834 INFO ]: Without dead ends: 101 [2018-06-22 01:46:14,835 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:14,835 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 01:46:14,853 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-06-22 01:46:14,853 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 01:46:14,857 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 169 transitions. [2018-06-22 01:46:14,857 INFO ]: Start accepts. Automaton has 101 states and 169 transitions. Word has length 8 [2018-06-22 01:46:14,857 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:14,857 INFO ]: Abstraction has 101 states and 169 transitions. [2018-06-22 01:46:14,857 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:14,857 INFO ]: Start isEmpty. Operand 101 states and 169 transitions. [2018-06-22 01:46:14,858 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:46:14,858 INFO ]: Found error trace [2018-06-22 01:46:14,858 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:14,858 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:14,858 INFO ]: Analyzing trace with hash 1399334959, now seen corresponding path program 1 times [2018-06-22 01:46:14,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:14,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:14,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:14,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:14,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:14,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:14,895 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:46:14,895 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:14,895 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:46:14,895 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:14,895 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:14,895 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:14,895 INFO ]: Start difference. First operand 101 states and 169 transitions. Second operand 4 states. [2018-06-22 01:46:15,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:15,695 INFO ]: Finished difference Result 133 states and 223 transitions. [2018-06-22 01:46:15,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:15,695 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:46:15,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:15,703 INFO ]: With dead ends: 133 [2018-06-22 01:46:15,703 INFO ]: Without dead ends: 133 [2018-06-22 01:46:15,703 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:15,703 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 01:46:15,734 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-22 01:46:15,734 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 01:46:15,742 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 223 transitions. [2018-06-22 01:46:15,742 INFO ]: Start accepts. Automaton has 133 states and 223 transitions. Word has length 10 [2018-06-22 01:46:15,742 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:15,742 INFO ]: Abstraction has 133 states and 223 transitions. [2018-06-22 01:46:15,742 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:15,742 INFO ]: Start isEmpty. Operand 133 states and 223 transitions. [2018-06-22 01:46:15,755 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:46:15,755 INFO ]: Found error trace [2018-06-22 01:46:15,755 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:15,755 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:15,756 INFO ]: Analyzing trace with hash -1274492297, now seen corresponding path program 1 times [2018-06-22 01:46:15,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:15,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:15,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:15,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:15,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:15,767 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:15,826 INFO ]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:46:15,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:15,826 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:46:15,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:15,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:15,892 INFO ]: Computing forward predicates... [2018-06-22 01:46:15,915 INFO ]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:46:15,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:15,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:46:15,935 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:15,936 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:15,936 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:15,936 INFO ]: Start difference. First operand 133 states and 223 transitions. Second operand 4 states. [2018-06-22 01:46:16,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:16,773 INFO ]: Finished difference Result 164 states and 275 transitions. [2018-06-22 01:46:16,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:16,775 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 01:46:16,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:16,779 INFO ]: With dead ends: 164 [2018-06-22 01:46:16,779 INFO ]: Without dead ends: 164 [2018-06-22 01:46:16,779 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:16,780 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 01:46:16,796 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-06-22 01:46:16,796 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 01:46:16,800 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 275 transitions. [2018-06-22 01:46:16,800 INFO ]: Start accepts. Automaton has 164 states and 275 transitions. Word has length 27 [2018-06-22 01:46:16,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:16,801 INFO ]: Abstraction has 164 states and 275 transitions. [2018-06-22 01:46:16,801 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:16,801 INFO ]: Start isEmpty. Operand 164 states and 275 transitions. [2018-06-22 01:46:16,806 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:46:16,806 INFO ]: Found error trace [2018-06-22 01:46:16,806 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:16,806 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:16,806 INFO ]: Analyzing trace with hash -1468778711, now seen corresponding path program 1 times [2018-06-22 01:46:16,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:16,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:16,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:16,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:16,807 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:16,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:16,884 INFO ]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:46:16,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:16,884 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:46:16,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:16,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:16,918 INFO ]: Computing forward predicates... [2018-06-22 01:46:16,924 INFO ]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:46:16,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:16,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:46:16,951 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:16,951 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:16,951 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:16,951 INFO ]: Start difference. First operand 164 states and 275 transitions. Second operand 4 states. [2018-06-22 01:46:17,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:17,201 INFO ]: Finished difference Result 195 states and 327 transitions. [2018-06-22 01:46:17,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:17,201 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 01:46:17,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:17,206 INFO ]: With dead ends: 195 [2018-06-22 01:46:17,206 INFO ]: Without dead ends: 195 [2018-06-22 01:46:17,207 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:17,207 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 01:46:17,223 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-06-22 01:46:17,223 INFO ]: Start removeUnreachable. Operand 195 states. [2018-06-22 01:46:17,227 INFO ]: Finished removeUnreachable. Reduced from 195 states to 195 states and 327 transitions. [2018-06-22 01:46:17,227 INFO ]: Start accepts. Automaton has 195 states and 327 transitions. Word has length 27 [2018-06-22 01:46:17,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:17,227 INFO ]: Abstraction has 195 states and 327 transitions. [2018-06-22 01:46:17,227 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:17,227 INFO ]: Start isEmpty. Operand 195 states and 327 transitions. [2018-06-22 01:46:17,232 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:46:17,232 INFO ]: Found error trace [2018-06-22 01:46:17,232 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:17,232 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:17,232 INFO ]: Analyzing trace with hash 845570979, now seen corresponding path program 1 times [2018-06-22 01:46:17,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:17,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:17,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:17,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:17,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:17,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:17,331 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:46:17,331 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:17,331 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:46:17,331 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:46:17,331 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:46:17,331 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:46:17,332 INFO ]: Start difference. First operand 195 states and 327 transitions. Second operand 7 states. [2018-06-22 01:46:19,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:19,246 INFO ]: Finished difference Result 860 states and 2987 transitions. [2018-06-22 01:46:19,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:46:19,248 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-22 01:46:19,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:19,304 INFO ]: With dead ends: 860 [2018-06-22 01:46:19,304 INFO ]: Without dead ends: 703 [2018-06-22 01:46:19,305 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:46:19,305 INFO ]: Start minimizeSevpa. Operand 703 states. [2018-06-22 01:46:19,414 INFO ]: Finished minimizeSevpa. Reduced states from 703 to 351. [2018-06-22 01:46:19,414 INFO ]: Start removeUnreachable. Operand 351 states. [2018-06-22 01:46:19,421 INFO ]: Finished removeUnreachable. Reduced from 351 states to 351 states and 691 transitions. [2018-06-22 01:46:19,421 INFO ]: Start accepts. Automaton has 351 states and 691 transitions. Word has length 28 [2018-06-22 01:46:19,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:19,422 INFO ]: Abstraction has 351 states and 691 transitions. [2018-06-22 01:46:19,422 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:46:19,422 INFO ]: Start isEmpty. Operand 351 states and 691 transitions. [2018-06-22 01:46:19,427 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:46:19,427 INFO ]: Found error trace [2018-06-22 01:46:19,427 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:19,428 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:19,428 INFO ]: Analyzing trace with hash 845600770, now seen corresponding path program 1 times [2018-06-22 01:46:19,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:19,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:19,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:19,429 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:19,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:19,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:19,778 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:46:19,778 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:19,778 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:46:19,778 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:46:19,778 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:46:19,778 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:19,778 INFO ]: Start difference. First operand 351 states and 691 transitions. Second operand 5 states. [2018-06-22 01:46:20,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:20,247 INFO ]: Finished difference Result 590 states and 1555 transitions. [2018-06-22 01:46:20,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:46:20,248 INFO ]: Start accepts. Automaton has 5 states. Word has length 28 [2018-06-22 01:46:20,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:20,267 INFO ]: With dead ends: 590 [2018-06-22 01:46:20,267 INFO ]: Without dead ends: 555 [2018-06-22 01:46:20,267 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:46:20,267 INFO ]: Start minimizeSevpa. Operand 555 states. [2018-06-22 01:46:20,313 INFO ]: Finished minimizeSevpa. Reduced states from 555 to 383. [2018-06-22 01:46:20,314 INFO ]: Start removeUnreachable. Operand 383 states. [2018-06-22 01:46:20,322 INFO ]: Finished removeUnreachable. Reduced from 383 states to 383 states and 759 transitions. [2018-06-22 01:46:20,323 INFO ]: Start accepts. Automaton has 383 states and 759 transitions. Word has length 28 [2018-06-22 01:46:20,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:20,323 INFO ]: Abstraction has 383 states and 759 transitions. [2018-06-22 01:46:20,323 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:46:20,323 INFO ]: Start isEmpty. Operand 383 states and 759 transitions. [2018-06-22 01:46:20,326 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:46:20,326 INFO ]: Found error trace [2018-06-22 01:46:20,327 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:20,327 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:20,327 INFO ]: Analyzing trace with hash 357073152, now seen corresponding path program 1 times [2018-06-22 01:46:20,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:20,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:20,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:20,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:20,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:20,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:20,436 INFO ]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:46:20,436 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:20,436 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:46:20,436 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:46:20,436 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:46:20,436 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:46:20,436 INFO ]: Start difference. First operand 383 states and 759 transitions. Second operand 6 states. [2018-06-22 01:46:20,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:20,764 INFO ]: Finished difference Result 1017 states and 4318 transitions. [2018-06-22 01:46:20,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:46:20,764 INFO ]: Start accepts. Automaton has 6 states. Word has length 29 [2018-06-22 01:46:20,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:20,818 INFO ]: With dead ends: 1017 [2018-06-22 01:46:20,818 INFO ]: Without dead ends: 1017 [2018-06-22 01:46:20,818 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:46:20,819 INFO ]: Start minimizeSevpa. Operand 1017 states. [2018-06-22 01:46:20,960 INFO ]: Finished minimizeSevpa. Reduced states from 1017 to 423. [2018-06-22 01:46:20,960 INFO ]: Start removeUnreachable. Operand 423 states. [2018-06-22 01:46:20,967 INFO ]: Finished removeUnreachable. Reduced from 423 states to 423 states and 839 transitions. [2018-06-22 01:46:20,967 INFO ]: Start accepts. Automaton has 423 states and 839 transitions. Word has length 29 [2018-06-22 01:46:20,967 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:20,967 INFO ]: Abstraction has 423 states and 839 transitions. [2018-06-22 01:46:20,967 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:46:20,967 INFO ]: Start isEmpty. Operand 423 states and 839 transitions. [2018-06-22 01:46:20,970 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:46:20,970 INFO ]: Found error trace [2018-06-22 01:46:20,970 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:20,971 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:20,971 INFO ]: Analyzing trace with hash 357102943, now seen corresponding path program 1 times [2018-06-22 01:46:20,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:20,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:20,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:20,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:20,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:20,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:21,631 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:46:21,631 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:21,631 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:46:21,631 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:46:21,631 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:46:21,631 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:46:21,631 INFO ]: Start difference. First operand 423 states and 839 transitions. Second operand 8 states. [2018-06-22 01:46:23,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:23,279 INFO ]: Finished difference Result 803 states and 2724 transitions. [2018-06-22 01:46:23,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:46:23,279 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 01:46:23,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:23,312 INFO ]: With dead ends: 803 [2018-06-22 01:46:23,312 INFO ]: Without dead ends: 795 [2018-06-22 01:46:23,312 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:46:23,313 INFO ]: Start minimizeSevpa. Operand 795 states. [2018-06-22 01:46:23,429 INFO ]: Finished minimizeSevpa. Reduced states from 795 to 483. [2018-06-22 01:46:23,429 INFO ]: Start removeUnreachable. Operand 483 states. [2018-06-22 01:46:23,438 INFO ]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1053 transitions. [2018-06-22 01:46:23,438 INFO ]: Start accepts. Automaton has 483 states and 1053 transitions. Word has length 29 [2018-06-22 01:46:23,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:23,438 INFO ]: Abstraction has 483 states and 1053 transitions. [2018-06-22 01:46:23,438 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:46:23,438 INFO ]: Start isEmpty. Operand 483 states and 1053 transitions. [2018-06-22 01:46:23,443 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:46:23,443 INFO ]: Found error trace [2018-06-22 01:46:23,443 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:23,443 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:23,443 INFO ]: Analyzing trace with hash 1494448418, now seen corresponding path program 1 times [2018-06-22 01:46:23,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:23,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:23,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:23,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:23,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:23,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:23,610 INFO ]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:46:23,610 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:46:23,610 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:46:23,610 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:46:23,610 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:46:23,611 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:46:23,611 INFO ]: Start difference. First operand 483 states and 1053 transitions. Second operand 4 states. [2018-06-22 01:46:24,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:24,143 INFO ]: Finished difference Result 589 states and 1284 transitions. [2018-06-22 01:46:24,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:46:24,144 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 01:46:24,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:24,156 INFO ]: With dead ends: 589 [2018-06-22 01:46:24,156 INFO ]: Without dead ends: 473 [2018-06-22 01:46:24,157 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:46:24,157 INFO ]: Start minimizeSevpa. Operand 473 states. [2018-06-22 01:46:24,193 INFO ]: Finished minimizeSevpa. Reduced states from 473 to 473. [2018-06-22 01:46:24,193 INFO ]: Start removeUnreachable. Operand 473 states. [2018-06-22 01:46:24,201 INFO ]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1017 transitions. [2018-06-22 01:46:24,201 INFO ]: Start accepts. Automaton has 473 states and 1017 transitions. Word has length 29 [2018-06-22 01:46:24,202 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:24,202 INFO ]: Abstraction has 473 states and 1017 transitions. [2018-06-22 01:46:24,202 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:46:24,202 INFO ]: Start isEmpty. Operand 473 states and 1017 transitions. [2018-06-22 01:46:24,204 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:46:24,204 INFO ]: Found error trace [2018-06-22 01:46:24,204 INFO ]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:24,204 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:24,204 INFO ]: Analyzing trace with hash -990538791, now seen corresponding path program 1 times [2018-06-22 01:46:24,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:24,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:24,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:24,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:24,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:24,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:24,589 INFO ]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:46:24,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:24,589 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) [2018-06-22 01:46:24,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:24,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:24,644 INFO ]: Computing forward predicates... [2018-06-22 01:46:25,156 INFO ]: Checked inductivity of 26 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:46:25,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:25,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:46:25,188 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:46:25,188 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:46:25,188 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:46:25,188 INFO ]: Start difference. First operand 473 states and 1017 transitions. Second operand 10 states. [2018-06-22 01:46:26,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:26,100 INFO ]: Finished difference Result 1176 states and 3014 transitions. [2018-06-22 01:46:26,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:46:26,100 INFO ]: Start accepts. Automaton has 10 states. Word has length 37 [2018-06-22 01:46:26,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:26,123 INFO ]: With dead ends: 1176 [2018-06-22 01:46:26,123 INFO ]: Without dead ends: 1089 [2018-06-22 01:46:26,124 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:46:26,124 INFO ]: Start minimizeSevpa. Operand 1089 states. [2018-06-22 01:46:26,202 INFO ]: Finished minimizeSevpa. Reduced states from 1089 to 798. [2018-06-22 01:46:26,202 INFO ]: Start removeUnreachable. Operand 798 states. [2018-06-22 01:46:26,219 INFO ]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1716 transitions. [2018-06-22 01:46:26,219 INFO ]: Start accepts. Automaton has 798 states and 1716 transitions. Word has length 37 [2018-06-22 01:46:26,219 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:26,219 INFO ]: Abstraction has 798 states and 1716 transitions. [2018-06-22 01:46:26,219 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:46:26,219 INFO ]: Start isEmpty. Operand 798 states and 1716 transitions. [2018-06-22 01:46:26,222 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:46:26,222 INFO ]: Found error trace [2018-06-22 01:46:26,222 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:26,222 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:26,223 INFO ]: Analyzing trace with hash -1369599970, now seen corresponding path program 1 times [2018-06-22 01:46:26,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:26,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:26,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:26,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:26,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:26,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:26,872 INFO ]: Checked inductivity of 27 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:46:26,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:26,872 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:46:26,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:26,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:26,908 INFO ]: Computing forward predicates... [2018-06-22 01:46:27,084 INFO ]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 01:46:27,105 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:46:27,105 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-06-22 01:46:27,105 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:46:27,105 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:46:27,105 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:46:27,106 INFO ]: Start difference. First operand 798 states and 1716 transitions. Second operand 13 states. [2018-06-22 01:46:27,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:27,762 INFO ]: Finished difference Result 1063 states and 2856 transitions. [2018-06-22 01:46:27,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:46:27,763 INFO ]: Start accepts. Automaton has 13 states. Word has length 38 [2018-06-22 01:46:27,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:27,801 INFO ]: With dead ends: 1063 [2018-06-22 01:46:27,801 INFO ]: Without dead ends: 971 [2018-06-22 01:46:27,802 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:46:27,803 INFO ]: Start minimizeSevpa. Operand 971 states. [2018-06-22 01:46:27,935 INFO ]: Finished minimizeSevpa. Reduced states from 971 to 869. [2018-06-22 01:46:27,935 INFO ]: Start removeUnreachable. Operand 869 states. [2018-06-22 01:46:27,955 INFO ]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2114 transitions. [2018-06-22 01:46:27,955 INFO ]: Start accepts. Automaton has 869 states and 2114 transitions. Word has length 38 [2018-06-22 01:46:27,955 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:27,955 INFO ]: Abstraction has 869 states and 2114 transitions. [2018-06-22 01:46:27,955 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:46:27,955 INFO ]: Start isEmpty. Operand 869 states and 2114 transitions. [2018-06-22 01:46:27,957 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:46:27,957 INFO ]: Found error trace [2018-06-22 01:46:27,957 INFO ]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:27,957 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:27,957 INFO ]: Analyzing trace with hash 1102011010, now seen corresponding path program 1 times [2018-06-22 01:46:27,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:27,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:27,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:27,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:27,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:27,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:28,798 INFO ]: Checked inductivity of 27 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:46:28,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:28,798 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) [2018-06-22 01:46:28,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:28,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:28,853 INFO ]: Computing forward predicates... [2018-06-22 01:46:29,184 INFO ]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:46:29,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:29,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-22 01:46:29,204 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:46:29,205 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:46:29,205 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:46:29,205 INFO ]: Start difference. First operand 869 states and 2114 transitions. Second operand 14 states. [2018-06-22 01:46:29,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:29,693 INFO ]: Finished difference Result 963 states and 2292 transitions. [2018-06-22 01:46:29,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:46:29,694 INFO ]: Start accepts. Automaton has 14 states. Word has length 38 [2018-06-22 01:46:29,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:29,710 INFO ]: With dead ends: 963 [2018-06-22 01:46:29,710 INFO ]: Without dead ends: 963 [2018-06-22 01:46:29,711 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:46:29,711 INFO ]: Start minimizeSevpa. Operand 963 states. [2018-06-22 01:46:29,774 INFO ]: Finished minimizeSevpa. Reduced states from 963 to 913. [2018-06-22 01:46:29,774 INFO ]: Start removeUnreachable. Operand 913 states. [2018-06-22 01:46:29,794 INFO ]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2232 transitions. [2018-06-22 01:46:29,794 INFO ]: Start accepts. Automaton has 913 states and 2232 transitions. Word has length 38 [2018-06-22 01:46:29,794 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:29,794 INFO ]: Abstraction has 913 states and 2232 transitions. [2018-06-22 01:46:29,794 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:46:29,794 INFO ]: Start isEmpty. Operand 913 states and 2232 transitions. [2018-06-22 01:46:29,796 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:46:29,796 INFO ]: Found error trace [2018-06-22 01:46:29,796 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:29,796 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:29,796 INFO ]: Analyzing trace with hash 766977245, now seen corresponding path program 1 times [2018-06-22 01:46:29,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:29,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:29,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:29,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:29,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:29,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:29,885 INFO ]: Checked inductivity of 27 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:46:29,885 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:29,885 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:46:29,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:29,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:29,922 INFO ]: Computing forward predicates... [2018-06-22 01:46:29,963 INFO ]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:46:29,983 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:46:29,983 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2018-06-22 01:46:29,983 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:46:29,983 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:46:29,983 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:46:29,983 INFO ]: Start difference. First operand 913 states and 2232 transitions. Second operand 13 states. [2018-06-22 01:46:32,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:32,015 INFO ]: Finished difference Result 2081 states and 8421 transitions. [2018-06-22 01:46:32,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:46:32,016 INFO ]: Start accepts. Automaton has 13 states. Word has length 38 [2018-06-22 01:46:32,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:32,112 INFO ]: With dead ends: 2081 [2018-06-22 01:46:32,112 INFO ]: Without dead ends: 2061 [2018-06-22 01:46:32,112 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:46:32,113 INFO ]: Start minimizeSevpa. Operand 2061 states. [2018-06-22 01:46:32,349 INFO ]: Finished minimizeSevpa. Reduced states from 2061 to 989. [2018-06-22 01:46:32,349 INFO ]: Start removeUnreachable. Operand 989 states. [2018-06-22 01:46:32,372 INFO ]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2346 transitions. [2018-06-22 01:46:32,372 INFO ]: Start accepts. Automaton has 989 states and 2346 transitions. Word has length 38 [2018-06-22 01:46:32,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:32,372 INFO ]: Abstraction has 989 states and 2346 transitions. [2018-06-22 01:46:32,372 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:46:32,372 INFO ]: Start isEmpty. Operand 989 states and 2346 transitions. [2018-06-22 01:46:32,381 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 01:46:32,381 INFO ]: Found error trace [2018-06-22 01:46:32,381 INFO ]: trace histogram [6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:32,381 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:32,381 INFO ]: Analyzing trace with hash 363066693, now seen corresponding path program 1 times [2018-06-22 01:46:32,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:32,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:32,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:32,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:32,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:32,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:32,454 INFO ]: Checked inductivity of 71 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 01:46:32,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:32,454 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:46:32,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:32,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:32,509 INFO ]: Computing forward predicates... [2018-06-22 01:46:32,858 INFO ]: Checked inductivity of 71 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 01:46:32,890 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:32,890 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:46:32,890 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:46:32,891 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:46:32,891 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:46:32,891 INFO ]: Start difference. First operand 989 states and 2346 transitions. Second operand 14 states. [2018-06-22 01:46:34,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:34,721 INFO ]: Finished difference Result 2206 states and 6262 transitions. [2018-06-22 01:46:34,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:46:34,721 INFO ]: Start accepts. Automaton has 14 states. Word has length 53 [2018-06-22 01:46:34,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:34,844 INFO ]: With dead ends: 2206 [2018-06-22 01:46:34,844 INFO ]: Without dead ends: 2203 [2018-06-22 01:46:34,845 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:46:34,846 INFO ]: Start minimizeSevpa. Operand 2203 states. [2018-06-22 01:46:35,057 INFO ]: Finished minimizeSevpa. Reduced states from 2203 to 1521. [2018-06-22 01:46:35,057 INFO ]: Start removeUnreachable. Operand 1521 states. [2018-06-22 01:46:35,108 INFO ]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 3720 transitions. [2018-06-22 01:46:35,108 INFO ]: Start accepts. Automaton has 1521 states and 3720 transitions. Word has length 53 [2018-06-22 01:46:35,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:35,109 INFO ]: Abstraction has 1521 states and 3720 transitions. [2018-06-22 01:46:35,109 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:46:35,109 INFO ]: Start isEmpty. Operand 1521 states and 3720 transitions. [2018-06-22 01:46:35,122 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 01:46:35,122 INFO ]: Found error trace [2018-06-22 01:46:35,122 INFO ]: trace histogram [6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:35,122 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:35,123 INFO ]: Analyzing trace with hash 296059940, now seen corresponding path program 1 times [2018-06-22 01:46:35,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:35,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:35,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:35,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:35,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:35,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:35,340 INFO ]: Checked inductivity of 71 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 01:46:35,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:35,340 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:46:35,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:35,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:35,382 INFO ]: Computing forward predicates... [2018-06-22 01:46:35,447 INFO ]: Checked inductivity of 71 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 01:46:35,468 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:46:35,468 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2018-06-22 01:46:35,468 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:46:35,469 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:46:35,469 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:46:35,469 INFO ]: Start difference. First operand 1521 states and 3720 transitions. Second operand 15 states. [2018-06-22 01:46:41,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:41,822 INFO ]: Finished difference Result 4605 states and 16148 transitions. [2018-06-22 01:46:41,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-06-22 01:46:41,823 INFO ]: Start accepts. Automaton has 15 states. Word has length 53 [2018-06-22 01:46:41,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:42,215 INFO ]: With dead ends: 4605 [2018-06-22 01:46:42,215 INFO ]: Without dead ends: 4600 [2018-06-22 01:46:42,217 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=927, Invalid=7263, Unknown=0, NotChecked=0, Total=8190 [2018-06-22 01:46:42,220 INFO ]: Start minimizeSevpa. Operand 4600 states. [2018-06-22 01:46:42,984 INFO ]: Finished minimizeSevpa. Reduced states from 4600 to 2084. [2018-06-22 01:46:42,984 INFO ]: Start removeUnreachable. Operand 2084 states. [2018-06-22 01:46:43,077 INFO ]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 5468 transitions. [2018-06-22 01:46:43,077 INFO ]: Start accepts. Automaton has 2084 states and 5468 transitions. Word has length 53 [2018-06-22 01:46:43,077 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:43,078 INFO ]: Abstraction has 2084 states and 5468 transitions. [2018-06-22 01:46:43,078 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:46:43,078 INFO ]: Start isEmpty. Operand 2084 states and 5468 transitions. [2018-06-22 01:46:43,097 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 01:46:43,097 INFO ]: Found error trace [2018-06-22 01:46:43,097 INFO ]: trace histogram [7, 7, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:43,098 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:43,098 INFO ]: Analyzing trace with hash -116969091, now seen corresponding path program 1 times [2018-06-22 01:46:43,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:43,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:43,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:43,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:43,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:43,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:43,395 INFO ]: Checked inductivity of 97 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:46:43,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:43,395 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:46:43,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:43,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:43,434 INFO ]: Computing forward predicates... [2018-06-22 01:46:43,554 INFO ]: Checked inductivity of 97 backedges. 58 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 01:46:43,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:43,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:46:43,574 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:46:43,574 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:46:43,574 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:46:43,574 INFO ]: Start difference. First operand 2084 states and 5468 transitions. Second operand 16 states. [2018-06-22 01:46:45,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:45,144 INFO ]: Finished difference Result 3752 states and 11484 transitions. [2018-06-22 01:46:45,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:46:45,144 INFO ]: Start accepts. Automaton has 16 states. Word has length 61 [2018-06-22 01:46:45,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:45,589 INFO ]: With dead ends: 3752 [2018-06-22 01:46:45,589 INFO ]: Without dead ends: 3752 [2018-06-22 01:46:45,596 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:46:45,598 INFO ]: Start minimizeSevpa. Operand 3752 states. [2018-06-22 01:46:46,043 INFO ]: Finished minimizeSevpa. Reduced states from 3752 to 2520. [2018-06-22 01:46:46,043 INFO ]: Start removeUnreachable. Operand 2520 states. [2018-06-22 01:46:46,350 INFO ]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 6782 transitions. [2018-06-22 01:46:46,351 INFO ]: Start accepts. Automaton has 2520 states and 6782 transitions. Word has length 61 [2018-06-22 01:46:46,351 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:46,351 INFO ]: Abstraction has 2520 states and 6782 transitions. [2018-06-22 01:46:46,351 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:46:46,351 INFO ]: Start isEmpty. Operand 2520 states and 6782 transitions. [2018-06-22 01:46:46,369 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 01:46:46,369 INFO ]: Found error trace [2018-06-22 01:46:46,369 INFO ]: trace histogram [7, 7, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:46,369 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:46,369 INFO ]: Analyzing trace with hash -304698883, now seen corresponding path program 1 times [2018-06-22 01:46:46,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:46,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:46,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:46,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:46,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:46,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:46,565 INFO ]: Checked inductivity of 97 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-22 01:46:46,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:46,565 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:46:46,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:46,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:46,647 INFO ]: Computing forward predicates... [2018-06-22 01:46:46,943 INFO ]: Checked inductivity of 97 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 01:46:46,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:46,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-06-22 01:46:46,964 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:46:46,964 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:46:46,964 INFO ]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:46:46,964 INFO ]: Start difference. First operand 2520 states and 6782 transitions. Second operand 21 states. [2018-06-22 01:46:51,570 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 Received shutdown request... [2018-06-22 01:47:11,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 318 states. [2018-06-22 01:47:11,206 WARN ]: Verification canceled [2018-06-22 01:47:11,211 WARN ]: Timeout [2018-06-22 01:47:11,211 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:47:11 BoogieIcfgContainer [2018-06-22 01:47:11,211 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:47:11,212 INFO ]: Toolchain (without parser) took 59148.46 ms. Allocated memory was 307.8 MB in the beginning and 1.2 GB in the end (delta: 918.0 MB). Free memory was 258.2 MB in the beginning and 340.4 MB in the end (delta: -82.2 MB). Peak memory consumption was 835.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:11,212 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:47:11,213 INFO ]: ChcToBoogie took 68.56 ms. Allocated memory is still 307.8 MB. Free memory was 258.2 MB in the beginning and 254.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:11,213 INFO ]: Boogie Preprocessor took 58.51 ms. Allocated memory is still 307.8 MB. Free memory is still 254.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:47:11,213 INFO ]: RCFGBuilder took 594.75 ms. Allocated memory is still 307.8 MB. Free memory was 254.2 MB in the beginning and 236.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:11,214 INFO ]: TraceAbstraction took 58417.46 ms. Allocated memory was 307.8 MB in the beginning and 1.2 GB in the end (delta: 918.0 MB). Free memory was 236.2 MB in the beginning and 340.4 MB in the end (delta: -104.2 MB). Peak memory consumption was 813.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:47:11,216 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 307.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.56 ms. Allocated memory is still 307.8 MB. Free memory was 258.2 MB in the beginning and 254.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.51 ms. Allocated memory is still 307.8 MB. Free memory is still 254.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 594.75 ms. Allocated memory is still 307.8 MB. Free memory was 254.2 MB in the beginning and 236.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58417.46 ms. Allocated memory was 307.8 MB in the beginning and 1.2 GB in the end (delta: 918.0 MB). Free memory was 236.2 MB in the beginning and 340.4 MB in the end (delta: -104.2 MB). Peak memory consumption was 813.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (2520states) and interpolant automaton (currently 318 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (11056 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. TIMEOUT Result, 58.3s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 47.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3785 SDtfs, 2166 SDslu, 20633 SDs, 0 SdLazy, 38880 SolverSat, 7736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1226 GetRequests, 630 SyntacticMatches, 3 SemanticMatches, 593 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47263 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2520occurred in iteration=17, 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: 3.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 7375 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 67365 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1954 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 875/1004 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/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-47-11-226.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-47-11-226.csv Completed graceful shutdown