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/loop__barthe.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:10:52,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:10:52,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:10:52,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:10:52,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:10:52,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:10:52,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:10:52,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:10:52,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:10:52,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:10:52,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:10:52,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:10:52,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:10:52,983 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:10:52,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:10:52,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:10:52,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:10:53,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:10:53,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:10:53,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:10:53,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:10:53,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:10:53,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:10:53,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:10:53,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:10:53,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:10:53,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:10:53,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:10:53,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:10:53,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:10:53,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:10:53,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:10:53,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:10:53,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:10:53,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:10:53,027 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:10:53,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:10:53,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:10:53,051 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:10:53,051 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:10:53,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:10:53,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:10:53,052 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:10:53,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:10:53,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:10:53,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:10:53,056 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:10:53,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:10:53,057 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:10:53,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:10:53,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:10:53,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:10:53,057 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:10:53,061 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:10:53,061 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:10:53,115 INFO ]: Repository-Root is: /tmp [2018-06-22 02:10:53,131 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:10:53,136 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:10:53,138 INFO ]: Initializing SmtParser... [2018-06-22 02:10:53,138 INFO ]: SmtParser initialized [2018-06-22 02:10:53,139 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-22 02:10:53,140 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:10:53,234 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@45c2db6c [2018-06-22 02:10:53,431 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-22 02:10:53,435 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:10:53,448 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:10:53,448 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:10:53,448 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:10:53,448 INFO ]: ChcToBoogie initialized [2018-06-22 02:10:53,452 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,508 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53 Unit [2018-06-22 02:10:53,508 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:10:53,509 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:10:53,509 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:10:53,509 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:10:53,533 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,533 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,539 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,539 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,542 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,544 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,545 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (1/1) ... [2018-06-22 02:10:53,547 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:10:53,547 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:10:53,547 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:10:53,547 INFO ]: RCFGBuilder initialized [2018-06-22 02:10:53,548 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (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:10:53,568 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:10:53,568 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:10:53,568 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:10:53,568 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:10:53,568 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:10:53,568 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:10:53,817 INFO ]: Using library mode [2018-06-22 02:10:53,818 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:10:53 BoogieIcfgContainer [2018-06-22 02:10:53,818 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:10:53,828 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:10:53,828 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:10:53,832 INFO ]: TraceAbstraction initialized [2018-06-22 02:10:53,832 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:10:53" (1/3) ... [2018-06-22 02:10:53,833 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d212f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:10:53, skipping insertion in model container [2018-06-22 02:10:53,833 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:10:53" (2/3) ... [2018-06-22 02:10:53,833 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d212f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:10:53, skipping insertion in model container [2018-06-22 02:10:53,833 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:10:53" (3/3) ... [2018-06-22 02:10:53,835 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:10:53,846 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:10:53,865 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:10:53,923 INFO ]: Using default assertion order modulation [2018-06-22 02:10:53,924 INFO ]: Interprodecural is true [2018-06-22 02:10:53,924 INFO ]: Hoare is false [2018-06-22 02:10:53,924 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:10:53,924 INFO ]: Backedges is TWOTRACK [2018-06-22 02:10:53,924 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:10:53,924 INFO ]: Difference is false [2018-06-22 02:10:53,924 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:10:53,924 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:10:53,946 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 02:10:53,961 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:10:53,961 INFO ]: Found error trace [2018-06-22 02:10:53,962 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:53,962 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:53,968 INFO ]: Analyzing trace with hash -204663978, now seen corresponding path program 1 times [2018-06-22 02:10:53,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:53,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:54,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:54,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:54,155 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:10:54,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:54,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:10:54,159 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:10:54,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:10:54,171 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:54,173 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 02:10:54,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:54,228 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 02:10:54,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:10:54,229 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:10:54,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:54,237 INFO ]: With dead ends: 9 [2018-06-22 02:10:54,237 INFO ]: Without dead ends: 9 [2018-06-22 02:10:54,239 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:10:54,257 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 02:10:54,285 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 02:10:54,286 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 02:10:54,288 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 02:10:54,289 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 02:10:54,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:54,290 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 02:10:54,290 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:10:54,290 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 02:10:54,290 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:10:54,290 INFO ]: Found error trace [2018-06-22 02:10:54,290 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:54,290 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:54,290 INFO ]: Analyzing trace with hash -2057099186, now seen corresponding path program 1 times [2018-06-22 02:10:54,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:54,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:54,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:54,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:54,404 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:54,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:54,405 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:10:54,406 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:10:54,407 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:10:54,407 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:54,407 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-22 02:10:54,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:54,487 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-22 02:10:54,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:10:54,488 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:10:54,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:54,488 INFO ]: With dead ends: 10 [2018-06-22 02:10:54,488 INFO ]: Without dead ends: 10 [2018-06-22 02:10:54,489 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:10:54,489 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 02:10:54,490 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 02:10:54,490 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:10:54,490 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 02:10:54,490 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 02:10:54,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:54,490 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 02:10:54,490 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:10:54,490 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 02:10:54,490 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:10:54,490 INFO ]: Found error trace [2018-06-22 02:10:54,490 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:54,490 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:54,491 INFO ]: Analyzing trace with hash -2053405102, now seen corresponding path program 1 times [2018-06-22 02:10:54,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:54,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:54,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:54,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:54,573 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:54,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:10:54,573 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:10:54,573 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:10:54,573 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:10:54,573 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:10:54,574 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2018-06-22 02:10:54,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:54,649 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-22 02:10:54,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:10:54,650 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:10:54,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:54,650 INFO ]: With dead ends: 12 [2018-06-22 02:10:54,650 INFO ]: Without dead ends: 12 [2018-06-22 02:10:54,650 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:10:54,651 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:10:54,652 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-22 02:10:54,652 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:10:54,652 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 02:10:54,653 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 02:10:54,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:54,653 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 02:10:54,653 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:10:54,653 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 02:10:54,653 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:10:54,653 INFO ]: Found error trace [2018-06-22 02:10:54,653 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:54,653 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:54,653 INFO ]: Analyzing trace with hash -2048787497, now seen corresponding path program 1 times [2018-06-22 02:10:54,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:54,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:54,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:54,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:54,772 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:54,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:54,772 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:10:54,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:54,824 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:54,834 INFO ]: Computing forward predicates... [2018-06-22 02:10:54,886 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:54,907 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:54,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 02:10:54,907 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:10:54,907 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:10:54,907 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:10:54,907 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2018-06-22 02:10:54,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:54,986 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-22 02:10:54,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:10:54,986 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 02:10:54,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:54,987 INFO ]: With dead ends: 12 [2018-06-22 02:10:54,988 INFO ]: Without dead ends: 12 [2018-06-22 02:10:54,988 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:10:54,988 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:10:54,990 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-22 02:10:54,990 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:10:54,990 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-22 02:10:54,990 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-22 02:10:54,990 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:54,990 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-22 02:10:54,990 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:10:54,990 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-22 02:10:54,991 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:10:54,991 INFO ]: Found error trace [2018-06-22 02:10:54,991 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:54,991 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:54,991 INFO ]: Analyzing trace with hash 655263199, now seen corresponding path program 1 times [2018-06-22 02:10:54,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:54,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:54,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:54,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:54,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:55,015 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:55,109 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:55,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:55,109 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:10:55,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:55,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:55,168 INFO ]: Computing forward predicates... [2018-06-22 02:10:55,512 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:55,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:55,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-22 02:10:55,533 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:10:55,533 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:10:55,533 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:10:55,534 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-06-22 02:10:55,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:55,785 INFO ]: Finished difference Result 15 states and 27 transitions. [2018-06-22 02:10:55,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:10:55,785 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 02:10:55,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:55,786 INFO ]: With dead ends: 15 [2018-06-22 02:10:55,786 INFO ]: Without dead ends: 10 [2018-06-22 02:10:55,786 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:55,786 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 02:10:55,787 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 02:10:55,787 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:10:55,787 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-22 02:10:55,787 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2018-06-22 02:10:55,788 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:55,788 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-22 02:10:55,788 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:10:55,788 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-22 02:10:55,788 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:10:55,788 INFO ]: Found error trace [2018-06-22 02:10:55,788 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:55,788 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:55,788 INFO ]: Analyzing trace with hash 912925558, now seen corresponding path program 2 times [2018-06-22 02:10:55,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:55,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:55,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:55,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:55,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:55,809 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:55,953 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:55,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:55,953 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:10:55,970 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:10:56,029 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:10:56,029 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:56,032 INFO ]: Computing forward predicates... [2018-06-22 02:10:56,261 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:56,294 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:56,294 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 02:10:56,294 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:10:56,294 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:10:56,294 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:10:56,294 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-22 02:10:56,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:56,419 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-22 02:10:56,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:10:56,420 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 02:10:56,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:56,420 INFO ]: With dead ends: 11 [2018-06-22 02:10:56,420 INFO ]: Without dead ends: 11 [2018-06-22 02:10:56,421 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:10:56,421 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 02:10:56,422 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 02:10:56,422 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:10:56,422 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-22 02:10:56,422 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-22 02:10:56,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:56,422 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-22 02:10:56,422 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:10:56,422 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-22 02:10:56,423 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:10:56,423 INFO ]: Found error trace [2018-06-22 02:10:56,423 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:56,423 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:56,423 INFO ]: Analyzing trace with hash -1763250249, now seen corresponding path program 3 times [2018-06-22 02:10:56,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:56,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:56,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:56,425 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:56,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:56,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:56,915 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:56,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:56,915 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:10:56,929 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:10:56,955 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:10:56,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:56,958 INFO ]: Computing forward predicates... [2018-06-22 02:10:57,085 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:57,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:57,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 02:10:57,108 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:10:57,108 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:10:57,108 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:57,109 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-22 02:10:57,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:57,142 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-22 02:10:57,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:10:57,143 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 02:10:57,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:57,143 INFO ]: With dead ends: 12 [2018-06-22 02:10:57,143 INFO ]: Without dead ends: 12 [2018-06-22 02:10:57,144 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:57,144 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:10:57,145 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 02:10:57,145 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 02:10:57,145 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-22 02:10:57,145 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-22 02:10:57,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:57,145 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-22 02:10:57,145 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:10:57,145 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-22 02:10:57,146 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:10:57,146 INFO ]: Found error trace [2018-06-22 02:10:57,146 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:57,146 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:57,147 INFO ]: Analyzing trace with hash 1174645654, now seen corresponding path program 4 times [2018-06-22 02:10:57,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:57,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:57,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:57,148 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:57,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:57,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:57,511 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:57,511 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:57,511 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:10:57,522 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:10:57,558 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:10:57,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:57,562 INFO ]: Computing forward predicates... [2018-06-22 02:10:57,605 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:57,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:57,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 02:10:57,627 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:10:57,627 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:10:57,627 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:57,627 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-06-22 02:10:57,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:57,722 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-22 02:10:57,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:10:57,722 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 02:10:57,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:57,723 INFO ]: With dead ends: 13 [2018-06-22 02:10:57,723 INFO ]: Without dead ends: 13 [2018-06-22 02:10:57,723 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:10:57,723 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 02:10:57,724 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 02:10:57,724 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 02:10:57,725 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-22 02:10:57,725 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-22 02:10:57,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:57,725 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-22 02:10:57,725 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:10:57,725 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-22 02:10:57,725 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:10:57,725 INFO ]: Found error trace [2018-06-22 02:10:57,725 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:57,725 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:57,726 INFO ]: Analyzing trace with hash 2055105431, now seen corresponding path program 5 times [2018-06-22 02:10:57,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:57,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:57,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:57,727 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:57,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:57,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:58,197 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:58,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:58,197 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) [2018-06-22 02:10:58,212 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:10:58,257 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:10:58,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:58,261 INFO ]: Computing forward predicates... [2018-06-22 02:10:58,392 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:58,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:58,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 02:10:58,429 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:10:58,429 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:10:58,429 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:10:58,429 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-06-22 02:10:58,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:58,521 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-22 02:10:58,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:10:58,521 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 02:10:58,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:58,522 INFO ]: With dead ends: 14 [2018-06-22 02:10:58,522 INFO ]: Without dead ends: 14 [2018-06-22 02:10:58,522 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:10:58,522 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 02:10:58,523 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 02:10:58,524 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:10:58,524 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-22 02:10:58,524 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-22 02:10:58,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:58,524 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-22 02:10:58,524 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:10:58,524 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-22 02:10:58,524 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:10:58,525 INFO ]: Found error trace [2018-06-22 02:10:58,525 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:58,525 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:58,525 INFO ]: Analyzing trace with hash -715412554, now seen corresponding path program 6 times [2018-06-22 02:10:58,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:58,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:58,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:58,526 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:58,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:58,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:58,843 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:58,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:58,843 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:10:58,850 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:10:58,888 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:10:58,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:58,892 INFO ]: Computing forward predicates... [2018-06-22 02:10:58,984 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:59,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:59,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 02:10:59,007 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:10:59,007 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:10:59,007 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:59,007 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-22 02:10:59,064 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:59,065 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-22 02:10:59,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:10:59,065 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 02:10:59,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:59,065 INFO ]: With dead ends: 15 [2018-06-22 02:10:59,065 INFO ]: Without dead ends: 15 [2018-06-22 02:10:59,065 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:10:59,066 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 02:10:59,067 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 02:10:59,067 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:10:59,068 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-22 02:10:59,068 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-22 02:10:59,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:59,068 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-22 02:10:59,068 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:10:59,068 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-22 02:10:59,068 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:10:59,068 INFO ]: Found error trace [2018-06-22 02:10:59,068 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:59,068 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:59,069 INFO ]: Analyzing trace with hash -702124169, now seen corresponding path program 7 times [2018-06-22 02:10:59,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:59,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:59,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:59,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:10:59,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:59,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:59,420 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:59,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:10:59,421 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:10:59,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:59,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:10:59,465 INFO ]: Computing forward predicates... [2018-06-22 02:10:59,656 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:10:59,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:10:59,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 02:10:59,676 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:10:59,676 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:10:59,676 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:59,676 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-22 02:10:59,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:10:59,748 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-22 02:10:59,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:10:59,748 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 02:10:59,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:10:59,749 INFO ]: With dead ends: 16 [2018-06-22 02:10:59,749 INFO ]: Without dead ends: 16 [2018-06-22 02:10:59,749 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:10:59,749 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:10:59,750 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 02:10:59,750 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:10:59,751 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-22 02:10:59,751 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-22 02:10:59,751 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:10:59,751 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-22 02:10:59,751 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:10:59,751 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-22 02:10:59,751 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:10:59,751 INFO ]: Found error trace [2018-06-22 02:10:59,751 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:10:59,752 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:10:59,752 INFO ]: Analyzing trace with hash -290184234, now seen corresponding path program 8 times [2018-06-22 02:10:59,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:10:59,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:10:59,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:59,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:10:59,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:10:59,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:00,012 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:00,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:00,013 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:11:00,019 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:00,065 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:00,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:00,073 INFO ]: Computing forward predicates... [2018-06-22 02:11:00,211 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:00,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:00,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 02:11:00,231 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:11:00,232 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:11:00,232 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:00,232 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-22 02:11:00,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:00,631 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-22 02:11:00,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:11:00,635 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-22 02:11:00,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:00,635 INFO ]: With dead ends: 17 [2018-06-22 02:11:00,635 INFO ]: Without dead ends: 17 [2018-06-22 02:11:00,635 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:00,635 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 02:11:00,637 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 02:11:00,637 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 02:11:00,637 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-22 02:11:00,637 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-22 02:11:00,637 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:00,637 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-22 02:11:00,637 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:11:00,637 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-22 02:11:00,638 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:11:00,638 INFO ]: Found error trace [2018-06-22 02:11:00,638 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:00,638 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:00,638 INFO ]: Analyzing trace with hash -404948137, now seen corresponding path program 9 times [2018-06-22 02:11:00,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:00,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:00,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:00,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:00,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:00,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:00,928 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:00,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:00,928 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:11:00,941 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:01,051 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 02:11:01,051 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:01,056 INFO ]: Computing forward predicates... [2018-06-22 02:11:01,159 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:01,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:01,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 02:11:01,185 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:11:01,185 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:11:01,185 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:01,185 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 13 states. [2018-06-22 02:11:01,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:01,270 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-22 02:11:01,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:11:01,270 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 02:11:01,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:01,270 INFO ]: With dead ends: 18 [2018-06-22 02:11:01,270 INFO ]: Without dead ends: 18 [2018-06-22 02:11:01,271 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:11:01,271 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 02:11:01,272 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 02:11:01,272 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 02:11:01,272 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-22 02:11:01,272 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-22 02:11:01,272 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:01,272 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-22 02:11:01,272 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:11:01,273 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-22 02:11:01,273 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:11:01,273 INFO ]: Found error trace [2018-06-22 02:11:01,273 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:01,273 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:01,273 INFO ]: Analyzing trace with hash 332338166, now seen corresponding path program 10 times [2018-06-22 02:11:01,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:01,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:01,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:01,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:01,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:01,300 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:01,619 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:01,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:01,619 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:11:01,641 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:01,694 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:01,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:01,700 INFO ]: Computing forward predicates... [2018-06-22 02:11:01,761 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:01,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:01,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 02:11:01,783 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:11:01,783 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:11:01,783 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:11:01,783 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 14 states. [2018-06-22 02:11:01,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:01,873 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-22 02:11:01,874 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:11:01,874 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 02:11:01,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:01,874 INFO ]: With dead ends: 19 [2018-06-22 02:11:01,874 INFO ]: Without dead ends: 19 [2018-06-22 02:11:01,875 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:11:01,875 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 02:11:01,876 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 02:11:01,876 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:11:01,876 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-22 02:11:01,876 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-22 02:11:01,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:01,877 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-22 02:11:01,877 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:11:01,877 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-22 02:11:01,877 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:11:01,877 INFO ]: Found error trace [2018-06-22 02:11:01,877 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:01,877 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:01,877 INFO ]: Analyzing trace with hash 1713377079, now seen corresponding path program 11 times [2018-06-22 02:11:01,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:01,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:01,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:01,878 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:01,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:01,913 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:02,315 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:02,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:02,343 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:11:02,349 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:02,445 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 02:11:02,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:02,452 INFO ]: Computing forward predicates... [2018-06-22 02:11:02,511 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:02,532 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:02,532 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 02:11:02,532 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:11:02,532 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:11:02,532 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:11:02,532 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 15 states. [2018-06-22 02:11:02,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:02,670 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-22 02:11:02,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:11:02,670 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-22 02:11:02,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:02,671 INFO ]: With dead ends: 20 [2018-06-22 02:11:02,671 INFO ]: Without dead ends: 20 [2018-06-22 02:11:02,671 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:11:02,671 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:11:02,672 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 02:11:02,673 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:11:02,673 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-22 02:11:02,673 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-22 02:11:02,673 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:02,673 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-22 02:11:02,673 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:11:02,673 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-22 02:11:02,674 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:11:02,674 INFO ]: Found error trace [2018-06-22 02:11:02,674 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:02,674 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:02,674 INFO ]: Analyzing trace with hash 1575910422, now seen corresponding path program 12 times [2018-06-22 02:11:02,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:02,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:02,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:02,675 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:02,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:02,704 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:03,996 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:03,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:03,996 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:11:04,005 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:04,057 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 02:11:04,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:04,065 INFO ]: Computing forward predicates... [2018-06-22 02:11:04,525 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:04,558 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:04,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-22 02:11:04,558 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:11:04,558 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:11:04,558 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:11:04,558 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-06-22 02:11:04,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:04,879 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-22 02:11:04,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:11:04,879 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-22 02:11:04,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:04,880 INFO ]: With dead ends: 21 [2018-06-22 02:11:04,880 INFO ]: Without dead ends: 21 [2018-06-22 02:11:04,880 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:11:04,880 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 02:11:04,882 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 02:11:04,882 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 02:11:04,882 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-22 02:11:04,883 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-22 02:11:04,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:04,883 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-22 02:11:04,883 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:11:04,883 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-22 02:11:04,884 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:11:04,884 INFO ]: Found error trace [2018-06-22 02:11:04,884 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:04,884 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:04,884 INFO ]: Analyzing trace with hash 1609411351, now seen corresponding path program 13 times [2018-06-22 02:11:04,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:04,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:04,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:04,884 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:04,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:04,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:05,241 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:05,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:05,241 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:05,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:05,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:05,338 INFO ]: Computing forward predicates... [2018-06-22 02:11:05,699 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Forcibly destroying the process [2018-06-22 02:11:05,899 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:05,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 02:11:05,899 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:11:05,900 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:11:05,900 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:11:05,900 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 17 states. [2018-06-22 02:11:06,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:06,078 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-22 02:11:06,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:11:06,079 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-22 02:11:06,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:06,079 INFO ]: With dead ends: 22 [2018-06-22 02:11:06,079 INFO ]: Without dead ends: 22 [2018-06-22 02:11:06,079 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:11:06,080 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 02:11:06,081 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 02:11:06,081 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 02:11:06,081 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-22 02:11:06,081 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-22 02:11:06,082 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:06,082 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-22 02:11:06,082 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:11:06,082 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-22 02:11:06,082 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:11:06,082 INFO ]: Found error trace [2018-06-22 02:11:06,082 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:06,082 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:06,082 INFO ]: Analyzing trace with hash -1647027146, now seen corresponding path program 14 times [2018-06-22 02:11:06,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:06,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:06,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:06,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:06,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:06,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:07,212 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:07,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:07,212 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:11:07,234 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:07,323 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:07,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:07,331 INFO ]: Computing forward predicates... [2018-06-22 02:11:07,487 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:07,519 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:07,519 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-06-22 02:11:07,520 INFO ]: Interpolant automaton has 19 states [2018-06-22 02:11:07,520 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 02:11:07,520 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:11:07,520 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-22 02:11:07,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:07,712 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-22 02:11:07,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 02:11:07,713 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-22 02:11:07,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:07,713 INFO ]: With dead ends: 23 [2018-06-22 02:11:07,713 INFO ]: Without dead ends: 23 [2018-06-22 02:11:07,713 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:11:07,713 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 02:11:07,715 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 02:11:07,715 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 02:11:07,715 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-22 02:11:07,716 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-22 02:11:07,716 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:07,716 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-22 02:11:07,716 INFO ]: Interpolant automaton has 19 states. [2018-06-22 02:11:07,716 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-22 02:11:07,716 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:11:07,716 INFO ]: Found error trace [2018-06-22 02:11:07,716 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:07,716 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:07,716 INFO ]: Analyzing trace with hash 482594551, now seen corresponding path program 15 times [2018-06-22 02:11:07,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:07,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:07,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:07,717 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:07,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:07,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:08,289 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:08,289 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:08,289 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:11:08,294 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:08,356 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 02:11:08,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:08,363 INFO ]: Computing forward predicates... [2018-06-22 02:11:08,422 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:08,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:08,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-22 02:11:08,442 INFO ]: Interpolant automaton has 19 states [2018-06-22 02:11:08,442 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 02:11:08,442 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:11:08,442 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 19 states. [2018-06-22 02:11:08,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:08,718 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-22 02:11:08,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:11:08,719 INFO ]: Start accepts. Automaton has 19 states. Word has length 22 [2018-06-22 02:11:08,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:08,719 INFO ]: With dead ends: 24 [2018-06-22 02:11:08,719 INFO ]: Without dead ends: 24 [2018-06-22 02:11:08,719 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:11:08,719 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 02:11:08,724 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 02:11:08,724 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 02:11:08,724 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-22 02:11:08,724 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-22 02:11:08,724 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:08,724 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-22 02:11:08,724 INFO ]: Interpolant automaton has 19 states. [2018-06-22 02:11:08,724 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-22 02:11:08,725 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:11:08,725 INFO ]: Found error trace [2018-06-22 02:11:08,725 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:08,725 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:08,725 INFO ]: Analyzing trace with hash 2076357718, now seen corresponding path program 16 times [2018-06-22 02:11:08,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:08,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:08,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:08,728 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:08,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:08,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:09,325 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:09,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:09,325 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:11:09,346 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:09,431 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:09,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:09,441 INFO ]: Computing forward predicates... [2018-06-22 02:11:09,740 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:09,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:09,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-22 02:11:09,761 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:11:09,761 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:11:09,761 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:11:09,761 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 20 states. [2018-06-22 02:11:09,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:09,995 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-22 02:11:09,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:11:09,995 INFO ]: Start accepts. Automaton has 20 states. Word has length 23 [2018-06-22 02:11:09,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:09,995 INFO ]: With dead ends: 25 [2018-06-22 02:11:09,995 INFO ]: Without dead ends: 25 [2018-06-22 02:11:09,995 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:11:09,996 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 02:11:09,997 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 02:11:09,997 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 02:11:09,998 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-22 02:11:09,998 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-22 02:11:09,998 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:09,998 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-22 02:11:09,998 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:11:09,998 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-22 02:11:10,000 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:11:10,000 INFO ]: Found error trace [2018-06-22 02:11:10,000 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:10,000 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:10,000 INFO ]: Analyzing trace with hash -56591657, now seen corresponding path program 17 times [2018-06-22 02:11:10,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:10,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:10,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:10,000 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:10,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:10,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:10,499 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:10,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:10,499 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:11:10,507 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:10,707 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 02:11:10,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:10,726 INFO ]: Computing forward predicates... [2018-06-22 02:11:10,854 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:10,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:10,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-22 02:11:10,882 INFO ]: Interpolant automaton has 21 states [2018-06-22 02:11:10,882 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 02:11:10,882 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:11:10,882 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 21 states. [2018-06-22 02:11:11,182 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:11,182 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-22 02:11:11,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 02:11:11,182 INFO ]: Start accepts. Automaton has 21 states. Word has length 24 [2018-06-22 02:11:11,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:11,183 INFO ]: With dead ends: 26 [2018-06-22 02:11:11,183 INFO ]: Without dead ends: 26 [2018-06-22 02:11:11,183 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:11:11,183 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 02:11:11,185 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 02:11:11,185 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 02:11:11,185 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-22 02:11:11,185 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-22 02:11:11,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:11,185 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-22 02:11:11,185 INFO ]: Interpolant automaton has 21 states. [2018-06-22 02:11:11,185 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-22 02:11:11,186 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:11:11,186 INFO ]: Found error trace [2018-06-22 02:11:11,186 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:11,186 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:11,186 INFO ]: Analyzing trace with hash -1753512842, now seen corresponding path program 18 times [2018-06-22 02:11:11,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:11,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:11,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:11,187 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:11,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:11,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:12,065 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:12,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:12,065 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:11:12,073 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:12,165 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 02:11:12,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:12,174 INFO ]: Computing forward predicates... [2018-06-22 02:11:12,250 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:12,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:12,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-22 02:11:12,275 INFO ]: Interpolant automaton has 23 states [2018-06-22 02:11:12,275 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 02:11:12,275 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:11:12,275 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-22 02:11:12,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:12,525 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-22 02:11:12,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 02:11:12,548 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-22 02:11:12,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:12,549 INFO ]: With dead ends: 27 [2018-06-22 02:11:12,549 INFO ]: Without dead ends: 27 [2018-06-22 02:11:12,549 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:11:12,549 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 02:11:12,551 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 02:11:12,551 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 02:11:12,551 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-22 02:11:12,551 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-22 02:11:12,551 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:12,551 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-22 02:11:12,551 INFO ]: Interpolant automaton has 23 states. [2018-06-22 02:11:12,551 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-22 02:11:12,552 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 02:11:12,552 INFO ]: Found error trace [2018-06-22 02:11:12,552 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:12,552 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:12,552 INFO ]: Analyzing trace with hash 1476505271, now seen corresponding path program 19 times [2018-06-22 02:11:12,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:12,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:12,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:12,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:12,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:12,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:13,190 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:13,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:13,190 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:11:13,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:13,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:13,330 INFO ]: Computing forward predicates... [2018-06-22 02:11:13,476 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:13,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:13,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-06-22 02:11:13,497 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:11:13,497 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:11:13,497 INFO ]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:11:13,497 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-22 02:11:13,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:13,841 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-22 02:11:13,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:11:13,842 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-22 02:11:13,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:13,842 INFO ]: With dead ends: 28 [2018-06-22 02:11:13,842 INFO ]: Without dead ends: 28 [2018-06-22 02:11:13,843 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:11:13,843 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 02:11:13,845 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 02:11:13,845 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 02:11:13,845 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-22 02:11:13,845 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-22 02:11:13,845 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:13,845 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-22 02:11:13,845 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:11:13,845 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-22 02:11:13,846 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 02:11:13,846 INFO ]: Found error trace [2018-06-22 02:11:13,846 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:13,846 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:13,846 INFO ]: Analyzing trace with hash -1472148330, now seen corresponding path program 20 times [2018-06-22 02:11:13,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:13,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:13,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:13,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:13,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:13,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:14,466 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:14,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:14,466 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:11:14,472 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:14,552 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:14,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:14,563 INFO ]: Computing forward predicates... [2018-06-22 02:11:14,613 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:14,633 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:14,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-22 02:11:14,633 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:11:14,633 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:11:14,634 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:11:14,634 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 24 states. [2018-06-22 02:11:15,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:15,022 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-22 02:11:15,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 02:11:15,023 INFO ]: Start accepts. Automaton has 24 states. Word has length 27 [2018-06-22 02:11:15,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:15,024 INFO ]: With dead ends: 29 [2018-06-22 02:11:15,024 INFO ]: Without dead ends: 29 [2018-06-22 02:11:15,024 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:11:15,024 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 02:11:15,026 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 02:11:15,026 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 02:11:15,026 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-22 02:11:15,027 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-22 02:11:15,027 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:15,027 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-22 02:11:15,027 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:11:15,027 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-22 02:11:15,027 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:11:15,027 INFO ]: Found error trace [2018-06-22 02:11:15,027 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:15,027 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:15,027 INFO ]: Analyzing trace with hash 1608870551, now seen corresponding path program 21 times [2018-06-22 02:11:15,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:15,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:15,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:15,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:15,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:15,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:15,855 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:15,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:15,855 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:11:15,861 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:16,021 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 02:11:16,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:16,030 INFO ]: Computing forward predicates... [2018-06-22 02:11:16,121 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:16,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:16,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-22 02:11:16,142 INFO ]: Interpolant automaton has 26 states [2018-06-22 02:11:16,142 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 02:11:16,142 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-22 02:11:16,142 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-22 02:11:16,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:16,455 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-22 02:11:16,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 02:11:16,456 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-22 02:11:16,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:16,456 INFO ]: With dead ends: 30 [2018-06-22 02:11:16,456 INFO ]: Without dead ends: 30 [2018-06-22 02:11:16,457 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-22 02:11:16,457 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 02:11:16,458 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 02:11:16,458 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 02:11:16,459 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-22 02:11:16,459 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-22 02:11:16,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:16,459 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-22 02:11:16,459 INFO ]: Interpolant automaton has 26 states. [2018-06-22 02:11:16,459 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-22 02:11:16,460 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:11:16,460 INFO ]: Found error trace [2018-06-22 02:11:16,460 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:16,460 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:16,460 INFO ]: Analyzing trace with hash -1663791946, now seen corresponding path program 22 times [2018-06-22 02:11:16,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:16,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:16,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:16,461 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:16,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:16,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:18,144 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:18,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:18,232 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:18,237 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:18,394 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:18,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:18,409 INFO ]: Computing forward predicates... [2018-06-22 02:11:18,566 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:18,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:18,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-06-22 02:11:18,586 INFO ]: Interpolant automaton has 27 states [2018-06-22 02:11:18,587 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 02:11:18,587 INFO ]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:11:18,587 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-22 02:11:19,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:19,086 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-22 02:11:19,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 02:11:19,087 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-22 02:11:19,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:19,087 INFO ]: With dead ends: 31 [2018-06-22 02:11:19,087 INFO ]: Without dead ends: 31 [2018-06-22 02:11:19,088 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:11:19,088 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 02:11:19,090 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 02:11:19,090 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 02:11:19,090 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-22 02:11:19,090 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-22 02:11:19,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:19,090 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-22 02:11:19,090 INFO ]: Interpolant automaton has 27 states. [2018-06-22 02:11:19,090 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-22 02:11:19,096 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:11:19,096 INFO ]: Found error trace [2018-06-22 02:11:19,096 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:19,096 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:19,096 INFO ]: Analyzing trace with hash -37114249, now seen corresponding path program 23 times [2018-06-22 02:11:19,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:19,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:19,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:19,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:19,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:19,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:19,910 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:19,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:19,910 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:19,916 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:20,014 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-22 02:11:20,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:20,029 INFO ]: Computing forward predicates... [2018-06-22 02:11:20,143 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:20,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:20,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-06-22 02:11:20,164 INFO ]: Interpolant automaton has 28 states [2018-06-22 02:11:20,164 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 02:11:20,164 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:11:20,165 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-22 02:11:20,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:20,520 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-22 02:11:20,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 02:11:20,520 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-22 02:11:20,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:20,520 INFO ]: With dead ends: 32 [2018-06-22 02:11:20,520 INFO ]: Without dead ends: 32 [2018-06-22 02:11:20,521 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:11:20,521 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 02:11:20,525 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 02:11:20,525 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 02:11:20,525 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-22 02:11:20,525 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-22 02:11:20,525 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:20,525 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-22 02:11:20,525 INFO ]: Interpolant automaton has 28 states. [2018-06-22 02:11:20,525 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-22 02:11:20,526 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:11:20,526 INFO ]: Found error trace [2018-06-22 02:11:20,526 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:20,526 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:20,526 INFO ]: Analyzing trace with hash -1149713194, now seen corresponding path program 24 times [2018-06-22 02:11:20,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:20,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:20,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:20,527 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:20,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:20,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:21,735 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:21,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:21,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:21,746 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:21,836 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-22 02:11:21,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:21,848 INFO ]: Computing forward predicates... [2018-06-22 02:11:21,981 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:22,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:22,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-22 02:11:22,002 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:11:22,002 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:11:22,002 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:11:22,003 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-22 02:11:22,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:22,405 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-22 02:11:22,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 02:11:22,406 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-22 02:11:22,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:22,406 INFO ]: With dead ends: 33 [2018-06-22 02:11:22,406 INFO ]: Without dead ends: 33 [2018-06-22 02:11:22,406 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:11:22,406 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 02:11:22,408 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 02:11:22,408 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 02:11:22,409 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-22 02:11:22,409 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-22 02:11:22,409 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:22,409 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-22 02:11:22,409 INFO ]: Interpolant automaton has 29 states. [2018-06-22 02:11:22,409 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-22 02:11:22,411 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:11:22,411 INFO ]: Found error trace [2018-06-22 02:11:22,411 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:22,411 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:22,411 INFO ]: Analyzing trace with hash -1280542121, now seen corresponding path program 25 times [2018-06-22 02:11:22,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:22,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:22,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:22,412 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:22,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:22,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:23,585 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:23,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:23,585 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:23,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:23,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:23,829 INFO ]: Computing forward predicates... [2018-06-22 02:11:24,006 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:24,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:24,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-22 02:11:24,027 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:11:24,027 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:11:24,027 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:11:24,028 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 29 states. [2018-06-22 02:11:24,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:24,492 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-22 02:11:24,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:11:24,494 INFO ]: Start accepts. Automaton has 29 states. Word has length 32 [2018-06-22 02:11:24,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:24,494 INFO ]: With dead ends: 34 [2018-06-22 02:11:24,494 INFO ]: Without dead ends: 34 [2018-06-22 02:11:24,494 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:11:24,494 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 02:11:24,496 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 02:11:24,496 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 02:11:24,497 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-22 02:11:24,497 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-22 02:11:24,497 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:24,497 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-22 02:11:24,497 INFO ]: Interpolant automaton has 29 states. [2018-06-22 02:11:24,497 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-22 02:11:24,498 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 02:11:24,498 INFO ]: Found error trace [2018-06-22 02:11:24,498 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:24,498 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:24,498 INFO ]: Analyzing trace with hash -1041271562, now seen corresponding path program 26 times [2018-06-22 02:11:24,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:24,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:24,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:24,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:24,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:24,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:25,248 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:25,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:25,248 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:25,257 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:25,399 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:25,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:25,415 INFO ]: Computing forward predicates... [2018-06-22 02:11:25,570 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:25,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:25,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-22 02:11:25,591 INFO ]: Interpolant automaton has 30 states [2018-06-22 02:11:25,591 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 02:11:25,591 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:11:25,592 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 30 states. [2018-06-22 02:11:26,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:26,027 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-22 02:11:26,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 02:11:26,028 INFO ]: Start accepts. Automaton has 30 states. Word has length 33 [2018-06-22 02:11:26,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:26,029 INFO ]: With dead ends: 35 [2018-06-22 02:11:26,029 INFO ]: Without dead ends: 35 [2018-06-22 02:11:26,029 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:11:26,029 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 02:11:26,031 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 02:11:26,031 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 02:11:26,031 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-22 02:11:26,031 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-22 02:11:26,031 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:26,031 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-22 02:11:26,031 INFO ]: Interpolant automaton has 30 states. [2018-06-22 02:11:26,031 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-22 02:11:26,032 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 02:11:26,032 INFO ]: Found error trace [2018-06-22 02:11:26,032 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:26,032 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:26,032 INFO ]: Analyzing trace with hash 2081148471, now seen corresponding path program 27 times [2018-06-22 02:11:26,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:26,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:26,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:26,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:26,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:26,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:27,182 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:27,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:27,182 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:27,187 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:27,298 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-22 02:11:27,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:27,313 INFO ]: Computing forward predicates... [2018-06-22 02:11:27,467 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:27,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:27,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-22 02:11:27,490 INFO ]: Interpolant automaton has 31 states [2018-06-22 02:11:27,490 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 02:11:27,490 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-22 02:11:27,490 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 31 states. [2018-06-22 02:11:28,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:28,046 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-22 02:11:28,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 02:11:28,046 INFO ]: Start accepts. Automaton has 31 states. Word has length 34 [2018-06-22 02:11:28,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:28,047 INFO ]: With dead ends: 36 [2018-06-22 02:11:28,047 INFO ]: Without dead ends: 36 [2018-06-22 02:11:28,047 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-22 02:11:28,047 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 02:11:28,049 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 02:11:28,049 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 02:11:28,049 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-22 02:11:28,049 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-22 02:11:28,049 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:28,049 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-22 02:11:28,049 INFO ]: Interpolant automaton has 31 states. [2018-06-22 02:11:28,049 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-22 02:11:28,050 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 02:11:28,050 INFO ]: Found error trace [2018-06-22 02:11:28,050 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:28,050 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:28,050 INFO ]: Analyzing trace with hash 91921686, now seen corresponding path program 28 times [2018-06-22 02:11:28,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:28,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:28,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:28,050 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:28,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:28,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:29,757 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:29,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:29,757 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:29,764 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:30,063 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:30,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:30,084 INFO ]: Computing forward predicates... [2018-06-22 02:11:30,173 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:30,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:30,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-22 02:11:30,194 INFO ]: Interpolant automaton has 32 states [2018-06-22 02:11:30,195 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 02:11:30,195 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 02:11:30,195 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 32 states. [2018-06-22 02:11:30,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:30,686 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-22 02:11:30,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 02:11:30,687 INFO ]: Start accepts. Automaton has 32 states. Word has length 35 [2018-06-22 02:11:30,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:30,687 INFO ]: With dead ends: 37 [2018-06-22 02:11:30,687 INFO ]: Without dead ends: 37 [2018-06-22 02:11:30,687 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 02:11:30,687 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 02:11:30,689 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 02:11:30,689 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 02:11:30,690 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-22 02:11:30,690 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-22 02:11:30,690 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:30,690 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-22 02:11:30,690 INFO ]: Interpolant automaton has 32 states. [2018-06-22 02:11:30,690 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-22 02:11:30,690 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 02:11:30,690 INFO ]: Found error trace [2018-06-22 02:11:30,690 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:30,690 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:30,690 INFO ]: Analyzing trace with hash -1444566505, now seen corresponding path program 29 times [2018-06-22 02:11:30,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:30,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:30,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:30,691 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:30,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:30,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:32,316 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:32,316 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:32,316 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:32,322 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:11:32,465 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-22 02:11:32,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:32,480 INFO ]: Computing forward predicates... [2018-06-22 02:11:32,615 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:32,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:32,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-22 02:11:32,636 INFO ]: Interpolant automaton has 33 states [2018-06-22 02:11:32,636 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 02:11:32,636 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:11:32,636 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 33 states. [2018-06-22 02:11:33,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:33,250 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-22 02:11:33,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 02:11:33,251 INFO ]: Start accepts. Automaton has 33 states. Word has length 36 [2018-06-22 02:11:33,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:33,251 INFO ]: With dead ends: 38 [2018-06-22 02:11:33,251 INFO ]: Without dead ends: 38 [2018-06-22 02:11:33,252 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 02:11:33,252 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 02:11:33,254 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 02:11:33,254 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 02:11:33,262 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-22 02:11:33,262 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-22 02:11:33,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:33,262 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-22 02:11:33,262 INFO ]: Interpolant automaton has 33 states. [2018-06-22 02:11:33,262 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-22 02:11:33,263 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 02:11:33,263 INFO ]: Found error trace [2018-06-22 02:11:33,263 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:33,263 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:33,263 INFO ]: Analyzing trace with hash -1831060170, now seen corresponding path program 30 times [2018-06-22 02:11:33,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:33,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:33,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:33,264 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:33,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:33,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:34,414 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:34,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:34,414 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:34,423 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:11:34,572 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-22 02:11:34,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:34,588 INFO ]: Computing forward predicates... [2018-06-22 02:11:34,657 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:34,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:34,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-22 02:11:34,679 INFO ]: Interpolant automaton has 34 states [2018-06-22 02:11:34,679 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 02:11:34,679 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 02:11:34,680 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 34 states. [2018-06-22 02:11:35,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:35,253 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-22 02:11:35,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 02:11:35,254 INFO ]: Start accepts. Automaton has 34 states. Word has length 37 [2018-06-22 02:11:35,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:35,254 INFO ]: With dead ends: 39 [2018-06-22 02:11:35,254 INFO ]: Without dead ends: 39 [2018-06-22 02:11:35,254 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 02:11:35,254 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 02:11:35,258 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 02:11:35,258 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 02:11:35,258 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-22 02:11:35,258 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-22 02:11:35,258 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:35,258 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-22 02:11:35,258 INFO ]: Interpolant automaton has 34 states. [2018-06-22 02:11:35,258 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-22 02:11:35,259 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 02:11:35,259 INFO ]: Found error trace [2018-06-22 02:11:35,259 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:35,259 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:35,259 INFO ]: Analyzing trace with hash -927461897, now seen corresponding path program 31 times [2018-06-22 02:11:35,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:35,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:35,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:35,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:35,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:35,391 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:36,757 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:36,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:36,757 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:36,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:37,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:37,144 INFO ]: Computing forward predicates... [2018-06-22 02:11:37,213 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:37,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:37,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-22 02:11:37,234 INFO ]: Interpolant automaton has 35 states [2018-06-22 02:11:37,234 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 02:11:37,235 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:11:37,235 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 35 states. [2018-06-22 02:11:37,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:37,910 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-22 02:11:37,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 02:11:37,911 INFO ]: Start accepts. Automaton has 35 states. Word has length 38 [2018-06-22 02:11:37,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:37,911 INFO ]: With dead ends: 40 [2018-06-22 02:11:37,911 INFO ]: Without dead ends: 40 [2018-06-22 02:11:37,911 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:11:37,911 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 02:11:37,912 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 02:11:37,912 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 02:11:37,912 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-22 02:11:37,913 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-22 02:11:37,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:37,913 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-22 02:11:37,913 INFO ]: Interpolant automaton has 35 states. [2018-06-22 02:11:37,913 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-22 02:11:37,913 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 02:11:37,913 INFO ]: Found error trace [2018-06-22 02:11:37,913 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:37,913 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:37,913 INFO ]: Analyzing trace with hash 1314280790, now seen corresponding path program 32 times [2018-06-22 02:11:37,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:37,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:37,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:37,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:11:37,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:38,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:39,593 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:39,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:39,593 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:39,599 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:11:39,801 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:11:39,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:39,827 INFO ]: Computing forward predicates... [2018-06-22 02:11:40,038 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:40,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:40,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-06-22 02:11:40,057 INFO ]: Interpolant automaton has 37 states [2018-06-22 02:11:40,057 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 02:11:40,058 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:11:40,058 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-22 02:11:40,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:40,868 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-22 02:11:40,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 02:11:40,868 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-22 02:11:40,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:40,869 INFO ]: With dead ends: 41 [2018-06-22 02:11:40,869 INFO ]: Without dead ends: 41 [2018-06-22 02:11:40,869 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:11:40,869 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 02:11:40,870 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 02:11:40,870 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 02:11:40,871 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-22 02:11:40,871 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-22 02:11:40,871 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:40,871 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-22 02:11:40,871 INFO ]: Interpolant automaton has 37 states. [2018-06-22 02:11:40,871 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-22 02:11:40,871 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 02:11:40,871 INFO ]: Found error trace [2018-06-22 02:11:40,871 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:40,871 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:40,871 INFO ]: Analyzing trace with hash 2088827351, now seen corresponding path program 33 times [2018-06-22 02:11:40,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:40,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:40,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:40,872 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:40,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:40,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:42,978 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:42,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:42,979 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:42,984 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:11:43,191 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-22 02:11:43,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:43,219 INFO ]: Computing forward predicates... [2018-06-22 02:11:44,254 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:44,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:44,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-22 02:11:44,287 INFO ]: Interpolant automaton has 37 states [2018-06-22 02:11:44,287 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 02:11:44,287 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:11:44,287 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 37 states. [2018-06-22 02:11:45,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:45,091 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-22 02:11:45,091 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 02:11:45,091 INFO ]: Start accepts. Automaton has 37 states. Word has length 40 [2018-06-22 02:11:45,091 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:45,091 INFO ]: With dead ends: 42 [2018-06-22 02:11:45,091 INFO ]: Without dead ends: 42 [2018-06-22 02:11:45,092 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 02:11:45,092 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 02:11:45,092 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 02:11:45,092 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 02:11:45,093 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-22 02:11:45,093 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-22 02:11:45,093 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:45,093 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-22 02:11:45,093 INFO ]: Interpolant automaton has 37 states. [2018-06-22 02:11:45,093 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-22 02:11:45,093 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 02:11:45,093 INFO ]: Found error trace [2018-06-22 02:11:45,093 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:45,093 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:45,093 INFO ]: Analyzing trace with hash 329966966, now seen corresponding path program 34 times [2018-06-22 02:11:45,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:45,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:45,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:45,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:45,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:45,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:46,736 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:46,736 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:11:46,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:11:46,741 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:11:47,224 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:11:47,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:11:47,253 INFO ]: Computing forward predicates... [2018-06-22 02:11:47,491 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:11:47,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:11:47,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-22 02:11:47,514 INFO ]: Interpolant automaton has 38 states [2018-06-22 02:11:47,514 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 02:11:47,515 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 02:11:47,515 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 38 states. [2018-06-22 02:11:48,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:11:48,314 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-22 02:11:48,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 02:11:48,314 INFO ]: Start accepts. Automaton has 38 states. Word has length 41 [2018-06-22 02:11:48,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:11:48,314 INFO ]: With dead ends: 43 [2018-06-22 02:11:48,314 INFO ]: Without dead ends: 43 [2018-06-22 02:11:48,315 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 02:11:48,315 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 02:11:48,316 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-22 02:11:48,316 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 02:11:48,316 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-22 02:11:48,316 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-22 02:11:48,316 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:11:48,316 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-22 02:11:48,316 INFO ]: Interpolant automaton has 38 states. [2018-06-22 02:11:48,316 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-22 02:11:48,316 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 02:11:48,316 INFO ]: Found error trace [2018-06-22 02:11:48,316 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:11:48,316 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:11:48,316 INFO ]: Analyzing trace with hash 1639869879, now seen corresponding path program 35 times [2018-06-22 02:11:48,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:11:48,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:11:48,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:48,317 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:11:48,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:11:48,426 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 02:11:49,645 WARN ]: Verification canceled [2018-06-22 02:11:49,649 WARN ]: Timeout [2018-06-22 02:11:49,649 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:11:49 BoogieIcfgContainer [2018-06-22 02:11:49,649 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:11:49,650 INFO ]: Toolchain (without parser) took 56214.47 ms. Allocated memory was 308.8 MB in the beginning and 724.0 MB in the end (delta: 415.2 MB). Free memory was 265.2 MB in the beginning and 602.6 MB in the end (delta: -337.4 MB). Peak memory consumption was 77.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:49,652 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:11:49,652 INFO ]: ChcToBoogie took 60.32 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 262.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:49,652 INFO ]: Boogie Preprocessor took 37.96 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 261.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 02:11:49,653 INFO ]: RCFGBuilder took 270.63 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:49,653 INFO ]: TraceAbstraction took 55821.31 ms. Allocated memory was 308.8 MB in the beginning and 724.0 MB in the end (delta: 415.2 MB). Free memory was 252.2 MB in the beginning and 602.6 MB in the end (delta: -350.4 MB). Peak memory consumption was 64.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:11:49,656 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 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.32 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 262.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.96 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 261.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 270.63 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55821.31 ms. Allocated memory was 308.8 MB in the beginning and 724.0 MB in the end (delta: 415.2 MB). Free memory was 252.2 MB in the beginning and 602.6 MB in the end (delta: -350.4 MB). Peak memory consumption was 64.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 35, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 55.7s OverallTime, 39 OverallIterations, 35 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 0 SDslu, 3280 SDs, 0 SdLazy, 16645 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1518 GetRequests, 801 SyntacticMatches, 32 SemanticMatches, 685 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 1707 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 1634 ConstructedInterpolants, 0 QuantifiedInterpolants, 1071034 SizeOfPredicates, 174 NumberOfNonLiveVariables, 18742 ConjunctsInSsa, 11033 ConjunctsInUnsatCore, 73 InterpolantComputations, 3 PerfectInterpolantSequences, 5/14288 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/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-11-49-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-11-49-673.csv Completed graceful shutdown