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/llreve-bench/smt2/rec__inlining.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:30:23,653 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:30:23,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:30:23,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:30:23,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:30:23,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:30:23,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:30:23,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:30:23,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:30:23,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:30:23,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:30:23,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:30:23,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:30:23,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:30:23,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:30:23,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:30:23,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:30:23,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:30:23,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:30:23,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:30:23,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:30:23,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:30:23,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:30:23,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:30:23,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:30:23,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:30:23,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:30:23,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:30:23,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:30:23,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:30:23,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:30:23,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:30:23,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:30:23,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:30:23,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:30:23,720 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:30:23,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:30:23,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:30:23,740 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:30:23,740 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:30:23,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:30:23,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:30:23,742 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:30:23,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:30:23,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:30:23,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:30:23,743 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:30:23,745 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:30:23,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:30:23,746 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:30:23,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:30:23,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:30:23,746 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:30:23,748 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:30:23,748 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:30:23,798 INFO ]: Repository-Root is: /tmp [2018-06-22 02:30:23,814 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:30:23,821 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:30:23,822 INFO ]: Initializing SmtParser... [2018-06-22 02:30:23,822 INFO ]: SmtParser initialized [2018-06-22 02:30:23,823 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-22 02:30:23,825 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 02:30:23,922 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3e5a9e9d [2018-06-22 02:30:24,173 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-22 02:30:24,178 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:30:24,185 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:30:24,186 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:30:24,186 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:30:24,186 INFO ]: ChcToBoogie initialized [2018-06-22 02:30:24,191 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,254 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24 Unit [2018-06-22 02:30:24,254 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:30:24,255 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:30:24,255 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:30:24,255 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:30:24,277 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,277 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,289 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,289 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,305 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,308 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,309 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (1/1) ... [2018-06-22 02:30:24,314 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:30:24,314 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:30:24,314 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:30:24,314 INFO ]: RCFGBuilder initialized [2018-06-22 02:30:24,315 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (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 02:30:24,341 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:30:24,342 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:30:24,342 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:30:24,342 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:30:24,342 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:30:24,342 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 02:30:24,864 INFO ]: Using library mode [2018-06-22 02:30:24,864 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:30:24 BoogieIcfgContainer [2018-06-22 02:30:24,864 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:30:24,866 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:30:24,866 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:30:24,869 INFO ]: TraceAbstraction initialized [2018-06-22 02:30:24,869 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:30:24" (1/3) ... [2018-06-22 02:30:24,870 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608bb053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:30:24, skipping insertion in model container [2018-06-22 02:30:24,870 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:24" (2/3) ... [2018-06-22 02:30:24,870 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608bb053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:30:24, skipping insertion in model container [2018-06-22 02:30:24,870 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:30:24" (3/3) ... [2018-06-22 02:30:24,872 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:30:24,883 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:30:24,893 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:30:24,941 INFO ]: Using default assertion order modulation [2018-06-22 02:30:24,942 INFO ]: Interprodecural is true [2018-06-22 02:30:24,942 INFO ]: Hoare is false [2018-06-22 02:30:24,942 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:30:24,942 INFO ]: Backedges is TWOTRACK [2018-06-22 02:30:24,942 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:30:24,942 INFO ]: Difference is false [2018-06-22 02:30:24,942 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:30:24,942 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:30:24,960 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 02:30:24,976 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:30:24,976 INFO ]: Found error trace [2018-06-22 02:30:24,978 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:24,978 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:24,983 INFO ]: Analyzing trace with hash -297901278, now seen corresponding path program 1 times [2018-06-22 02:30:24,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:24,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:25,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:25,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:25,113 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:25,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:25,116 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 02:30:25,118 INFO ]: Interpolant automaton has 2 states [2018-06-22 02:30:25,133 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 02:30:25,133 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 02:30:25,136 INFO ]: Start difference. First operand 29 states. Second operand 2 states. [2018-06-22 02:30:25,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:25,164 INFO ]: Finished difference Result 27 states and 45 transitions. [2018-06-22 02:30:25,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 02:30:25,166 INFO ]: Start accepts. Automaton has 2 states. Word has length 7 [2018-06-22 02:30:25,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:25,179 INFO ]: With dead ends: 27 [2018-06-22 02:30:25,179 INFO ]: Without dead ends: 27 [2018-06-22 02:30:25,181 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 02:30:25,201 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 02:30:25,233 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 02:30:25,235 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 02:30:25,237 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2018-06-22 02:30:25,238 INFO ]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 7 [2018-06-22 02:30:25,238 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:25,238 INFO ]: Abstraction has 27 states and 45 transitions. [2018-06-22 02:30:25,238 INFO ]: Interpolant automaton has 2 states. [2018-06-22 02:30:25,238 INFO ]: Start isEmpty. Operand 27 states and 45 transitions. [2018-06-22 02:30:25,239 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:30:25,239 INFO ]: Found error trace [2018-06-22 02:30:25,239 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:25,240 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:25,242 INFO ]: Analyzing trace with hash -651752638, now seen corresponding path program 1 times [2018-06-22 02:30:25,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:25,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:25,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:25,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:25,361 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:25,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:25,362 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:25,363 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:25,363 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:25,364 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:25,364 INFO ]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. [2018-06-22 02:30:25,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:25,845 INFO ]: Finished difference Result 51 states and 87 transitions. [2018-06-22 02:30:25,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:25,846 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:30:25,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:25,850 INFO ]: With dead ends: 51 [2018-06-22 02:30:25,850 INFO ]: Without dead ends: 51 [2018-06-22 02:30:25,851 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:25,851 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 02:30:25,863 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 02:30:25,863 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 02:30:25,866 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2018-06-22 02:30:25,866 INFO ]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 8 [2018-06-22 02:30:25,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:25,866 INFO ]: Abstraction has 51 states and 87 transitions. [2018-06-22 02:30:25,866 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:25,866 INFO ]: Start isEmpty. Operand 51 states and 87 transitions. [2018-06-22 02:30:25,867 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:30:25,867 INFO ]: Found error trace [2018-06-22 02:30:25,867 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:25,867 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:25,867 INFO ]: Analyzing trace with hash 801996590, now seen corresponding path program 1 times [2018-06-22 02:30:25,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:25,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:25,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:25,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:25,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:25,914 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:25,914 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:25,914 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:25,915 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:25,915 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:25,915 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:25,915 INFO ]: Start difference. First operand 51 states and 87 transitions. Second operand 4 states. [2018-06-22 02:30:26,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:26,140 INFO ]: Finished difference Result 71 states and 122 transitions. [2018-06-22 02:30:26,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:26,141 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:30:26,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:26,144 INFO ]: With dead ends: 71 [2018-06-22 02:30:26,144 INFO ]: Without dead ends: 71 [2018-06-22 02:30:26,144 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 02:30:26,144 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 02:30:26,156 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-06-22 02:30:26,156 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 02:30:26,159 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 122 transitions. [2018-06-22 02:30:26,159 INFO ]: Start accepts. Automaton has 71 states and 122 transitions. Word has length 9 [2018-06-22 02:30:26,159 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:26,159 INFO ]: Abstraction has 71 states and 122 transitions. [2018-06-22 02:30:26,159 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:26,159 INFO ]: Start isEmpty. Operand 71 states and 122 transitions. [2018-06-22 02:30:26,160 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:30:26,160 INFO ]: Found error trace [2018-06-22 02:30:26,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:26,160 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:26,160 INFO ]: Analyzing trace with hash -1685488728, now seen corresponding path program 1 times [2018-06-22 02:30:26,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:26,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:26,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:26,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:26,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:26,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:26,308 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:26,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:26,309 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:26,309 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:26,309 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:26,309 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:26,309 INFO ]: Start difference. First operand 71 states and 122 transitions. Second operand 4 states. [2018-06-22 02:30:26,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:26,877 INFO ]: Finished difference Result 91 states and 157 transitions. [2018-06-22 02:30:26,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:26,877 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:30:26,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:26,880 INFO ]: With dead ends: 91 [2018-06-22 02:30:26,880 INFO ]: Without dead ends: 91 [2018-06-22 02:30:26,880 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 02:30:26,881 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 02:30:26,901 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-06-22 02:30:26,901 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 02:30:26,908 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 157 transitions. [2018-06-22 02:30:26,908 INFO ]: Start accepts. Automaton has 91 states and 157 transitions. Word has length 11 [2018-06-22 02:30:26,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:26,909 INFO ]: Abstraction has 91 states and 157 transitions. [2018-06-22 02:30:26,909 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:26,909 INFO ]: Start isEmpty. Operand 91 states and 157 transitions. [2018-06-22 02:30:26,910 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:30:26,910 INFO ]: Found error trace [2018-06-22 02:30:26,910 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:26,910 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:26,910 INFO ]: Analyzing trace with hash 679847690, now seen corresponding path program 1 times [2018-06-22 02:30:26,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:26,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:26,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:26,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:26,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:26,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:27,061 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:27,061 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:27,061 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:27,061 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:27,062 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:27,062 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:27,062 INFO ]: Start difference. First operand 91 states and 157 transitions. Second operand 3 states. [2018-06-22 02:30:27,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:27,118 INFO ]: Finished difference Result 115 states and 211 transitions. [2018-06-22 02:30:27,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:27,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:30:27,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:27,123 INFO ]: With dead ends: 115 [2018-06-22 02:30:27,123 INFO ]: Without dead ends: 115 [2018-06-22 02:30:27,124 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 02:30:27,124 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 02:30:27,139 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 94. [2018-06-22 02:30:27,139 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 02:30:27,141 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 159 transitions. [2018-06-22 02:30:27,141 INFO ]: Start accepts. Automaton has 94 states and 159 transitions. Word has length 12 [2018-06-22 02:30:27,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:27,141 INFO ]: Abstraction has 94 states and 159 transitions. [2018-06-22 02:30:27,141 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:27,142 INFO ]: Start isEmpty. Operand 94 states and 159 transitions. [2018-06-22 02:30:27,143 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:30:27,143 INFO ]: Found error trace [2018-06-22 02:30:27,143 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:27,143 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:27,143 INFO ]: Analyzing trace with hash 814830711, now seen corresponding path program 1 times [2018-06-22 02:30:27,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:27,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:27,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:27,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:27,186 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:27,186 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:27,186 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:27,186 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:27,186 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:27,186 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:27,186 INFO ]: Start difference. First operand 94 states and 159 transitions. Second operand 3 states. [2018-06-22 02:30:27,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:27,223 INFO ]: Finished difference Result 110 states and 198 transitions. [2018-06-22 02:30:27,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:27,227 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:30:27,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:27,230 INFO ]: With dead ends: 110 [2018-06-22 02:30:27,230 INFO ]: Without dead ends: 110 [2018-06-22 02:30:27,230 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 02:30:27,230 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 02:30:27,243 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 98. [2018-06-22 02:30:27,243 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 02:30:27,245 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 167 transitions. [2018-06-22 02:30:27,245 INFO ]: Start accepts. Automaton has 98 states and 167 transitions. Word has length 12 [2018-06-22 02:30:27,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:27,245 INFO ]: Abstraction has 98 states and 167 transitions. [2018-06-22 02:30:27,245 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:27,245 INFO ]: Start isEmpty. Operand 98 states and 167 transitions. [2018-06-22 02:30:27,251 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:30:27,251 INFO ]: Found error trace [2018-06-22 02:30:27,251 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:27,252 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:27,252 INFO ]: Analyzing trace with hash 662206726, now seen corresponding path program 1 times [2018-06-22 02:30:27,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:27,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:27,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:27,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:27,320 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:27,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:27,320 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:27,320 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:27,320 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:27,320 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:27,321 INFO ]: Start difference. First operand 98 states and 167 transitions. Second operand 3 states. [2018-06-22 02:30:27,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:27,356 INFO ]: Finished difference Result 102 states and 171 transitions. [2018-06-22 02:30:27,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:27,356 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-22 02:30:27,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:27,359 INFO ]: With dead ends: 102 [2018-06-22 02:30:27,359 INFO ]: Without dead ends: 102 [2018-06-22 02:30:27,359 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 02:30:27,359 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 02:30:27,368 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-06-22 02:30:27,368 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 02:30:27,370 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 171 transitions. [2018-06-22 02:30:27,370 INFO ]: Start accepts. Automaton has 102 states and 171 transitions. Word has length 22 [2018-06-22 02:30:27,371 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:27,371 INFO ]: Abstraction has 102 states and 171 transitions. [2018-06-22 02:30:27,371 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:27,371 INFO ]: Start isEmpty. Operand 102 states and 171 transitions. [2018-06-22 02:30:27,373 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:30:27,373 INFO ]: Found error trace [2018-06-22 02:30:27,373 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:27,374 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:27,374 INFO ]: Analyzing trace with hash 962957732, now seen corresponding path program 1 times [2018-06-22 02:30:27,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:27,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:27,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,375 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:27,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:27,447 INFO ]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:27,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:27,447 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 02:30:27,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:27,505 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:27,514 INFO ]: Computing forward predicates... [2018-06-22 02:30:27,538 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:30:27,562 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:30:27,562 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-22 02:30:27,562 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:27,562 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:27,562 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:27,562 INFO ]: Start difference. First operand 102 states and 171 transitions. Second operand 3 states. [2018-06-22 02:30:27,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:27,584 INFO ]: Finished difference Result 111 states and 196 transitions. [2018-06-22 02:30:27,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:27,584 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-22 02:30:27,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:27,586 INFO ]: With dead ends: 111 [2018-06-22 02:30:27,586 INFO ]: Without dead ends: 107 [2018-06-22 02:30:27,587 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 24 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 02:30:27,587 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 02:30:27,597 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-06-22 02:30:27,597 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 02:30:27,599 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 157 transitions. [2018-06-22 02:30:27,599 INFO ]: Start accepts. Automaton has 95 states and 157 transitions. Word has length 23 [2018-06-22 02:30:27,599 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:27,599 INFO ]: Abstraction has 95 states and 157 transitions. [2018-06-22 02:30:27,599 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:27,599 INFO ]: Start isEmpty. Operand 95 states and 157 transitions. [2018-06-22 02:30:27,601 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:30:27,601 INFO ]: Found error trace [2018-06-22 02:30:27,601 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:27,601 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:27,601 INFO ]: Analyzing trace with hash 1527716931, now seen corresponding path program 1 times [2018-06-22 02:30:27,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:27,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:27,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:27,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:27,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:27,883 INFO ]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:27,883 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:27,883 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 02:30:27,883 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:30:27,883 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:30:27,884 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:30:27,884 INFO ]: Start difference. First operand 95 states and 157 transitions. Second operand 6 states. [2018-06-22 02:30:28,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:28,716 INFO ]: Finished difference Result 160 states and 320 transitions. [2018-06-22 02:30:28,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:30:28,716 INFO ]: Start accepts. Automaton has 6 states. Word has length 23 [2018-06-22 02:30:28,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:28,719 INFO ]: With dead ends: 160 [2018-06-22 02:30:28,719 INFO ]: Without dead ends: 144 [2018-06-22 02:30:28,719 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:30:28,720 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 02:30:28,747 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 103. [2018-06-22 02:30:28,747 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 02:30:28,749 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 174 transitions. [2018-06-22 02:30:28,749 INFO ]: Start accepts. Automaton has 103 states and 174 transitions. Word has length 23 [2018-06-22 02:30:28,749 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:28,749 INFO ]: Abstraction has 103 states and 174 transitions. [2018-06-22 02:30:28,749 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:30:28,749 INFO ]: Start isEmpty. Operand 103 states and 174 transitions. [2018-06-22 02:30:28,750 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:30:28,750 INFO ]: Found error trace [2018-06-22 02:30:28,750 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:28,751 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:28,751 INFO ]: Analyzing trace with hash -946710939, now seen corresponding path program 1 times [2018-06-22 02:30:28,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:28,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:28,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:28,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:28,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:28,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:28,811 INFO ]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:28,811 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:28,811 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 02:30:28,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:28,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:28,864 INFO ]: Computing forward predicates... [2018-06-22 02:30:28,886 INFO ]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:28,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:28,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:30:28,922 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:30:28,922 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:30:28,922 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:28,922 INFO ]: Start difference. First operand 103 states and 174 transitions. Second operand 5 states. [2018-06-22 02:30:29,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:29,119 INFO ]: Finished difference Result 118 states and 212 transitions. [2018-06-22 02:30:29,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:29,119 INFO ]: Start accepts. Automaton has 5 states. Word has length 23 [2018-06-22 02:30:29,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:29,120 INFO ]: With dead ends: 118 [2018-06-22 02:30:29,120 INFO ]: Without dead ends: 118 [2018-06-22 02:30:29,121 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:30:29,121 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 02:30:29,133 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 93. [2018-06-22 02:30:29,133 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 02:30:29,134 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 152 transitions. [2018-06-22 02:30:29,134 INFO ]: Start accepts. Automaton has 93 states and 152 transitions. Word has length 23 [2018-06-22 02:30:29,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:29,134 INFO ]: Abstraction has 93 states and 152 transitions. [2018-06-22 02:30:29,134 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:30:29,134 INFO ]: Start isEmpty. Operand 93 states and 152 transitions. [2018-06-22 02:30:29,136 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 02:30:29,136 INFO ]: Found error trace [2018-06-22 02:30:29,137 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:29,137 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:29,137 INFO ]: Analyzing trace with hash 625268820, now seen corresponding path program 1 times [2018-06-22 02:30:29,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:29,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:29,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:29,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:29,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:29,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:29,200 INFO ]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 02:30:29,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:29,200 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 02:30:29,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:29,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:29,231 INFO ]: Computing forward predicates... [2018-06-22 02:30:29,245 INFO ]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 02:30:29,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:29,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 02:30:29,267 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:30:29,267 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:30:29,267 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:30:29,267 INFO ]: Start difference. First operand 93 states and 152 transitions. Second operand 7 states. [2018-06-22 02:30:29,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:29,700 INFO ]: Finished difference Result 132 states and 234 transitions. [2018-06-22 02:30:29,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:30:29,700 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-22 02:30:29,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:29,702 INFO ]: With dead ends: 132 [2018-06-22 02:30:29,702 INFO ]: Without dead ends: 128 [2018-06-22 02:30:29,703 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:30:29,703 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 02:30:29,711 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 85. [2018-06-22 02:30:29,711 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 02:30:29,712 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2018-06-22 02:30:29,712 INFO ]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 33 [2018-06-22 02:30:29,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:29,713 INFO ]: Abstraction has 85 states and 131 transitions. [2018-06-22 02:30:29,713 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:30:29,713 INFO ]: Start isEmpty. Operand 85 states and 131 transitions. [2018-06-22 02:30:29,714 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 02:30:29,714 INFO ]: Found error trace [2018-06-22 02:30:29,714 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:29,715 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:29,715 INFO ]: Analyzing trace with hash 1932189881, now seen corresponding path program 1 times [2018-06-22 02:30:29,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:29,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:29,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:29,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:29,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:29,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:29,843 INFO ]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 02:30:29,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:29,843 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:29,843 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:29,843 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:29,843 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:29,843 INFO ]: Start difference. First operand 85 states and 131 transitions. Second operand 4 states. [2018-06-22 02:30:29,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:29,895 INFO ]: Finished difference Result 103 states and 168 transitions. [2018-06-22 02:30:29,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:29,895 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-22 02:30:29,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:29,896 INFO ]: With dead ends: 103 [2018-06-22 02:30:29,896 INFO ]: Without dead ends: 103 [2018-06-22 02:30:29,897 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:29,897 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 02:30:29,902 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-06-22 02:30:29,902 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 02:30:29,905 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2018-06-22 02:30:29,906 INFO ]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 34 [2018-06-22 02:30:29,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:29,906 INFO ]: Abstraction has 87 states and 133 transitions. [2018-06-22 02:30:29,906 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:29,906 INFO ]: Start isEmpty. Operand 87 states and 133 transitions. [2018-06-22 02:30:29,908 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 02:30:29,908 INFO ]: Found error trace [2018-06-22 02:30:29,908 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:29,908 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:29,908 INFO ]: Analyzing trace with hash 1937073472, now seen corresponding path program 1 times [2018-06-22 02:30:29,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:29,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:29,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:29,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:29,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:29,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:30,400 INFO ]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:30:30,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:30,400 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 02:30:30,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:30,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:30,442 INFO ]: Computing forward predicates... [2018-06-22 02:30:31,494 WARN ]: Spent 538.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 10 [2018-06-22 02:30:31,682 INFO ]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:30:31,713 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:31,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-06-22 02:30:31,713 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:30:31,713 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:30:31,713 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:30:31,713 INFO ]: Start difference. First operand 87 states and 133 transitions. Second operand 15 states. [2018-06-22 02:30:32,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:32,940 INFO ]: Finished difference Result 153 states and 277 transitions. [2018-06-22 02:30:32,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:30:32,942 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 02:30:32,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:32,944 INFO ]: With dead ends: 153 [2018-06-22 02:30:32,944 INFO ]: Without dead ends: 148 [2018-06-22 02:30:32,944 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:30:32,945 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 02:30:32,953 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 100. [2018-06-22 02:30:32,953 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 02:30:32,954 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-06-22 02:30:32,954 INFO ]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 35 [2018-06-22 02:30:32,954 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:32,954 INFO ]: Abstraction has 100 states and 158 transitions. [2018-06-22 02:30:32,954 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:30:32,954 INFO ]: Start isEmpty. Operand 100 states and 158 transitions. [2018-06-22 02:30:32,956 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 02:30:32,956 INFO ]: Found error trace [2018-06-22 02:30:32,956 INFO ]: trace histogram [4, 4, 4, 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] [2018-06-22 02:30:32,957 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:32,957 INFO ]: Analyzing trace with hash -1515941935, now seen corresponding path program 1 times [2018-06-22 02:30:32,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:32,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:32,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:32,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:32,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:32,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:33,057 INFO ]: Checked inductivity of 45 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 02:30:33,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:33,057 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 02:30:33,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:33,097 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:33,100 INFO ]: Computing forward predicates... [2018-06-22 02:30:33,110 INFO ]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 02:30:33,144 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:30:33,144 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2018-06-22 02:30:33,144 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:30:33,144 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:30:33,144 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:30:33,144 INFO ]: Start difference. First operand 100 states and 158 transitions. Second operand 7 states. [2018-06-22 02:30:33,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:33,618 INFO ]: Finished difference Result 150 states and 265 transitions. [2018-06-22 02:30:33,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:30:33,618 INFO ]: Start accepts. Automaton has 7 states. Word has length 45 [2018-06-22 02:30:33,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:33,620 INFO ]: With dead ends: 150 [2018-06-22 02:30:33,620 INFO ]: Without dead ends: 141 [2018-06-22 02:30:33,620 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:30:33,620 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 02:30:33,627 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 106. [2018-06-22 02:30:33,627 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 02:30:33,628 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2018-06-22 02:30:33,628 INFO ]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 45 [2018-06-22 02:30:33,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:33,629 INFO ]: Abstraction has 106 states and 162 transitions. [2018-06-22 02:30:33,629 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:30:33,629 INFO ]: Start isEmpty. Operand 106 states and 162 transitions. [2018-06-22 02:30:33,630 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 02:30:33,630 INFO ]: Found error trace [2018-06-22 02:30:33,630 INFO ]: trace histogram [4, 4, 4, 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] [2018-06-22 02:30:33,630 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:33,631 INFO ]: Analyzing trace with hash 250157306, now seen corresponding path program 1 times [2018-06-22 02:30:33,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:33,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:33,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:33,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:33,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:33,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:33,993 INFO ]: Checked inductivity of 48 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 02:30:33,993 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:33,993 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 02:30:33,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:34,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:34,041 INFO ]: Computing forward predicates... [2018-06-22 02:30:34,788 INFO ]: Checked inductivity of 48 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 02:30:34,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:34,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 02:30:34,808 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:30:34,808 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:30:34,808 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:30:34,808 INFO ]: Start difference. First operand 106 states and 162 transitions. Second operand 18 states. [2018-06-22 02:30:36,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:36,454 INFO ]: Finished difference Result 195 states and 384 transitions. [2018-06-22 02:30:36,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 02:30:36,454 INFO ]: Start accepts. Automaton has 18 states. Word has length 46 [2018-06-22 02:30:36,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:36,456 INFO ]: With dead ends: 195 [2018-06-22 02:30:36,456 INFO ]: Without dead ends: 195 [2018-06-22 02:30:36,457 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 02:30:36,457 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 02:30:36,478 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 136. [2018-06-22 02:30:36,478 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 02:30:36,479 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 225 transitions. [2018-06-22 02:30:36,479 INFO ]: Start accepts. Automaton has 136 states and 225 transitions. Word has length 46 [2018-06-22 02:30:36,480 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:36,480 INFO ]: Abstraction has 136 states and 225 transitions. [2018-06-22 02:30:36,480 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:30:36,480 INFO ]: Start isEmpty. Operand 136 states and 225 transitions. [2018-06-22 02:30:36,483 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 02:30:36,483 INFO ]: Found error trace [2018-06-22 02:30:36,484 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:36,484 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:36,484 INFO ]: Analyzing trace with hash -1626290077, now seen corresponding path program 2 times [2018-06-22 02:30:36,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:36,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:36,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:36,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:36,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:36,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:36,670 INFO ]: Checked inductivity of 53 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 02:30:36,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:36,670 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 02:30:36,678 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:30:36,701 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:30:36,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:36,704 INFO ]: Computing forward predicates... [2018-06-22 02:30:36,722 INFO ]: Checked inductivity of 53 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 02:30:36,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:36,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 02:30:36,747 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:30:36,747 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:30:36,747 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:30:36,747 INFO ]: Start difference. First operand 136 states and 225 transitions. Second operand 7 states. [2018-06-22 02:30:36,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:36,914 INFO ]: Finished difference Result 181 states and 361 transitions. [2018-06-22 02:30:36,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:30:36,914 INFO ]: Start accepts. Automaton has 7 states. Word has length 47 [2018-06-22 02:30:36,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:36,916 INFO ]: With dead ends: 181 [2018-06-22 02:30:36,916 INFO ]: Without dead ends: 181 [2018-06-22 02:30:36,917 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:30:36,917 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 02:30:36,932 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 144. [2018-06-22 02:30:36,932 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 02:30:36,934 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 256 transitions. [2018-06-22 02:30:36,934 INFO ]: Start accepts. Automaton has 144 states and 256 transitions. Word has length 47 [2018-06-22 02:30:36,934 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:36,934 INFO ]: Abstraction has 144 states and 256 transitions. [2018-06-22 02:30:36,934 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:30:36,934 INFO ]: Start isEmpty. Operand 144 states and 256 transitions. [2018-06-22 02:30:36,938 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-22 02:30:36,938 INFO ]: Found error trace [2018-06-22 02:30:36,938 INFO ]: trace histogram [7, 7, 7, 7, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:36,939 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:36,939 INFO ]: Analyzing trace with hash -1401419799, now seen corresponding path program 2 times [2018-06-22 02:30:36,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:36,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:36,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:36,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:36,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:36,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:37,077 INFO ]: Checked inductivity of 180 backedges. 57 proven. 4 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-22 02:30:37,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:37,077 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 02:30:37,083 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:30:37,151 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:30:37,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:37,157 INFO ]: Computing forward predicates... [2018-06-22 02:30:37,233 INFO ]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 02:30:37,253 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:30:37,253 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-22 02:30:37,254 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:30:37,254 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:30:37,254 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:30:37,254 INFO ]: Start difference. First operand 144 states and 256 transitions. Second operand 11 states. [2018-06-22 02:30:37,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:37,673 INFO ]: Finished difference Result 200 states and 400 transitions. [2018-06-22 02:30:37,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:30:37,673 INFO ]: Start accepts. Automaton has 11 states. Word has length 80 [2018-06-22 02:30:37,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:37,675 INFO ]: With dead ends: 200 [2018-06-22 02:30:37,675 INFO ]: Without dead ends: 200 [2018-06-22 02:30:37,676 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:30:37,676 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-22 02:30:37,689 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 156. [2018-06-22 02:30:37,689 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-22 02:30:37,691 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 275 transitions. [2018-06-22 02:30:37,691 INFO ]: Start accepts. Automaton has 156 states and 275 transitions. Word has length 80 [2018-06-22 02:30:37,691 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:37,691 INFO ]: Abstraction has 156 states and 275 transitions. [2018-06-22 02:30:37,691 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:30:37,691 INFO ]: Start isEmpty. Operand 156 states and 275 transitions. [2018-06-22 02:30:37,694 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 02:30:37,694 INFO ]: Found error trace [2018-06-22 02:30:37,694 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:37,694 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:37,694 INFO ]: Analyzing trace with hash -264744820, now seen corresponding path program 3 times [2018-06-22 02:30:37,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:37,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:37,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:37,695 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:37,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:37,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:37,844 INFO ]: Checked inductivity of 85 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 02:30:37,844 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:37,844 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 02:30:37,862 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:30:37,947 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:30:37,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:37,950 INFO ]: Computing forward predicates... [2018-06-22 02:30:38,093 INFO ]: Checked inductivity of 85 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 02:30:38,113 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:38,113 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-22 02:30:38,113 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:30:38,113 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:30:38,114 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:30:38,114 INFO ]: Start difference. First operand 156 states and 275 transitions. Second operand 16 states. [2018-06-22 02:30:40,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:40,318 INFO ]: Finished difference Result 365 states and 797 transitions. [2018-06-22 02:30:40,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 02:30:40,318 INFO ]: Start accepts. Automaton has 16 states. Word has length 57 [2018-06-22 02:30:40,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:40,321 INFO ]: With dead ends: 365 [2018-06-22 02:30:40,321 INFO ]: Without dead ends: 348 [2018-06-22 02:30:40,323 INFO ]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=600, Invalid=3690, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 02:30:40,323 INFO ]: Start minimizeSevpa. Operand 348 states. [2018-06-22 02:30:40,352 INFO ]: Finished minimizeSevpa. Reduced states from 348 to 217. [2018-06-22 02:30:40,352 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-22 02:30:40,354 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 415 transitions. [2018-06-22 02:30:40,354 INFO ]: Start accepts. Automaton has 217 states and 415 transitions. Word has length 57 [2018-06-22 02:30:40,354 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:40,354 INFO ]: Abstraction has 217 states and 415 transitions. [2018-06-22 02:30:40,354 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:30:40,354 INFO ]: Start isEmpty. Operand 217 states and 415 transitions. [2018-06-22 02:30:40,359 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-22 02:30:40,359 INFO ]: Found error trace [2018-06-22 02:30:40,359 INFO ]: trace histogram [7, 7, 7, 7, 6, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:40,359 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:40,359 INFO ]: Analyzing trace with hash -530825789, now seen corresponding path program 4 times [2018-06-22 02:30:40,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:40,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:40,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:40,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:40,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:40,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:40,467 INFO ]: Checked inductivity of 214 backedges. 84 proven. 14 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 02:30:40,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:40,467 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 02:30:40,477 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:30:40,515 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:30:40,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:40,518 INFO ]: Computing forward predicates... [2018-06-22 02:30:40,546 INFO ]: Checked inductivity of 214 backedges. 84 proven. 14 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 02:30:40,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:40,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 02:30:40,566 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:30:40,566 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:30:40,566 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:30:40,566 INFO ]: Start difference. First operand 217 states and 415 transitions. Second operand 11 states. [2018-06-22 02:30:40,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:40,778 INFO ]: Finished difference Result 296 states and 598 transitions. [2018-06-22 02:30:40,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:30:40,785 INFO ]: Start accepts. Automaton has 11 states. Word has length 84 [2018-06-22 02:30:40,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:40,788 INFO ]: With dead ends: 296 [2018-06-22 02:30:40,788 INFO ]: Without dead ends: 296 [2018-06-22 02:30:40,789 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:30:40,789 INFO ]: Start minimizeSevpa. Operand 296 states. [2018-06-22 02:30:40,811 INFO ]: Finished minimizeSevpa. Reduced states from 296 to 232. [2018-06-22 02:30:40,811 INFO ]: Start removeUnreachable. Operand 232 states. [2018-06-22 02:30:40,814 INFO ]: Finished removeUnreachable. Reduced from 232 states to 232 states and 436 transitions. [2018-06-22 02:30:40,814 INFO ]: Start accepts. Automaton has 232 states and 436 transitions. Word has length 84 [2018-06-22 02:30:40,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:40,815 INFO ]: Abstraction has 232 states and 436 transitions. [2018-06-22 02:30:40,815 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:30:40,815 INFO ]: Start isEmpty. Operand 232 states and 436 transitions. [2018-06-22 02:30:40,821 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-22 02:30:40,821 INFO ]: Found error trace [2018-06-22 02:30:40,821 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:40,821 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:40,821 INFO ]: Analyzing trace with hash 335896474, now seen corresponding path program 5 times [2018-06-22 02:30:40,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:40,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:40,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:40,822 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:40,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:40,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:41,463 INFO ]: Checked inductivity of 98 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 02:30:41,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:41,463 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 02:30:41,470 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:30:41,503 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 02:30:41,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:41,506 INFO ]: Computing forward predicates... [2018-06-22 02:30:41,532 INFO ]: Checked inductivity of 98 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 02:30:41,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:41,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 02:30:41,552 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:30:41,552 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:30:41,552 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:30:41,553 INFO ]: Start difference. First operand 232 states and 436 transitions. Second operand 10 states. [2018-06-22 02:30:42,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:42,522 INFO ]: Finished difference Result 314 states and 640 transitions. [2018-06-22 02:30:42,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:30:42,522 INFO ]: Start accepts. Automaton has 10 states. Word has length 59 [2018-06-22 02:30:42,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:42,525 INFO ]: With dead ends: 314 [2018-06-22 02:30:42,525 INFO ]: Without dead ends: 308 [2018-06-22 02:30:42,526 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:30:42,526 INFO ]: Start minimizeSevpa. Operand 308 states. [2018-06-22 02:30:42,547 INFO ]: Finished minimizeSevpa. Reduced states from 308 to 229. [2018-06-22 02:30:42,547 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-22 02:30:42,549 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 425 transitions. [2018-06-22 02:30:42,550 INFO ]: Start accepts. Automaton has 229 states and 425 transitions. Word has length 59 [2018-06-22 02:30:42,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:42,550 INFO ]: Abstraction has 229 states and 425 transitions. [2018-06-22 02:30:42,550 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:30:42,550 INFO ]: Start isEmpty. Operand 229 states and 425 transitions. [2018-06-22 02:30:42,554 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 02:30:42,554 INFO ]: Found error trace [2018-06-22 02:30:42,554 INFO ]: trace histogram [6, 6, 6, 6, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:42,554 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:42,554 INFO ]: Analyzing trace with hash 745323543, now seen corresponding path program 6 times [2018-06-22 02:30:42,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:42,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:42,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:42,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:42,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:42,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:42,861 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-22 02:30:43,190 INFO ]: Checked inductivity of 145 backedges. 61 proven. 8 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 02:30:43,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:43,190 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 02:30:43,196 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:30:43,234 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 02:30:43,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:43,237 INFO ]: Computing forward predicates... [2018-06-22 02:30:44,309 INFO ]: Checked inductivity of 145 backedges. 41 proven. 29 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-22 02:30:44,329 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:44,329 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-06-22 02:30:44,330 INFO ]: Interpolant automaton has 30 states [2018-06-22 02:30:44,330 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 02:30:44,330 INFO ]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:30:44,330 INFO ]: Start difference. First operand 229 states and 425 transitions. Second operand 30 states. [2018-06-22 02:30:44,753 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-06-22 02:30:46,623 WARN ]: Spent 377.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-06-22 02:30:47,075 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-06-22 02:30:50,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:50,073 INFO ]: Finished difference Result 398 states and 909 transitions. [2018-06-22 02:30:50,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 02:30:50,073 INFO ]: Start accepts. Automaton has 30 states. Word has length 71 [2018-06-22 02:30:50,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:50,076 INFO ]: With dead ends: 398 [2018-06-22 02:30:50,077 INFO ]: Without dead ends: 391 [2018-06-22 02:30:50,077 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=302, Invalid=2890, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 02:30:50,077 INFO ]: Start minimizeSevpa. Operand 391 states. [2018-06-22 02:30:50,099 INFO ]: Finished minimizeSevpa. Reduced states from 391 to 263. [2018-06-22 02:30:50,099 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 02:30:50,102 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 508 transitions. [2018-06-22 02:30:50,102 INFO ]: Start accepts. Automaton has 263 states and 508 transitions. Word has length 71 [2018-06-22 02:30:50,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:50,102 INFO ]: Abstraction has 263 states and 508 transitions. [2018-06-22 02:30:50,102 INFO ]: Interpolant automaton has 30 states. [2018-06-22 02:30:50,102 INFO ]: Start isEmpty. Operand 263 states and 508 transitions. [2018-06-22 02:30:50,109 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-22 02:30:50,109 INFO ]: Found error trace [2018-06-22 02:30:50,109 INFO ]: trace histogram [7, 7, 7, 7, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:50,109 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:50,109 INFO ]: Analyzing trace with hash -792015675, now seen corresponding path program 7 times [2018-06-22 02:30:50,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:50,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:50,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,110 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:50,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,733 INFO ]: Checked inductivity of 207 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 02:30:50,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:50,733 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 02:30:50,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:50,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,776 INFO ]: Computing forward predicates... [2018-06-22 02:30:50,823 INFO ]: Checked inductivity of 207 backedges. 127 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 02:30:50,843 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:50,843 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2018-06-22 02:30:50,843 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:30:50,843 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:30:50,843 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:30:50,843 INFO ]: Start difference. First operand 263 states and 508 transitions. Second operand 15 states. [2018-06-22 02:30:51,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:51,617 INFO ]: Finished difference Result 428 states and 978 transitions. [2018-06-22 02:30:51,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 02:30:51,619 INFO ]: Start accepts. Automaton has 15 states. Word has length 82 [2018-06-22 02:30:51,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:51,642 INFO ]: With dead ends: 428 [2018-06-22 02:30:51,642 INFO ]: Without dead ends: 424 [2018-06-22 02:30:51,643 INFO ]: 0 DeclaredPredicates, 126 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 02:30:51,643 INFO ]: Start minimizeSevpa. Operand 424 states. [2018-06-22 02:30:51,674 INFO ]: Finished minimizeSevpa. Reduced states from 424 to 278. [2018-06-22 02:30:51,674 INFO ]: Start removeUnreachable. Operand 278 states. [2018-06-22 02:30:51,677 INFO ]: Finished removeUnreachable. Reduced from 278 states to 278 states and 572 transitions. [2018-06-22 02:30:51,677 INFO ]: Start accepts. Automaton has 278 states and 572 transitions. Word has length 82 [2018-06-22 02:30:51,677 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:51,677 INFO ]: Abstraction has 278 states and 572 transitions. [2018-06-22 02:30:51,677 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:30:51,678 INFO ]: Start isEmpty. Operand 278 states and 572 transitions. [2018-06-22 02:30:51,684 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 02:30:51,684 INFO ]: Found error trace [2018-06-22 02:30:51,684 INFO ]: trace histogram [8, 8, 8, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:51,684 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:51,685 INFO ]: Analyzing trace with hash -811450691, now seen corresponding path program 1 times [2018-06-22 02:30:51,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:51,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:51,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:51,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:51,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:51,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:51,856 INFO ]: Checked inductivity of 292 backedges. 68 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-06-22 02:30:51,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:51,856 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) [2018-06-22 02:30:51,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:30:51,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:51,942 INFO ]: Computing forward predicates... [2018-06-22 02:30:51,953 INFO ]: Checked inductivity of 292 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-06-22 02:30:51,984 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:30:51,984 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 02:30:51,985 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:51,985 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:51,985 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:51,985 INFO ]: Start difference. First operand 278 states and 572 transitions. Second operand 4 states. [2018-06-22 02:30:52,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:52,243 INFO ]: Finished difference Result 286 states and 580 transitions. [2018-06-22 02:30:52,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:52,243 INFO ]: Start accepts. Automaton has 4 states. Word has length 97 [2018-06-22 02:30:52,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:52,244 INFO ]: With dead ends: 286 [2018-06-22 02:30:52,245 INFO ]: Without dead ends: 222 [2018-06-22 02:30:52,245 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:52,245 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 02:30:52,258 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-06-22 02:30:52,258 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-22 02:30:52,260 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 445 transitions. [2018-06-22 02:30:52,260 INFO ]: Start accepts. Automaton has 222 states and 445 transitions. Word has length 97 [2018-06-22 02:30:52,260 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:52,260 INFO ]: Abstraction has 222 states and 445 transitions. [2018-06-22 02:30:52,260 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:52,260 INFO ]: Start isEmpty. Operand 222 states and 445 transitions. [2018-06-22 02:30:52,265 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-22 02:30:52,265 INFO ]: Found error trace [2018-06-22 02:30:52,265 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:52,265 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:52,265 INFO ]: Analyzing trace with hash 4345875, now seen corresponding path program 8 times [2018-06-22 02:30:52,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:52,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:52,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:52,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:52,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:52,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:52,713 INFO ]: Checked inductivity of 230 backedges. 89 proven. 16 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-22 02:30:52,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:52,714 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 02:30:52,720 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:30:52,759 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:30:52,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:52,762 INFO ]: Computing forward predicates... [2018-06-22 02:30:52,781 INFO ]: Checked inductivity of 230 backedges. 89 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 02:30:52,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:52,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2018-06-22 02:30:52,807 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:30:52,807 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:30:52,808 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:30:52,808 INFO ]: Start difference. First operand 222 states and 445 transitions. Second operand 13 states. [2018-06-22 02:30:53,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:53,729 INFO ]: Finished difference Result 318 states and 711 transitions. [2018-06-22 02:30:53,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:30:53,729 INFO ]: Start accepts. Automaton has 13 states. Word has length 84 [2018-06-22 02:30:53,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:53,732 INFO ]: With dead ends: 318 [2018-06-22 02:30:53,732 INFO ]: Without dead ends: 304 [2018-06-22 02:30:53,733 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 02:30:53,733 INFO ]: Start minimizeSevpa. Operand 304 states. [2018-06-22 02:30:53,748 INFO ]: Finished minimizeSevpa. Reduced states from 304 to 203. [2018-06-22 02:30:53,748 INFO ]: Start removeUnreachable. Operand 203 states. [2018-06-22 02:30:53,750 INFO ]: Finished removeUnreachable. Reduced from 203 states to 203 states and 393 transitions. [2018-06-22 02:30:53,750 INFO ]: Start accepts. Automaton has 203 states and 393 transitions. Word has length 84 [2018-06-22 02:30:53,750 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:53,750 INFO ]: Abstraction has 203 states and 393 transitions. [2018-06-22 02:30:53,751 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:30:53,751 INFO ]: Start isEmpty. Operand 203 states and 393 transitions. [2018-06-22 02:30:53,754 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 02:30:53,754 INFO ]: Found error trace [2018-06-22 02:30:53,754 INFO ]: trace histogram [8, 8, 8, 8, 8, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:53,754 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:53,754 INFO ]: Analyzing trace with hash 1789499301, now seen corresponding path program 9 times [2018-06-22 02:30:53,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:53,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:53,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:53,755 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:53,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:53,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,007 INFO ]: Checked inductivity of 313 backedges. 59 proven. 37 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-22 02:30:54,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:54,008 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:30:54,015 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:30:54,065 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 02:30:54,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,068 INFO ]: Computing forward predicates... [2018-06-22 02:30:54,152 INFO ]: Checked inductivity of 313 backedges. 59 proven. 41 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-06-22 02:30:54,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:54,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-22 02:30:54,183 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:30:54,184 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:30:54,184 INFO ]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:30:54,184 INFO ]: Start difference. First operand 203 states and 393 transitions. Second operand 15 states. [2018-06-22 02:30:54,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:54,667 INFO ]: Finished difference Result 478 states and 1171 transitions. [2018-06-22 02:30:54,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 02:30:54,669 INFO ]: Start accepts. Automaton has 15 states. Word has length 97 [2018-06-22 02:30:54,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:54,674 INFO ]: With dead ends: 478 [2018-06-22 02:30:54,674 INFO ]: Without dead ends: 478 [2018-06-22 02:30:54,675 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 02:30:54,675 INFO ]: Start minimizeSevpa. Operand 478 states. [2018-06-22 02:30:54,702 INFO ]: Finished minimizeSevpa. Reduced states from 478 to 345. [2018-06-22 02:30:54,702 INFO ]: Start removeUnreachable. Operand 345 states. [2018-06-22 02:30:54,710 INFO ]: Finished removeUnreachable. Reduced from 345 states to 345 states and 738 transitions. [2018-06-22 02:30:54,710 INFO ]: Start accepts. Automaton has 345 states and 738 transitions. Word has length 97 [2018-06-22 02:30:54,710 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:54,710 INFO ]: Abstraction has 345 states and 738 transitions. [2018-06-22 02:30:54,710 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:30:54,710 INFO ]: Start isEmpty. Operand 345 states and 738 transitions. [2018-06-22 02:30:54,717 INFO ]: Finished isEmpty. Found accepting run of length 99 [2018-06-22 02:30:54,717 INFO ]: Found error trace [2018-06-22 02:30:54,717 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:54,717 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:54,717 INFO ]: Analyzing trace with hash -360379482, now seen corresponding path program 10 times [2018-06-22 02:30:54,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:54,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:54,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,718 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:30:54,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:55,275 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-06-22 02:30:56,008 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 02:30:56,021 INFO ]: Checked inductivity of 328 backedges. 122 proven. 49 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 02:30:56,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:56,021 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 02:30:56,027 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:30:56,081 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:30:56,081 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:56,096 INFO ]: Computing forward predicates... [2018-06-22 02:30:57,362 INFO ]: Checked inductivity of 328 backedges. 124 proven. 44 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-06-22 02:30:57,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:57,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2018-06-22 02:30:57,383 INFO ]: Interpolant automaton has 31 states [2018-06-22 02:30:57,383 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 02:30:57,383 INFO ]: CoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2018-06-22 02:30:57,384 INFO ]: Start difference. First operand 345 states and 738 transitions. Second operand 31 states. [2018-06-22 02:30:58,832 WARN ]: Spent 228.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-06-22 02:31:02,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:02,001 INFO ]: Finished difference Result 601 states and 1590 transitions. [2018-06-22 02:31:02,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 02:31:02,002 INFO ]: Start accepts. Automaton has 31 states. Word has length 98 [2018-06-22 02:31:02,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:02,009 INFO ]: With dead ends: 601 [2018-06-22 02:31:02,009 INFO ]: Without dead ends: 601 [2018-06-22 02:31:02,010 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 93 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=297, Invalid=3485, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 02:31:02,010 INFO ]: Start minimizeSevpa. Operand 601 states. [2018-06-22 02:31:02,056 INFO ]: Finished minimizeSevpa. Reduced states from 601 to 426. [2018-06-22 02:31:02,056 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-22 02:31:02,060 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 970 transitions. [2018-06-22 02:31:02,060 INFO ]: Start accepts. Automaton has 426 states and 970 transitions. Word has length 98 [2018-06-22 02:31:02,061 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:02,061 INFO ]: Abstraction has 426 states and 970 transitions. [2018-06-22 02:31:02,061 INFO ]: Interpolant automaton has 31 states. [2018-06-22 02:31:02,061 INFO ]: Start isEmpty. Operand 426 states and 970 transitions. [2018-06-22 02:31:02,067 INFO ]: Finished isEmpty. Found accepting run of length 113 [2018-06-22 02:31:02,067 INFO ]: Found error trace [2018-06-22 02:31:02,067 INFO ]: trace histogram [11, 9, 9, 9, 9, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:02,068 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:02,068 INFO ]: Analyzing trace with hash -215437499, now seen corresponding path program 11 times [2018-06-22 02:31:02,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:02,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:02,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:02,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:02,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:02,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:02,805 INFO ]: Checked inductivity of 446 backedges. 199 proven. 32 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-06-22 02:31:02,806 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:02,806 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 02:31:02,811 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:31:02,893 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 02:31:02,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:02,897 INFO ]: Computing forward predicates... [2018-06-22 02:31:02,939 INFO ]: Checked inductivity of 446 backedges. 199 proven. 32 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-06-22 02:31:02,962 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:02,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 02:31:02,962 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:31:02,962 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:31:02,963 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:31:02,963 INFO ]: Start difference. First operand 426 states and 970 transitions. Second operand 14 states. [2018-06-22 02:31:03,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:03,218 INFO ]: Finished difference Result 517 states and 1348 transitions. [2018-06-22 02:31:03,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:31:03,219 INFO ]: Start accepts. Automaton has 14 states. Word has length 112 [2018-06-22 02:31:03,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:03,228 INFO ]: With dead ends: 517 [2018-06-22 02:31:03,228 INFO ]: Without dead ends: 517 [2018-06-22 02:31:03,229 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:31:03,229 INFO ]: Start minimizeSevpa. Operand 517 states. [2018-06-22 02:31:03,267 INFO ]: Finished minimizeSevpa. Reduced states from 517 to 441. [2018-06-22 02:31:03,267 INFO ]: Start removeUnreachable. Operand 441 states. [2018-06-22 02:31:03,272 INFO ]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1038 transitions. [2018-06-22 02:31:03,272 INFO ]: Start accepts. Automaton has 441 states and 1038 transitions. Word has length 112 [2018-06-22 02:31:03,272 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:03,272 INFO ]: Abstraction has 441 states and 1038 transitions. [2018-06-22 02:31:03,272 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:31:03,272 INFO ]: Start isEmpty. Operand 441 states and 1038 transitions. [2018-06-22 02:31:03,278 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 02:31:03,278 INFO ]: Found error trace [2018-06-22 02:31:03,278 INFO ]: trace histogram [12, 9, 9, 9, 9, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:03,278 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:03,279 INFO ]: Analyzing trace with hash 1172656408, now seen corresponding path program 12 times [2018-06-22 02:31:03,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:03,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:03,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:03,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:03,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:03,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:03,775 WARN ]: Spent 314.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-06-22 02:31:04,077 WARN ]: Spent 251.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2018-06-22 02:31:04,684 INFO ]: Checked inductivity of 465 backedges. 229 proven. 42 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-06-22 02:31:04,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:04,684 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 02:31:04,690 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:31:04,765 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 02:31:04,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:04,770 INFO ]: Computing forward predicates... [2018-06-22 02:31:05,687 INFO ]: Checked inductivity of 465 backedges. 224 proven. 41 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-06-22 02:31:05,707 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:05,707 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 45 [2018-06-22 02:31:05,708 INFO ]: Interpolant automaton has 45 states [2018-06-22 02:31:05,708 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-22 02:31:05,708 INFO ]: CoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:31:05,708 INFO ]: Start difference. First operand 441 states and 1038 transitions. Second operand 45 states. [2018-06-22 02:31:06,252 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2018-06-22 02:31:19,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:19,656 INFO ]: Finished difference Result 1341 states and 4469 transitions. [2018-06-22 02:31:19,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-06-22 02:31:19,656 INFO ]: Start accepts. Automaton has 45 states. Word has length 113 [2018-06-22 02:31:19,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:19,710 INFO ]: With dead ends: 1341 [2018-06-22 02:31:19,710 INFO ]: Without dead ends: 1337 [2018-06-22 02:31:19,716 INFO ]: 0 DeclaredPredicates, 267 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6688 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1561, Invalid=17899, Unknown=0, NotChecked=0, Total=19460 [2018-06-22 02:31:19,717 INFO ]: Start minimizeSevpa. Operand 1337 states. [2018-06-22 02:31:19,822 INFO ]: Finished minimizeSevpa. Reduced states from 1337 to 807. [2018-06-22 02:31:19,822 INFO ]: Start removeUnreachable. Operand 807 states. [2018-06-22 02:31:19,833 INFO ]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1883 transitions. [2018-06-22 02:31:19,833 INFO ]: Start accepts. Automaton has 807 states and 1883 transitions. Word has length 113 [2018-06-22 02:31:19,833 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:19,833 INFO ]: Abstraction has 807 states and 1883 transitions. [2018-06-22 02:31:19,833 INFO ]: Interpolant automaton has 45 states. [2018-06-22 02:31:19,833 INFO ]: Start isEmpty. Operand 807 states and 1883 transitions. [2018-06-22 02:31:19,843 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-22 02:31:19,843 INFO ]: Found error trace [2018-06-22 02:31:19,843 INFO ]: trace histogram [11, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:19,843 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:19,843 INFO ]: Analyzing trace with hash -1952825769, now seen corresponding path program 13 times [2018-06-22 02:31:19,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:19,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:19,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:19,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:19,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:19,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:20,076 INFO ]: Checked inductivity of 437 backedges. 143 proven. 18 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-06-22 02:31:20,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:20,076 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 02:31:20,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:20,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:20,155 INFO ]: Computing forward predicates... [2018-06-22 02:31:20,306 INFO ]: Checked inductivity of 437 backedges. 260 proven. 3 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-06-22 02:31:20,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:20,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2018-06-22 02:31:20,328 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:31:20,328 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:31:20,328 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:31:20,328 INFO ]: Start difference. First operand 807 states and 1883 transitions. Second operand 18 states. [2018-06-22 02:31:21,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:21,440 INFO ]: Finished difference Result 1169 states and 3506 transitions. [2018-06-22 02:31:21,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 02:31:21,440 INFO ]: Start accepts. Automaton has 18 states. Word has length 110 [2018-06-22 02:31:21,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:21,458 INFO ]: With dead ends: 1169 [2018-06-22 02:31:21,458 INFO ]: Without dead ends: 1161 [2018-06-22 02:31:21,460 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=466, Invalid=2186, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 02:31:21,461 INFO ]: Start minimizeSevpa. Operand 1161 states. [2018-06-22 02:31:21,565 INFO ]: Finished minimizeSevpa. Reduced states from 1161 to 825. [2018-06-22 02:31:21,565 INFO ]: Start removeUnreachable. Operand 825 states. [2018-06-22 02:31:21,575 INFO ]: Finished removeUnreachable. Reduced from 825 states to 825 states and 2067 transitions. [2018-06-22 02:31:21,575 INFO ]: Start accepts. Automaton has 825 states and 2067 transitions. Word has length 110 [2018-06-22 02:31:21,576 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:21,576 INFO ]: Abstraction has 825 states and 2067 transitions. [2018-06-22 02:31:21,576 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:31:21,576 INFO ]: Start isEmpty. Operand 825 states and 2067 transitions. [2018-06-22 02:31:21,586 INFO ]: Finished isEmpty. Found accepting run of length 127 [2018-06-22 02:31:21,586 INFO ]: Found error trace [2018-06-22 02:31:21,586 INFO ]: trace histogram [15, 10, 10, 10, 10, 9, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:21,586 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:21,586 INFO ]: Analyzing trace with hash 67639912, now seen corresponding path program 14 times [2018-06-22 02:31:21,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:21,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:21,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:21,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:21,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:21,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:21,872 INFO ]: Checked inductivity of 615 backedges. 117 proven. 72 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2018-06-22 02:31:21,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:21,872 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 02:31:21,878 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:31:21,972 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:31:21,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:21,977 INFO ]: Computing forward predicates... [2018-06-22 02:31:22,074 INFO ]: Checked inductivity of 615 backedges. 120 proven. 6 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-06-22 02:31:22,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:22,094 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-06-22 02:31:22,094 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:31:22,095 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:31:22,095 INFO ]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:31:22,095 INFO ]: Start difference. First operand 825 states and 2067 transitions. Second operand 15 states. [2018-06-22 02:31:22,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:22,998 INFO ]: Finished difference Result 1735 states and 5605 transitions. [2018-06-22 02:31:22,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 02:31:22,999 INFO ]: Start accepts. Automaton has 15 states. Word has length 126 [2018-06-22 02:31:22,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:23,057 INFO ]: With dead ends: 1735 [2018-06-22 02:31:23,057 INFO ]: Without dead ends: 1701 [2018-06-22 02:31:23,060 INFO ]: 0 DeclaredPredicates, 176 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=519, Invalid=1737, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 02:31:23,061 INFO ]: Start minimizeSevpa. Operand 1701 states. [2018-06-22 02:31:23,240 INFO ]: Finished minimizeSevpa. Reduced states from 1701 to 1063. [2018-06-22 02:31:23,240 INFO ]: Start removeUnreachable. Operand 1063 states. [2018-06-22 02:31:23,259 INFO ]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 2774 transitions. [2018-06-22 02:31:23,259 INFO ]: Start accepts. Automaton has 1063 states and 2774 transitions. Word has length 126 [2018-06-22 02:31:23,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:23,259 INFO ]: Abstraction has 1063 states and 2774 transitions. [2018-06-22 02:31:23,259 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:31:23,259 INFO ]: Start isEmpty. Operand 1063 states and 2774 transitions. [2018-06-22 02:31:23,274 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 02:31:23,274 INFO ]: Found error trace [2018-06-22 02:31:23,274 INFO ]: trace histogram [14, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:23,274 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:23,274 INFO ]: Analyzing trace with hash 687316324, now seen corresponding path program 15 times [2018-06-22 02:31:23,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:23,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:23,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:23,275 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:23,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:23,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:23,807 INFO ]: Checked inductivity of 497 backedges. 209 proven. 29 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-06-22 02:31:23,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:23,826 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 02:31:23,832 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:31:23,871 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:31:23,871 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:23,874 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 02:31:23,951 INFO ]: Timeout while computing interpolants [2018-06-22 02:31:24,151 WARN ]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:31:24,151 WARN ]: Verification canceled [2018-06-22 02:31:24,156 WARN ]: Timeout [2018-06-22 02:31:24,156 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:31:24 BoogieIcfgContainer [2018-06-22 02:31:24,156 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:31:24,157 INFO ]: Toolchain (without parser) took 59978.94 ms. Allocated memory was 306.7 MB in the beginning and 880.3 MB in the end (delta: 573.6 MB). Free memory was 261.1 MB in the beginning and 533.8 MB in the end (delta: -272.7 MB). Peak memory consumption was 300.9 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:24,158 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:31:24,158 INFO ]: ChcToBoogie took 68.32 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:24,158 INFO ]: Boogie Preprocessor took 59.00 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:24,162 INFO ]: RCFGBuilder took 550.21 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 244.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:24,162 INFO ]: TraceAbstraction took 59290.80 ms. Allocated memory was 306.7 MB in the beginning and 880.3 MB in the end (delta: 573.6 MB). Free memory was 244.1 MB in the beginning and 533.8 MB in the end (delta: -289.7 MB). Peak memory consumption was 283.9 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:24,164 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.32 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.00 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 550.21 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 244.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59290.80 ms. Allocated memory was 306.7 MB in the beginning and 880.3 MB in the end (delta: 573.6 MB). Free memory was 244.1 MB in the beginning and 533.8 MB in the end (delta: -289.7 MB). Peak memory consumption was 283.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 114 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. TIMEOUT Result, 59.2s OverallTime, 31 OverallIterations, 15 TraceHistogramMax, 39.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2198 SDtfs, 2102 SDslu, 14031 SDs, 0 SdLazy, 27610 SolverSat, 2137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2340 GetRequests, 1610 SyntacticMatches, 20 SemanticMatches, 710 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11351 ImplicationChecksByTransitivity, 26.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1063occurred in iteration=30, 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: 1.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 2930 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 3182 NumberOfCodeBlocks, 3163 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 3131 ConstructedInterpolants, 0 QuantifiedInterpolants, 769716 SizeOfPredicates, 181 NumberOfNonLiveVariables, 6748 ConjunctsInSsa, 591 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 7944/8568 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/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-31-24-175.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-31-24-175.csv Completed graceful shutdown