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_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:43:36,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:43:36,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:43:36,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:43:36,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:43:36,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:43:36,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:43:36,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:43:36,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:43:36,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:43:36,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:43:36,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:43:36,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:43:36,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:43:36,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:43:36,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:43:36,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:43:36,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:43:36,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:43:36,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:43:36,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:43:36,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:43:36,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:43:36,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:43:36,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:43:36,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:43:36,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:43:36,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:43:36,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:43:36,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:43:36,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:43:36,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:43:36,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:43:36,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:43:36,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:43:36,252 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:43:36,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:43:36,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:43:36,274 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:43:36,274 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:43:36,275 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:43:36,275 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:43:36,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:43:36,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:43:36,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:43:36,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:43:36,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:43:36,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:43:36,280 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:43:36,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:43:36,280 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:43:36,280 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:43:36,280 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:43:36,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:43:36,281 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:43:36,282 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:43:36,282 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:43:36,330 INFO ]: Repository-Root is: /tmp [2018-06-22 11:43:36,343 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:43:36,346 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:43:36,347 INFO ]: Initializing SmtParser... [2018-06-22 11:43:36,348 INFO ]: SmtParser initialized [2018-06-22 11:43:36,348 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 [2018-06-22 11:43:36,349 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 11:43:36,446 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7712585c [2018-06-22 11:43:36,702 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 [2018-06-22 11:43:36,707 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:43:36,714 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:43:36,714 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:43:36,714 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:43:36,715 INFO ]: ChcToBoogie initialized [2018-06-22 11:43:36,718 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,775 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36 Unit [2018-06-22 11:43:36,776 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:43:36,776 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:43:36,776 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:43:36,776 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:43:36,799 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,799 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,810 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,811 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,823 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,830 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,831 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (1/1) ... [2018-06-22 11:43:36,833 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:43:36,833 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:43:36,834 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:43:36,834 INFO ]: RCFGBuilder initialized [2018-06-22 11:43:36,834 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (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 11:43:36,852 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:43:36,852 INFO ]: Found specification of procedure False [2018-06-22 11:43:36,852 INFO ]: Found implementation of procedure False [2018-06-22 11:43:36,852 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:43:36,852 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:43:36,852 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:43:36,852 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:43:36,852 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:43:36,852 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 11:43:37,238 INFO ]: Using library mode [2018-06-22 11:43:37,239 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:43:37 BoogieIcfgContainer [2018-06-22 11:43:37,239 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:43:37,241 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:43:37,241 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:43:37,244 INFO ]: TraceAbstraction initialized [2018-06-22 11:43:37,245 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:43:36" (1/3) ... [2018-06-22 11:43:37,246 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1348105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:43:37, skipping insertion in model container [2018-06-22 11:43:37,246 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:36" (2/3) ... [2018-06-22 11:43:37,246 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1348105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:43:37, skipping insertion in model container [2018-06-22 11:43:37,246 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:43:37" (3/3) ... [2018-06-22 11:43:37,248 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:43:37,258 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:43:37,267 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:43:37,318 INFO ]: Using default assertion order modulation [2018-06-22 11:43:37,318 INFO ]: Interprodecural is true [2018-06-22 11:43:37,319 INFO ]: Hoare is false [2018-06-22 11:43:37,319 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:43:37,319 INFO ]: Backedges is TWOTRACK [2018-06-22 11:43:37,319 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:43:37,319 INFO ]: Difference is false [2018-06-22 11:43:37,319 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:43:37,319 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:43:37,341 INFO ]: Start isEmpty. Operand 18 states. [2018-06-22 11:43:37,356 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:43:37,357 INFO ]: Found error trace [2018-06-22 11:43:37,357 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:43:37,358 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:37,363 INFO ]: Analyzing trace with hash 96577029, now seen corresponding path program 1 times [2018-06-22 11:43:37,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:37,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:37,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:37,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:37,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:37,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:37,446 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:37,449 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:37,450 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:43:37,451 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:43:37,464 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:43:37,464 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:43:37,467 INFO ]: Start difference. First operand 18 states. Second operand 2 states. [2018-06-22 11:43:37,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:37,489 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-22 11:43:37,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:43:37,490 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:43:37,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:37,505 INFO ]: With dead ends: 16 [2018-06-22 11:43:37,505 INFO ]: Without dead ends: 16 [2018-06-22 11:43:37,507 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:43:37,521 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:43:37,541 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:43:37,541 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:43:37,542 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-22 11:43:37,543 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 5 [2018-06-22 11:43:37,544 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:37,544 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-22 11:43:37,544 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:43:37,544 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-22 11:43:37,546 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:37,546 INFO ]: Found error trace [2018-06-22 11:43:37,546 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:37,546 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:37,546 INFO ]: Analyzing trace with hash 585196069, now seen corresponding path program 1 times [2018-06-22 11:43:37,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:37,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:37,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:37,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:37,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:37,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:37,621 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:37,621 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:37,621 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:37,622 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:37,623 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:37,623 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:37,623 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-22 11:43:37,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:37,818 INFO ]: Finished difference Result 16 states and 26 transitions. [2018-06-22 11:43:37,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:37,818 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:37,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:37,819 INFO ]: With dead ends: 16 [2018-06-22 11:43:37,819 INFO ]: Without dead ends: 15 [2018-06-22 11:43:37,820 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:37,820 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:43:37,823 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:43:37,823 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:43:37,824 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-22 11:43:37,824 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 9 [2018-06-22 11:43:37,824 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:37,824 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-22 11:43:37,824 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:37,824 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-22 11:43:37,825 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:37,825 INFO ]: Found error trace [2018-06-22 11:43:37,825 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:37,825 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:37,825 INFO ]: Analyzing trace with hash -1594478733, now seen corresponding path program 1 times [2018-06-22 11:43:37,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:37,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:37,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:37,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:37,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:37,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:38,279 WARN ]: Spent 375.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:43:38,355 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:38,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:38,355 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:38,356 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:38,356 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:38,356 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:38,356 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 4 states. [2018-06-22 11:43:38,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:38,685 INFO ]: Finished difference Result 19 states and 32 transitions. [2018-06-22 11:43:38,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:38,687 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:38,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:38,688 INFO ]: With dead ends: 19 [2018-06-22 11:43:38,688 INFO ]: Without dead ends: 19 [2018-06-22 11:43:38,688 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:38,688 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:43:38,698 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:43:38,698 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:43:38,699 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-22 11:43:38,699 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 9 [2018-06-22 11:43:38,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:38,699 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-22 11:43:38,699 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:38,699 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-22 11:43:38,701 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:38,701 INFO ]: Found error trace [2018-06-22 11:43:38,701 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:38,701 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:38,701 INFO ]: Analyzing trace with hash -1810587200, now seen corresponding path program 1 times [2018-06-22 11:43:38,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:38,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:38,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:38,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:38,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:38,726 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:38,992 WARN ]: Spent 208.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 11:43:39,101 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:39,101 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:39,101 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:39,101 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:39,101 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:39,101 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:39,102 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 4 states. [2018-06-22 11:43:39,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:39,300 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 11:43:39,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:39,301 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:39,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:39,302 INFO ]: With dead ends: 19 [2018-06-22 11:43:39,302 INFO ]: Without dead ends: 19 [2018-06-22 11:43:39,302 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:39,302 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:43:39,307 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:43:39,307 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:43:39,307 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-06-22 11:43:39,308 INFO ]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 9 [2018-06-22 11:43:39,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:39,308 INFO ]: Abstraction has 17 states and 29 transitions. [2018-06-22 11:43:39,308 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:39,308 INFO ]: Start isEmpty. Operand 17 states and 29 transitions. [2018-06-22 11:43:39,309 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:39,309 INFO ]: Found error trace [2018-06-22 11:43:39,309 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:39,309 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:39,309 INFO ]: Analyzing trace with hash 304705294, now seen corresponding path program 1 times [2018-06-22 11:43:39,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:39,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:39,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:39,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:39,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:39,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:39,449 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:39,449 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:39,449 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:39,449 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:39,449 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:39,449 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:39,450 INFO ]: Start difference. First operand 17 states and 29 transitions. Second operand 4 states. [2018-06-22 11:43:39,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:39,503 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:43:39,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:39,506 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:39,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:39,507 INFO ]: With dead ends: 19 [2018-06-22 11:43:39,507 INFO ]: Without dead ends: 19 [2018-06-22 11:43:39,507 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:39,507 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:43:39,513 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:43:39,513 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:43:39,514 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 11:43:39,514 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 9 [2018-06-22 11:43:39,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:39,514 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 11:43:39,514 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:39,514 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 11:43:39,515 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:39,515 INFO ]: Found error trace [2018-06-22 11:43:39,515 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:39,515 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:39,516 INFO ]: Analyzing trace with hash -1738148523, now seen corresponding path program 1 times [2018-06-22 11:43:39,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:39,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:39,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:39,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:39,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:39,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:39,718 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:43:39,736 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:39,736 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:39,736 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:43:39,736 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:43:39,736 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:43:39,736 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:39,737 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 5 states. [2018-06-22 11:43:40,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:40,154 INFO ]: Finished difference Result 23 states and 43 transitions. [2018-06-22 11:43:40,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:40,156 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:43:40,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:40,157 INFO ]: With dead ends: 23 [2018-06-22 11:43:40,157 INFO ]: Without dead ends: 23 [2018-06-22 11:43:40,157 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:40,157 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:43:40,165 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:43:40,165 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:43:40,166 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-06-22 11:43:40,166 INFO ]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 13 [2018-06-22 11:43:40,167 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:40,167 INFO ]: Abstraction has 19 states and 34 transitions. [2018-06-22 11:43:40,167 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:43:40,167 INFO ]: Start isEmpty. Operand 19 states and 34 transitions. [2018-06-22 11:43:40,168 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:40,168 INFO ]: Found error trace [2018-06-22 11:43:40,168 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:40,169 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:40,169 INFO ]: Analyzing trace with hash -1477171678, now seen corresponding path program 1 times [2018-06-22 11:43:40,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:40,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:40,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:40,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:40,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:40,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:40,345 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:40,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:40,346 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 11:43:40,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:40,383 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:40,394 INFO ]: Computing forward predicates... [2018-06-22 11:43:40,447 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:40,466 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:43:40,466 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-06-22 11:43:40,467 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:40,467 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:40,467 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:40,467 INFO ]: Start difference. First operand 19 states and 34 transitions. Second operand 7 states. [2018-06-22 11:43:40,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:40,997 INFO ]: Finished difference Result 23 states and 42 transitions. [2018-06-22 11:43:40,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:40,998 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:43:40,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:40,999 INFO ]: With dead ends: 23 [2018-06-22 11:43:40,999 INFO ]: Without dead ends: 23 [2018-06-22 11:43:40,999 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:40,999 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:43:41,003 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:43:41,003 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:43:41,004 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-06-22 11:43:41,004 INFO ]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 13 [2018-06-22 11:43:41,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:41,004 INFO ]: Abstraction has 19 states and 33 transitions. [2018-06-22 11:43:41,004 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:41,004 INFO ]: Start isEmpty. Operand 19 states and 33 transitions. [2018-06-22 11:43:41,005 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:41,005 INFO ]: Found error trace [2018-06-22 11:43:41,005 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:41,005 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:41,006 INFO ]: Analyzing trace with hash -391610768, now seen corresponding path program 1 times [2018-06-22 11:43:41,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:41,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:41,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,161 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:41,161 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:41,161 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:43:41,161 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:43:41,161 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:43:41,161 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:41,161 INFO ]: Start difference. First operand 19 states and 33 transitions. Second operand 5 states. [2018-06-22 11:43:41,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:41,364 INFO ]: Finished difference Result 23 states and 41 transitions. [2018-06-22 11:43:41,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:41,365 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:43:41,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:41,366 INFO ]: With dead ends: 23 [2018-06-22 11:43:41,366 INFO ]: Without dead ends: 23 [2018-06-22 11:43:41,366 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:41,366 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:43:41,371 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-22 11:43:41,371 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:43:41,372 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 11:43:41,372 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 13 [2018-06-22 11:43:41,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:41,372 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 11:43:41,372 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:43:41,372 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 11:43:41,373 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:41,373 INFO ]: Found error trace [2018-06-22 11:43:41,373 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:41,373 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:41,373 INFO ]: Analyzing trace with hash -854619807, now seen corresponding path program 1 times [2018-06-22 11:43:41,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:41,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:41,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,455 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:41,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:41,455 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 11:43:41,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,490 INFO ]: Computing forward predicates... [2018-06-22 11:43:41,532 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:41,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:41,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:43:41,551 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:41,552 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:41,552 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:41,552 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 6 states. [2018-06-22 11:43:41,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:41,611 INFO ]: Finished difference Result 25 states and 47 transitions. [2018-06-22 11:43:41,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:41,614 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:41,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:41,615 INFO ]: With dead ends: 25 [2018-06-22 11:43:41,615 INFO ]: Without dead ends: 25 [2018-06-22 11:43:41,615 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:41,615 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:43:41,620 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:43:41,620 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:43:41,621 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2018-06-22 11:43:41,621 INFO ]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 13 [2018-06-22 11:43:41,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:41,621 INFO ]: Abstraction has 21 states and 38 transitions. [2018-06-22 11:43:41,621 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:41,621 INFO ]: Start isEmpty. Operand 21 states and 38 transitions. [2018-06-22 11:43:41,622 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:41,622 INFO ]: Found error trace [2018-06-22 11:43:41,622 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:41,622 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:41,622 INFO ]: Analyzing trace with hash -593642962, now seen corresponding path program 1 times [2018-06-22 11:43:41,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:41,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:41,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,739 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:41,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:41,739 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 11:43:41,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,772 INFO ]: Computing forward predicates... [2018-06-22 11:43:41,782 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:41,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:41,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:43:41,801 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:41,802 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:41,802 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:41,802 INFO ]: Start difference. First operand 21 states and 38 transitions. Second operand 6 states. [2018-06-22 11:43:41,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:41,911 INFO ]: Finished difference Result 25 states and 45 transitions. [2018-06-22 11:43:41,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:41,912 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:41,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:41,913 INFO ]: With dead ends: 25 [2018-06-22 11:43:41,913 INFO ]: Without dead ends: 25 [2018-06-22 11:43:41,913 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:41,913 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:43:41,922 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:43:41,922 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:43:41,923 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-22 11:43:41,923 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 13 [2018-06-22 11:43:41,923 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:41,923 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-22 11:43:41,923 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:41,923 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-22 11:43:41,924 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:41,924 INFO ]: Found error trace [2018-06-22 11:43:41,924 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:41,924 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:41,924 INFO ]: Analyzing trace with hash -838893815, now seen corresponding path program 1 times [2018-06-22 11:43:41,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:41,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:41,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,027 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:42,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:42,027 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:42,027 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:42,027 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:42,027 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:42,028 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 6 states. [2018-06-22 11:43:42,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:42,131 INFO ]: Finished difference Result 27 states and 51 transitions. [2018-06-22 11:43:42,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:42,132 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:42,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:42,133 INFO ]: With dead ends: 27 [2018-06-22 11:43:42,133 INFO ]: Without dead ends: 27 [2018-06-22 11:43:42,133 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:42,134 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:43:42,139 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:43:42,139 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:43:42,140 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2018-06-22 11:43:42,141 INFO ]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 13 [2018-06-22 11:43:42,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:42,141 INFO ]: Abstraction has 23 states and 42 transitions. [2018-06-22 11:43:42,141 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:42,141 INFO ]: Start isEmpty. Operand 23 states and 42 transitions. [2018-06-22 11:43:42,142 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:42,142 INFO ]: Found error trace [2018-06-22 11:43:42,142 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:42,142 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:42,142 INFO ]: Analyzing trace with hash -1099870660, now seen corresponding path program 1 times [2018-06-22 11:43:42,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:42,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:42,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:42,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:42,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:42,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,328 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:42,328 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:42,328 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 11:43:42,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:42,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,357 INFO ]: Computing forward predicates... [2018-06-22 11:43:42,525 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:42,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:42,557 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:43:42,557 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:42,557 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:42,557 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:42,557 INFO ]: Start difference. First operand 23 states and 42 transitions. Second operand 10 states. [2018-06-22 11:43:42,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:42,848 INFO ]: Finished difference Result 31 states and 62 transitions. [2018-06-22 11:43:42,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:42,849 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:43:42,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:42,850 INFO ]: With dead ends: 31 [2018-06-22 11:43:42,850 INFO ]: Without dead ends: 31 [2018-06-22 11:43:42,850 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:42,850 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:43:42,856 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:43:42,856 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:43:42,857 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2018-06-22 11:43:42,857 INFO ]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 13 [2018-06-22 11:43:42,857 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:42,857 INFO ]: Abstraction has 25 states and 47 transitions. [2018-06-22 11:43:42,857 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:42,857 INFO ]: Start isEmpty. Operand 25 states and 47 transitions. [2018-06-22 11:43:42,858 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:42,858 INFO ]: Found error trace [2018-06-22 11:43:42,858 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:42,858 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:42,858 INFO ]: Analyzing trace with hash 246667095, now seen corresponding path program 1 times [2018-06-22 11:43:42,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:42,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:42,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:42,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:42,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:42,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,974 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:42,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:42,974 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 11:43:42,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:42,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,993 INFO ]: Computing forward predicates... [2018-06-22 11:43:43,009 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:43,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:43,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:43:43,029 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:43,029 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:43,029 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:43,029 INFO ]: Start difference. First operand 25 states and 47 transitions. Second operand 6 states. [2018-06-22 11:43:43,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:43,240 INFO ]: Finished difference Result 31 states and 61 transitions. [2018-06-22 11:43:43,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:43,241 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:43:43,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:43,242 INFO ]: With dead ends: 31 [2018-06-22 11:43:43,242 INFO ]: Without dead ends: 31 [2018-06-22 11:43:43,242 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:43,242 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:43:43,249 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:43:43,249 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:43:43,250 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2018-06-22 11:43:43,250 INFO ]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 13 [2018-06-22 11:43:43,250 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:43,250 INFO ]: Abstraction has 25 states and 46 transitions. [2018-06-22 11:43:43,250 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:43,250 INFO ]: Start isEmpty. Operand 25 states and 46 transitions. [2018-06-22 11:43:43,251 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:43,251 INFO ]: Found error trace [2018-06-22 11:43:43,251 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:43,251 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:43,251 INFO ]: Analyzing trace with hash -560753991, now seen corresponding path program 1 times [2018-06-22 11:43:43,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:43,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:43,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:43,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:43,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:43,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:43,340 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:43,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:43,340 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:43,345 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:43,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:43,364 INFO ]: Computing forward predicates... [2018-06-22 11:43:43,456 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:43,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:43,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:43:43,477 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:43,477 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:43,477 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:43,477 INFO ]: Start difference. First operand 25 states and 46 transitions. Second operand 7 states. [2018-06-22 11:43:43,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:43,702 INFO ]: Finished difference Result 35 states and 74 transitions. [2018-06-22 11:43:43,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:43,703 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:43,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:43,704 INFO ]: With dead ends: 35 [2018-06-22 11:43:43,704 INFO ]: Without dead ends: 35 [2018-06-22 11:43:43,704 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:43,704 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:43:43,710 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 11:43:43,710 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:43:43,711 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 52 transitions. [2018-06-22 11:43:43,711 INFO ]: Start accepts. Automaton has 27 states and 52 transitions. Word has length 17 [2018-06-22 11:43:43,711 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:43,711 INFO ]: Abstraction has 27 states and 52 transitions. [2018-06-22 11:43:43,711 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:43,711 INFO ]: Start isEmpty. Operand 27 states and 52 transitions. [2018-06-22 11:43:43,712 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:43,712 INFO ]: Found error trace [2018-06-22 11:43:43,712 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:43,712 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:43,712 INFO ]: Analyzing trace with hash 2034094531, now seen corresponding path program 1 times [2018-06-22 11:43:43,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:43,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:43,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:43,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:43,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:43,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:43,939 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:43:44,001 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:44,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:44,001 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 11:43:44,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:44,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:44,025 INFO ]: Computing forward predicates... [2018-06-22 11:43:44,067 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:44,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:44,086 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:43:44,086 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:44,086 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:44,086 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:44,086 INFO ]: Start difference. First operand 27 states and 52 transitions. Second operand 8 states. [2018-06-22 11:43:44,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:44,177 INFO ]: Finished difference Result 37 states and 80 transitions. [2018-06-22 11:43:44,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:44,179 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:43:44,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:44,180 INFO ]: With dead ends: 37 [2018-06-22 11:43:44,180 INFO ]: Without dead ends: 37 [2018-06-22 11:43:44,180 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:44,180 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:43:44,187 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-22 11:43:44,187 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:43:44,188 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-06-22 11:43:44,188 INFO ]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 17 [2018-06-22 11:43:44,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:44,188 INFO ]: Abstraction has 29 states and 58 transitions. [2018-06-22 11:43:44,188 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:44,188 INFO ]: Start isEmpty. Operand 29 states and 58 transitions. [2018-06-22 11:43:44,189 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:44,189 INFO ]: Found error trace [2018-06-22 11:43:44,189 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:44,189 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:44,189 INFO ]: Analyzing trace with hash 1379434768, now seen corresponding path program 1 times [2018-06-22 11:43:44,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:44,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:44,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:44,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:44,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:44,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:44,293 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:44,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:44,293 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 11:43:44,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:44,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:44,323 INFO ]: Computing forward predicates... [2018-06-22 11:43:44,662 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:44,681 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:44,681 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:43:44,681 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:44,681 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:44,681 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:44,681 INFO ]: Start difference. First operand 29 states and 58 transitions. Second operand 7 states. [2018-06-22 11:43:44,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:44,821 INFO ]: Finished difference Result 37 states and 78 transitions. [2018-06-22 11:43:44,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:44,821 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:44,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:44,822 INFO ]: With dead ends: 37 [2018-06-22 11:43:44,822 INFO ]: Without dead ends: 37 [2018-06-22 11:43:44,822 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:44,822 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:43:44,827 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-06-22 11:43:44,828 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:43:44,828 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 52 transitions. [2018-06-22 11:43:44,828 INFO ]: Start accepts. Automaton has 27 states and 52 transitions. Word has length 17 [2018-06-22 11:43:44,828 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:44,828 INFO ]: Abstraction has 27 states and 52 transitions. [2018-06-22 11:43:44,828 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:44,829 INFO ]: Start isEmpty. Operand 27 states and 52 transitions. [2018-06-22 11:43:44,829 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:44,829 INFO ]: Found error trace [2018-06-22 11:43:44,829 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:44,829 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:44,829 INFO ]: Analyzing trace with hash -1677906069, now seen corresponding path program 1 times [2018-06-22 11:43:44,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:44,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:44,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:44,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:44,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:44,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,017 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:45,017 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:45,017 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 11:43:45,023 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:45,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,045 INFO ]: Computing forward predicates... [2018-06-22 11:43:45,090 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:45,114 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:45,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-06-22 11:43:45,114 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:45,115 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:45,115 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:45,115 INFO ]: Start difference. First operand 27 states and 52 transitions. Second operand 9 states. [2018-06-22 11:43:45,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:45,281 INFO ]: Finished difference Result 35 states and 73 transitions. [2018-06-22 11:43:45,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:45,282 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:43:45,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:45,282 INFO ]: With dead ends: 35 [2018-06-22 11:43:45,282 INFO ]: Without dead ends: 35 [2018-06-22 11:43:45,283 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:45,283 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:43:45,287 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 11:43:45,287 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:43:45,288 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2018-06-22 11:43:45,288 INFO ]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 17 [2018-06-22 11:43:45,288 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:45,288 INFO ]: Abstraction has 27 states and 51 transitions. [2018-06-22 11:43:45,288 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:45,288 INFO ]: Start isEmpty. Operand 27 states and 51 transitions. [2018-06-22 11:43:45,289 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:45,289 INFO ]: Found error trace [2018-06-22 11:43:45,289 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:45,289 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:45,289 INFO ]: Analyzing trace with hash -1023246306, now seen corresponding path program 1 times [2018-06-22 11:43:45,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:45,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:45,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:45,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:45,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:45,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,352 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:45,352 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:45,352 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 11:43:45,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:45,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,372 INFO ]: Computing forward predicates... [2018-06-22 11:43:45,454 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:45,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:45,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:43:45,473 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:43:45,473 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:43:45,473 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:45,473 INFO ]: Start difference. First operand 27 states and 51 transitions. Second operand 12 states. [2018-06-22 11:43:45,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:45,771 INFO ]: Finished difference Result 41 states and 90 transitions. [2018-06-22 11:43:45,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:45,771 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:43:45,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:45,772 INFO ]: With dead ends: 41 [2018-06-22 11:43:45,772 INFO ]: Without dead ends: 41 [2018-06-22 11:43:45,772 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:43:45,772 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:43:45,777 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 23. [2018-06-22 11:43:45,777 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:43:45,778 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2018-06-22 11:43:45,778 INFO ]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 17 [2018-06-22 11:43:45,778 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:45,778 INFO ]: Abstraction has 23 states and 42 transitions. [2018-06-22 11:43:45,778 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:43:45,778 INFO ]: Start isEmpty. Operand 23 states and 42 transitions. [2018-06-22 11:43:45,779 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:45,779 INFO ]: Found error trace [2018-06-22 11:43:45,779 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:45,779 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:45,779 INFO ]: Analyzing trace with hash -2129165629, now seen corresponding path program 2 times [2018-06-22 11:43:45,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:45,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:45,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:45,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:45,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:45,785 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,954 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:45,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:45,955 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:45,955 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:45,955 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:45,955 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:45,955 INFO ]: Start difference. First operand 23 states and 42 transitions. Second operand 6 states. [2018-06-22 11:43:46,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:46,085 INFO ]: Finished difference Result 56 states and 135 transitions. [2018-06-22 11:43:46,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:46,086 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:43:46,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:46,086 INFO ]: With dead ends: 56 [2018-06-22 11:43:46,086 INFO ]: Without dead ends: 56 [2018-06-22 11:43:46,087 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:46,087 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:43:46,095 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-06-22 11:43:46,095 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:43:46,095 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2018-06-22 11:43:46,095 INFO ]: Start accepts. Automaton has 38 states and 85 transitions. Word has length 17 [2018-06-22 11:43:46,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:46,096 INFO ]: Abstraction has 38 states and 85 transitions. [2018-06-22 11:43:46,096 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:46,096 INFO ]: Start isEmpty. Operand 38 states and 85 transitions. [2018-06-22 11:43:46,097 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:46,097 INFO ]: Found error trace [2018-06-22 11:43:46,097 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:46,097 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:46,097 INFO ]: Analyzing trace with hash 1511141904, now seen corresponding path program 2 times [2018-06-22 11:43:46,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:46,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:46,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:46,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,102 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:46,143 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:46,143 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:46,143 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:46,143 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:46,143 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:46,143 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:46,143 INFO ]: Start difference. First operand 38 states and 85 transitions. Second operand 4 states. [2018-06-22 11:43:46,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:46,225 INFO ]: Finished difference Result 46 states and 95 transitions. [2018-06-22 11:43:46,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:43:46,225 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:43:46,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:46,226 INFO ]: With dead ends: 46 [2018-06-22 11:43:46,226 INFO ]: Without dead ends: 46 [2018-06-22 11:43:46,226 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:46,226 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:43:46,235 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-06-22 11:43:46,235 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:43:46,236 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 71 transitions. [2018-06-22 11:43:46,236 INFO ]: Start accepts. Automaton has 36 states and 71 transitions. Word has length 17 [2018-06-22 11:43:46,236 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:46,236 INFO ]: Abstraction has 36 states and 71 transitions. [2018-06-22 11:43:46,236 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:46,236 INFO ]: Start isEmpty. Operand 36 states and 71 transitions. [2018-06-22 11:43:46,237 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:46,237 INFO ]: Found error trace [2018-06-22 11:43:46,237 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:46,237 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:46,237 INFO ]: Analyzing trace with hash 1939292458, now seen corresponding path program 1 times [2018-06-22 11:43:46,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:46,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:46,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,238 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:46,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:46,293 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:46,293 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:46,293 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:46,293 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:46,294 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:46,294 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:46,294 INFO ]: Start difference. First operand 36 states and 71 transitions. Second operand 6 states. [2018-06-22 11:43:46,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:46,588 INFO ]: Finished difference Result 60 states and 124 transitions. [2018-06-22 11:43:46,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:46,588 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:43:46,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:46,589 INFO ]: With dead ends: 60 [2018-06-22 11:43:46,589 INFO ]: Without dead ends: 60 [2018-06-22 11:43:46,589 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:46,590 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:43:46,600 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-06-22 11:43:46,600 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:43:46,601 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2018-06-22 11:43:46,601 INFO ]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 17 [2018-06-22 11:43:46,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:46,601 INFO ]: Abstraction has 42 states and 86 transitions. [2018-06-22 11:43:46,601 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:46,601 INFO ]: Start isEmpty. Operand 42 states and 86 transitions. [2018-06-22 11:43:46,602 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:46,602 INFO ]: Found error trace [2018-06-22 11:43:46,602 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:46,602 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:46,602 INFO ]: Analyzing trace with hash 1284632695, now seen corresponding path program 1 times [2018-06-22 11:43:46,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:46,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:46,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:46,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:46,692 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:46,692 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:46,692 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:46,692 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:46,692 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:46,692 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:46,693 INFO ]: Start difference. First operand 42 states and 86 transitions. Second operand 4 states. [2018-06-22 11:43:46,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:46,791 INFO ]: Finished difference Result 34 states and 59 transitions. [2018-06-22 11:43:46,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:43:46,793 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:43:46,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:46,793 INFO ]: With dead ends: 34 [2018-06-22 11:43:46,793 INFO ]: Without dead ends: 29 [2018-06-22 11:43:46,794 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:46,794 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:43:46,797 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:43:46,797 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:43:46,797 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2018-06-22 11:43:46,797 INFO ]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 17 [2018-06-22 11:43:46,798 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:46,798 INFO ]: Abstraction has 25 states and 42 transitions. [2018-06-22 11:43:46,798 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:46,798 INFO ]: Start isEmpty. Operand 25 states and 42 transitions. [2018-06-22 11:43:46,798 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:46,798 INFO ]: Found error trace [2018-06-22 11:43:46,798 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:46,798 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:46,798 INFO ]: Analyzing trace with hash 2048273451, now seen corresponding path program 2 times [2018-06-22 11:43:46,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:46,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:46,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:46,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:46,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:46,934 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:46,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:46,934 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 11:43:46,940 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:46,959 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:46,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:46,960 INFO ]: Computing forward predicates... [2018-06-22 11:43:46,989 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:47,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:47,009 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:43:47,009 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:47,009 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:47,009 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:47,009 INFO ]: Start difference. First operand 25 states and 42 transitions. Second operand 9 states. [2018-06-22 11:43:47,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:47,273 INFO ]: Finished difference Result 45 states and 80 transitions. [2018-06-22 11:43:47,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:43:47,273 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:43:47,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:47,274 INFO ]: With dead ends: 45 [2018-06-22 11:43:47,274 INFO ]: Without dead ends: 45 [2018-06-22 11:43:47,274 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:47,274 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:43:47,277 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-06-22 11:43:47,277 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:43:47,278 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2018-06-22 11:43:47,278 INFO ]: Start accepts. Automaton has 31 states and 57 transitions. Word has length 17 [2018-06-22 11:43:47,278 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:47,278 INFO ]: Abstraction has 31 states and 57 transitions. [2018-06-22 11:43:47,278 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:47,278 INFO ]: Start isEmpty. Operand 31 states and 57 transitions. [2018-06-22 11:43:47,279 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:47,279 INFO ]: Found error trace [2018-06-22 11:43:47,279 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:47,279 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:47,279 INFO ]: Analyzing trace with hash -1129541767, now seen corresponding path program 2 times [2018-06-22 11:43:47,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:47,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:47,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:47,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:47,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:47,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:47,533 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 11:43:47,543 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:47,543 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:47,543 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 11:43:47,549 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:47,560 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:47,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:47,562 INFO ]: Computing forward predicates... [2018-06-22 11:43:47,885 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:47,919 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:47,919 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 11:43:47,919 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:43:47,919 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:43:47,919 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:47,920 INFO ]: Start difference. First operand 31 states and 57 transitions. Second operand 12 states. [2018-06-22 11:43:48,148 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 11:43:48,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:48,794 INFO ]: Finished difference Result 71 states and 122 transitions. [2018-06-22 11:43:48,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:43:48,795 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:43:48,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:48,796 INFO ]: With dead ends: 71 [2018-06-22 11:43:48,796 INFO ]: Without dead ends: 64 [2018-06-22 11:43:48,796 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:43:48,796 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:43:48,802 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 40. [2018-06-22 11:43:48,802 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:43:48,802 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2018-06-22 11:43:48,802 INFO ]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 17 [2018-06-22 11:43:48,803 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:48,803 INFO ]: Abstraction has 40 states and 63 transitions. [2018-06-22 11:43:48,803 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:43:48,803 INFO ]: Start isEmpty. Operand 40 states and 63 transitions. [2018-06-22 11:43:48,803 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:48,803 INFO ]: Found error trace [2018-06-22 11:43:48,803 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:48,803 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:48,804 INFO ]: Analyzing trace with hash 584137783, now seen corresponding path program 2 times [2018-06-22 11:43:48,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:48,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:48,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:48,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:48,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:48,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:49,111 WARN ]: Spent 256.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 11:43:49,380 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:43:49,617 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:49,617 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:49,617 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 11:43:49,623 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:49,634 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:49,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:49,635 INFO ]: Computing forward predicates... [2018-06-22 11:43:49,796 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:49,817 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:49,817 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-06-22 11:43:49,818 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:49,818 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:49,818 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:49,818 INFO ]: Start difference. First operand 40 states and 63 transitions. Second operand 9 states. [2018-06-22 11:43:49,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:49,950 INFO ]: Finished difference Result 62 states and 98 transitions. [2018-06-22 11:43:49,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:49,950 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:43:49,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:49,951 INFO ]: With dead ends: 62 [2018-06-22 11:43:49,951 INFO ]: Without dead ends: 62 [2018-06-22 11:43:49,951 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:49,951 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:43:49,956 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-06-22 11:43:49,956 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:43:49,957 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2018-06-22 11:43:49,957 INFO ]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 17 [2018-06-22 11:43:49,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:49,957 INFO ]: Abstraction has 44 states and 69 transitions. [2018-06-22 11:43:49,957 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:49,957 INFO ]: Start isEmpty. Operand 44 states and 69 transitions. [2018-06-22 11:43:49,957 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:49,957 INFO ]: Found error trace [2018-06-22 11:43:49,958 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:49,958 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:49,958 INFO ]: Analyzing trace with hash 1701289861, now seen corresponding path program 1 times [2018-06-22 11:43:49,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:49,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:49,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:49,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:49,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:49,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:50,033 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:43:50,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:50,033 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 11:43:50,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:50,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:50,051 INFO ]: Computing forward predicates... [2018-06-22 11:43:50,125 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:50,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:50,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-22 11:43:50,145 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:43:50,145 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:43:50,146 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:50,146 INFO ]: Start difference. First operand 44 states and 69 transitions. Second operand 11 states. [2018-06-22 11:43:50,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:50,414 INFO ]: Finished difference Result 58 states and 91 transitions. [2018-06-22 11:43:50,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:43:50,414 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:43:50,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:50,415 INFO ]: With dead ends: 58 [2018-06-22 11:43:50,415 INFO ]: Without dead ends: 56 [2018-06-22 11:43:50,415 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:50,415 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:43:50,418 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-06-22 11:43:50,418 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:43:50,419 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2018-06-22 11:43:50,419 INFO ]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 17 [2018-06-22 11:43:50,419 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:50,419 INFO ]: Abstraction has 42 states and 65 transitions. [2018-06-22 11:43:50,419 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:43:50,419 INFO ]: Start isEmpty. Operand 42 states and 65 transitions. [2018-06-22 11:43:50,420 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:50,420 INFO ]: Found error trace [2018-06-22 11:43:50,420 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:50,420 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:50,420 INFO ]: Analyzing trace with hash 202223385, now seen corresponding path program 1 times [2018-06-22 11:43:50,420 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:50,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:50,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:50,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:50,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:50,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:50,601 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-22 11:43:50,648 INFO ]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:43:50,648 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:50,648 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 11:43:50,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:50,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:50,669 INFO ]: Computing forward predicates... [2018-06-22 11:43:50,787 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:43:50,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:50,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-22 11:43:50,806 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:43:50,806 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:43:50,806 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:50,806 INFO ]: Start difference. First operand 42 states and 65 transitions. Second operand 14 states. [2018-06-22 11:43:51,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:51,306 INFO ]: Finished difference Result 83 states and 141 transitions. [2018-06-22 11:43:51,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:43:51,307 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:43:51,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:51,308 INFO ]: With dead ends: 83 [2018-06-22 11:43:51,308 INFO ]: Without dead ends: 83 [2018-06-22 11:43:51,308 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:43:51,308 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:43:51,313 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 55. [2018-06-22 11:43:51,313 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:43:51,314 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2018-06-22 11:43:51,314 INFO ]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 21 [2018-06-22 11:43:51,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:51,314 INFO ]: Abstraction has 55 states and 88 transitions. [2018-06-22 11:43:51,314 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:43:51,314 INFO ]: Start isEmpty. Operand 55 states and 88 transitions. [2018-06-22 11:43:51,315 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:51,315 INFO ]: Found error trace [2018-06-22 11:43:51,315 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:51,315 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:51,315 INFO ]: Analyzing trace with hash -1428549285, now seen corresponding path program 3 times [2018-06-22 11:43:51,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:51,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:51,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:51,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:51,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:51,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:51,381 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:43:51,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:51,381 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 11:43:51,387 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:43:51,401 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:43:51,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:51,403 INFO ]: Computing forward predicates... [2018-06-22 11:43:51,418 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-06-22 11:43:51,419 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:43:51,423 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:43:51,423 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:7 [2018-06-22 11:43:51,488 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:43:51,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:51,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2018-06-22 11:43:51,507 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:43:51,507 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:43:51,507 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:51,507 INFO ]: Start difference. First operand 55 states and 88 transitions. Second operand 11 states. [2018-06-22 11:43:51,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:51,812 INFO ]: Finished difference Result 64 states and 87 transitions. [2018-06-22 11:43:51,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:43:51,812 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:43:51,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:51,813 INFO ]: With dead ends: 64 [2018-06-22 11:43:51,813 INFO ]: Without dead ends: 42 [2018-06-22 11:43:51,813 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:43:51,813 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:43:51,815 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-06-22 11:43:51,815 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:43:51,815 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-06-22 11:43:51,816 INFO ]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 21 [2018-06-22 11:43:51,816 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:51,816 INFO ]: Abstraction has 34 states and 43 transitions. [2018-06-22 11:43:51,816 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:43:51,816 INFO ]: Start isEmpty. Operand 34 states and 43 transitions. [2018-06-22 11:43:51,816 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:51,816 INFO ]: Found error trace [2018-06-22 11:43:51,816 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:51,816 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:51,816 INFO ]: Analyzing trace with hash -447749033, now seen corresponding path program 2 times [2018-06-22 11:43:51,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:51,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:51,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:51,817 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:51,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:51,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:52,038 INFO ]: Checked inductivity of 33 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:43:52,038 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:52,038 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 11:43:52,043 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:52,057 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:52,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:52,060 INFO ]: Computing forward predicates... [2018-06-22 11:43:52,201 INFO ]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:43:52,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:52,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:43:52,219 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:43:52,219 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:43:52,220 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:43:52,220 INFO ]: Start difference. First operand 34 states and 43 transitions. Second operand 16 states. [2018-06-22 11:43:52,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:52,939 INFO ]: Finished difference Result 79 states and 100 transitions. [2018-06-22 11:43:52,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:43:52,939 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:43:52,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:52,939 INFO ]: With dead ends: 79 [2018-06-22 11:43:52,939 INFO ]: Without dead ends: 64 [2018-06-22 11:43:52,940 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:43:52,940 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:43:52,944 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-06-22 11:43:52,944 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:43:52,944 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-06-22 11:43:52,944 INFO ]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 25 [2018-06-22 11:43:52,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:52,944 INFO ]: Abstraction has 48 states and 59 transitions. [2018-06-22 11:43:52,944 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:43:52,944 INFO ]: Start isEmpty. Operand 48 states and 59 transitions. [2018-06-22 11:43:52,944 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:52,944 INFO ]: Found error trace [2018-06-22 11:43:52,944 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:52,944 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:52,944 INFO ]: Analyzing trace with hash -2044332565, now seen corresponding path program 2 times [2018-06-22 11:43:52,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:52,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:52,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:52,945 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:52,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:52,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:53,381 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:43:53,558 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-06-22 11:43:53,611 INFO ]: Checked inductivity of 48 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:43:53,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:53,611 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 11:43:53,617 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:53,636 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:53,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:53,638 INFO ]: Computing forward predicates... [2018-06-22 11:43:53,706 INFO ]: Checked inductivity of 48 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:43:53,726 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:53,726 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 11:43:53,726 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:43:53,726 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:43:53,726 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:53,726 INFO ]: Start difference. First operand 48 states and 59 transitions. Second operand 12 states. [2018-06-22 11:43:54,422 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-22 11:43:54,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:54,429 INFO ]: Finished difference Result 64 states and 80 transitions. [2018-06-22 11:43:54,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:54,429 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 11:43:54,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:54,430 INFO ]: With dead ends: 64 [2018-06-22 11:43:54,430 INFO ]: Without dead ends: 62 [2018-06-22 11:43:54,430 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:43:54,430 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:43:54,433 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-06-22 11:43:54,433 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:43:54,438 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-06-22 11:43:54,438 INFO ]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 29 [2018-06-22 11:43:54,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:54,438 INFO ]: Abstraction has 50 states and 61 transitions. [2018-06-22 11:43:54,438 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:43:54,438 INFO ]: Start isEmpty. Operand 50 states and 61 transitions. [2018-06-22 11:43:54,438 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:54,438 INFO ]: Found error trace [2018-06-22 11:43:54,438 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:54,438 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:54,439 INFO ]: Analyzing trace with hash 1970371129, now seen corresponding path program 1 times [2018-06-22 11:43:54,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:54,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:54,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:54,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:54,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:54,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:54,533 INFO ]: Checked inductivity of 48 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:43:54,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:54,533 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 11:43:54,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:54,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:54,566 INFO ]: Computing forward predicates... [2018-06-22 11:43:54,924 INFO ]: Checked inductivity of 48 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:43:54,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:54,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12] total 14 [2018-06-22 11:43:54,945 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:43:54,945 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:43:54,945 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:54,945 INFO ]: Start difference. First operand 50 states and 61 transitions. Second operand 14 states. [2018-06-22 11:43:55,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:55,533 INFO ]: Finished difference Result 52 states and 65 transitions. [2018-06-22 11:43:55,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:43:55,533 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 11:43:55,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:55,533 INFO ]: With dead ends: 52 [2018-06-22 11:43:55,533 INFO ]: Without dead ends: 0 [2018-06-22 11:43:55,534 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:43:55,534 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:43:55,534 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:43:55,534 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:43:55,534 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:43:55,534 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-22 11:43:55,534 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:55,534 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:43:55,534 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:43:55,534 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:43:55,534 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:43:55,538 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:43:55 BoogieIcfgContainer [2018-06-22 11:43:55,538 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:43:55,539 INFO ]: Toolchain (without parser) took 18831.24 ms. Allocated memory was 308.3 MB in the beginning and 561.0 MB in the end (delta: 252.7 MB). Free memory was 261.7 MB in the beginning and 518.8 MB in the end (delta: -257.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:43:55,540 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:43:55,540 INFO ]: ChcToBoogie took 61.64 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,540 INFO ]: Boogie Preprocessor took 56.71 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,541 INFO ]: RCFGBuilder took 405.67 ms. Allocated memory is still 308.3 MB. Free memory was 257.7 MB in the beginning and 246.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,542 INFO ]: TraceAbstraction took 18297.41 ms. Allocated memory was 308.3 MB in the beginning and 561.0 MB in the end (delta: 252.7 MB). Free memory was 246.6 MB in the beginning and 518.8 MB in the end (delta: -272.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:43:55,545 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.64 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.71 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 405.67 ms. Allocated memory is still 308.3 MB. Free memory was 257.7 MB in the beginning and 246.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 18297.41 ms. Allocated memory was 308.3 MB in the beginning and 561.0 MB in the end (delta: 252.7 MB). Free memory was 246.6 MB in the beginning and 518.8 MB in the end (delta: -272.2 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 18.2s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 741 SDtfs, 213 SDslu, 2128 SDs, 0 SdLazy, 4195 SolverSat, 342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 639 GetRequests, 319 SyntacticMatches, 36 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=27, 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.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 280 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 784 ConstructedInterpolants, 0 QuantifiedInterpolants, 76656 SizeOfPredicates, 147 NumberOfNonLiveVariables, 2040 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 50 InterpolantComputations, 13 PerfectInterpolantSequences, 333/569 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memchr_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-43-55-555.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memchr_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-43-55-555.csv Received shutdown request...