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/eldarica-misc/LIA/reve/025d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:22:28,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:22:28,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:22:28,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:22:28,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:22:28,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:22:28,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:22:28,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:22:28,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:22:28,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:22:28,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:22:28,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:22:28,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:22:28,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:22:28,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:22:28,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:22:28,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:22:28,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:22:28,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:22:28,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:22:28,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:22:28,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:22:28,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:22:28,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:22:28,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:22:28,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:22:28,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:22:28,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:22:28,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:22:28,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:22:28,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:22:28,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:22:28,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:22:28,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:22:28,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:22:28,918 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:22:28,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:22:28,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:22:28,931 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:22:28,931 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:22:28,932 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:22:28,933 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:22:28,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:22:28,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:22:28,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:22:28,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:22:28,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:22:28,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:22:28,934 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:22:28,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:22:28,934 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:22:28,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:22:28,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:22:28,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:22:28,935 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:22:28,936 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:22:28,937 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:22:28,985 INFO ]: Repository-Root is: /tmp [2018-06-22 11:22:29,000 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:22:29,006 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:22:29,007 INFO ]: Initializing SmtParser... [2018-06-22 11:22:29,007 INFO ]: SmtParser initialized [2018-06-22 11:22:29,008 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-22 11:22:29,009 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:22:29,080 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 unknown [2018-06-22 11:22:29,295 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-22 11:22:29,300 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:22:29,308 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:22:29,309 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:22:29,309 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:22:29,309 INFO ]: ChcToBoogie initialized [2018-06-22 11:22:29,312 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,358 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29 Unit [2018-06-22 11:22:29,358 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:22:29,359 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:22:29,359 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:22:29,359 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:22:29,383 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,383 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,391 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,391 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,395 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,398 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,399 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... [2018-06-22 11:22:29,400 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:22:29,401 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:22:29,401 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:22:29,401 INFO ]: RCFGBuilder initialized [2018-06-22 11:22:29,402 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:22:29,413 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:22:29,413 INFO ]: Found specification of procedure False [2018-06-22 11:22:29,413 INFO ]: Found implementation of procedure False [2018-06-22 11:22:29,413 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:22:29,413 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:22:29,413 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:22:29,413 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:22:29,413 INFO ]: Found specification of procedure REC__f [2018-06-22 11:22:29,413 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:22:29,413 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:22:29,413 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:22:29,413 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:22:29,413 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:22:29,413 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:22:29,414 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:22:29,799 INFO ]: Using library mode [2018-06-22 11:22:29,799 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:22:29 BoogieIcfgContainer [2018-06-22 11:22:29,799 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:22:29,801 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:22:29,801 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:22:29,804 INFO ]: TraceAbstraction initialized [2018-06-22 11:22:29,804 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:22:29" (1/3) ... [2018-06-22 11:22:29,805 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35344e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:22:29, skipping insertion in model container [2018-06-22 11:22:29,805 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:29" (2/3) ... [2018-06-22 11:22:29,805 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35344e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:22:29, skipping insertion in model container [2018-06-22 11:22:29,805 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:22:29" (3/3) ... [2018-06-22 11:22:29,807 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:22:29,816 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:22:29,827 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:22:29,874 INFO ]: Using default assertion order modulation [2018-06-22 11:22:29,874 INFO ]: Interprodecural is true [2018-06-22 11:22:29,874 INFO ]: Hoare is false [2018-06-22 11:22:29,874 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:22:29,874 INFO ]: Backedges is TWOTRACK [2018-06-22 11:22:29,874 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:22:29,874 INFO ]: Difference is false [2018-06-22 11:22:29,875 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:22:29,875 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:22:29,896 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 11:22:29,914 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:22:29,914 INFO ]: Found error trace [2018-06-22 11:22:29,915 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:29,915 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:29,920 INFO ]: Analyzing trace with hash -2071846982, now seen corresponding path program 1 times [2018-06-22 11:22:29,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:29,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:29,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:29,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:29,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:29,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:30,238 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:22:30,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:30,240 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:30,241 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:30,251 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:30,251 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:30,254 INFO ]: Start difference. First operand 30 states. Second operand 4 states. [2018-06-22 11:22:30,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:30,449 INFO ]: Finished difference Result 30 states and 54 transitions. [2018-06-22 11:22:30,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:30,451 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:22:30,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:30,462 INFO ]: With dead ends: 30 [2018-06-22 11:22:30,462 INFO ]: Without dead ends: 30 [2018-06-22 11:22:30,464 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:22:30,482 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:22:30,508 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:22:30,510 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:22:30,512 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2018-06-22 11:22:30,514 INFO ]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 9 [2018-06-22 11:22:30,515 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:30,515 INFO ]: Abstraction has 30 states and 54 transitions. [2018-06-22 11:22:30,515 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:30,515 INFO ]: Start isEmpty. Operand 30 states and 54 transitions. [2018-06-22 11:22:30,518 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:30,518 INFO ]: Found error trace [2018-06-22 11:22:30,519 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:30,519 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:30,519 INFO ]: Analyzing trace with hash -871452962, now seen corresponding path program 1 times [2018-06-22 11:22:30,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:30,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:30,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:30,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:30,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:30,538 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:30,696 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:22:30,696 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:30,696 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) [2018-06-22 11:22:30,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:30,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:30,755 INFO ]: Computing forward predicates... [2018-06-22 11:22:31,293 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:22:31,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:31,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:22:31,335 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:31,335 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:31,336 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:31,336 INFO ]: Start difference. First operand 30 states and 54 transitions. Second operand 10 states. [2018-06-22 11:22:32,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:32,577 INFO ]: Finished difference Result 48 states and 103 transitions. [2018-06-22 11:22:32,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:22:32,578 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:22:32,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:32,580 INFO ]: With dead ends: 48 [2018-06-22 11:22:32,580 INFO ]: Without dead ends: 48 [2018-06-22 11:22:32,581 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:32,581 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:22:32,597 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-06-22 11:22:32,597 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:22:32,599 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 76 transitions. [2018-06-22 11:22:32,599 INFO ]: Start accepts. Automaton has 38 states and 76 transitions. Word has length 13 [2018-06-22 11:22:32,599 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:32,599 INFO ]: Abstraction has 38 states and 76 transitions. [2018-06-22 11:22:32,599 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:32,599 INFO ]: Start isEmpty. Operand 38 states and 76 transitions. [2018-06-22 11:22:32,602 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:32,602 INFO ]: Found error trace [2018-06-22 11:22:32,602 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:32,602 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:32,602 INFO ]: Analyzing trace with hash -135700403, now seen corresponding path program 1 times [2018-06-22 11:22:32,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:32,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:32,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:32,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:32,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:32,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:32,657 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:22:32,658 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:32,658 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:32,658 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:32,658 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:32,658 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:32,658 INFO ]: Start difference. First operand 38 states and 76 transitions. Second operand 4 states. [2018-06-22 11:22:32,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:32,705 INFO ]: Finished difference Result 44 states and 87 transitions. [2018-06-22 11:22:32,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:32,706 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:22:32,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:32,708 INFO ]: With dead ends: 44 [2018-06-22 11:22:32,708 INFO ]: Without dead ends: 44 [2018-06-22 11:22:32,708 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:22:32,708 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:22:32,718 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-06-22 11:22:32,719 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:22:32,720 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 70 transitions. [2018-06-22 11:22:32,720 INFO ]: Start accepts. Automaton has 38 states and 70 transitions. Word has length 13 [2018-06-22 11:22:32,720 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:32,720 INFO ]: Abstraction has 38 states and 70 transitions. [2018-06-22 11:22:32,720 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:32,720 INFO ]: Start isEmpty. Operand 38 states and 70 transitions. [2018-06-22 11:22:32,722 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:32,722 INFO ]: Found error trace [2018-06-22 11:22:32,722 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:32,722 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:32,722 INFO ]: Analyzing trace with hash -834300836, now seen corresponding path program 1 times [2018-06-22 11:22:32,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:32,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:32,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:32,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:32,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:32,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:32,784 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:22:32,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:32,784 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:32,784 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:32,785 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:32,785 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:32,785 INFO ]: Start difference. First operand 38 states and 70 transitions. Second operand 4 states. [2018-06-22 11:22:32,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:32,957 INFO ]: Finished difference Result 38 states and 68 transitions. [2018-06-22 11:22:32,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:32,958 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:22:32,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:32,959 INFO ]: With dead ends: 38 [2018-06-22 11:22:32,959 INFO ]: Without dead ends: 38 [2018-06-22 11:22:32,960 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:22:32,960 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:22:32,968 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:22:32,968 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:22:32,969 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-06-22 11:22:32,970 INFO ]: Start accepts. Automaton has 36 states and 65 transitions. Word has length 13 [2018-06-22 11:22:32,970 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:32,970 INFO ]: Abstraction has 36 states and 65 transitions. [2018-06-22 11:22:32,970 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:32,970 INFO ]: Start isEmpty. Operand 36 states and 65 transitions. [2018-06-22 11:22:32,971 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:32,971 INFO ]: Found error trace [2018-06-22 11:22:32,971 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:32,971 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:32,972 INFO ]: Analyzing trace with hash 845303009, now seen corresponding path program 1 times [2018-06-22 11:22:32,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:32,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:32,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:32,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:32,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:32,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:33,128 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:22:33,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:33,128 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:22:33,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:33,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:33,147 INFO ]: Computing forward predicates... [2018-06-22 11:22:33,231 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:22:33,251 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:33,251 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:22:33,252 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:22:33,252 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:22:33,252 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:22:33,252 INFO ]: Start difference. First operand 36 states and 65 transitions. Second operand 8 states. [2018-06-22 11:22:33,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:33,691 INFO ]: Finished difference Result 44 states and 84 transitions. [2018-06-22 11:22:33,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:33,692 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:22:33,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:33,693 INFO ]: With dead ends: 44 [2018-06-22 11:22:33,693 INFO ]: Without dead ends: 44 [2018-06-22 11:22:33,694 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:33,694 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:22:33,702 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-06-22 11:22:33,702 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:22:33,703 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-06-22 11:22:33,703 INFO ]: Start accepts. Automaton has 36 states and 65 transitions. Word has length 13 [2018-06-22 11:22:33,703 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:33,704 INFO ]: Abstraction has 36 states and 65 transitions. [2018-06-22 11:22:33,704 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:22:33,704 INFO ]: Start isEmpty. Operand 36 states and 65 transitions. [2018-06-22 11:22:33,708 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:33,708 INFO ]: Found error trace [2018-06-22 11:22:33,708 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:33,708 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:33,708 INFO ]: Analyzing trace with hash 1870678147, now seen corresponding path program 1 times [2018-06-22 11:22:33,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:33,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:33,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:33,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:33,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:33,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:33,812 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:22:33,812 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:33,812 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:22:33,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:33,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:33,829 INFO ]: Computing forward predicates... [2018-06-22 11:22:33,871 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:22:33,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:33,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:22:33,901 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:33,901 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:33,901 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:33,901 INFO ]: Start difference. First operand 36 states and 65 transitions. Second operand 10 states. [2018-06-22 11:22:34,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:34,062 INFO ]: Finished difference Result 46 states and 91 transitions. [2018-06-22 11:22:34,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:34,063 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:34,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:34,064 INFO ]: With dead ends: 46 [2018-06-22 11:22:34,064 INFO ]: Without dead ends: 46 [2018-06-22 11:22:34,065 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:34,065 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:22:34,072 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-06-22 11:22:34,072 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:22:34,073 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 70 transitions. [2018-06-22 11:22:34,073 INFO ]: Start accepts. Automaton has 38 states and 70 transitions. Word has length 17 [2018-06-22 11:22:34,073 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:34,073 INFO ]: Abstraction has 38 states and 70 transitions. [2018-06-22 11:22:34,073 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:34,073 INFO ]: Start isEmpty. Operand 38 states and 70 transitions. [2018-06-22 11:22:34,074 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:34,074 INFO ]: Found error trace [2018-06-22 11:22:34,074 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:34,075 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:34,075 INFO ]: Analyzing trace with hash -1964240765, now seen corresponding path program 1 times [2018-06-22 11:22:34,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:34,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:34,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:34,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:34,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:34,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:34,144 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:22:34,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:34,144 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:22:34,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:34,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:34,176 INFO ]: Computing forward predicates... [2018-06-22 11:22:34,211 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:22:34,230 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:34,230 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:22:34,230 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:22:34,230 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:22:34,230 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:22:34,231 INFO ]: Start difference. First operand 38 states and 70 transitions. Second operand 9 states. [2018-06-22 11:22:34,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:34,577 INFO ]: Finished difference Result 48 states and 94 transitions. [2018-06-22 11:22:34,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:22:34,578 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:22:34,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:34,579 INFO ]: With dead ends: 48 [2018-06-22 11:22:34,579 INFO ]: Without dead ends: 48 [2018-06-22 11:22:34,579 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:22:34,579 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:22:34,586 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-06-22 11:22:34,586 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:22:34,587 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 70 transitions. [2018-06-22 11:22:34,587 INFO ]: Start accepts. Automaton has 38 states and 70 transitions. Word has length 17 [2018-06-22 11:22:34,587 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:34,587 INFO ]: Abstraction has 38 states and 70 transitions. [2018-06-22 11:22:34,587 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:22:34,587 INFO ]: Start isEmpty. Operand 38 states and 70 transitions. [2018-06-22 11:22:34,588 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:34,588 INFO ]: Found error trace [2018-06-22 11:22:34,588 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:34,588 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:34,589 INFO ]: Analyzing trace with hash -1382152846, now seen corresponding path program 1 times [2018-06-22 11:22:34,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:34,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:34,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:34,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:34,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:34,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:34,679 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:22:34,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:34,679 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:22:34,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:34,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:34,715 INFO ]: Computing forward predicates... [2018-06-22 11:22:34,769 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:22:34,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:34,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:22:34,788 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:34,788 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:34,788 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:34,788 INFO ]: Start difference. First operand 38 states and 70 transitions. Second operand 10 states. [2018-06-22 11:22:34,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:34,968 INFO ]: Finished difference Result 46 states and 91 transitions. [2018-06-22 11:22:34,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:34,968 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:34,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:34,969 INFO ]: With dead ends: 46 [2018-06-22 11:22:34,969 INFO ]: Without dead ends: 46 [2018-06-22 11:22:34,970 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:34,970 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:22:34,975 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-06-22 11:22:34,975 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:22:34,976 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 70 transitions. [2018-06-22 11:22:34,976 INFO ]: Start accepts. Automaton has 38 states and 70 transitions. Word has length 17 [2018-06-22 11:22:34,976 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:34,976 INFO ]: Abstraction has 38 states and 70 transitions. [2018-06-22 11:22:34,976 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:34,976 INFO ]: Start isEmpty. Operand 38 states and 70 transitions. [2018-06-22 11:22:34,977 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:34,977 INFO ]: Found error trace [2018-06-22 11:22:34,977 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:34,977 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:34,977 INFO ]: Analyzing trace with hash 2091576618, now seen corresponding path program 1 times [2018-06-22 11:22:34,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:34,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:34,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:34,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:34,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:34,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:35,105 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:35,105 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:35,105 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:22:35,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:35,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:35,123 INFO ]: Computing forward predicates... [2018-06-22 11:22:35,240 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:35,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:35,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:22:35,273 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:22:35,273 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:22:35,273 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:22:35,273 INFO ]: Start difference. First operand 38 states and 70 transitions. Second operand 14 states. [2018-06-22 11:22:35,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:35,931 INFO ]: Finished difference Result 52 states and 104 transitions. [2018-06-22 11:22:35,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:22:35,932 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:22:35,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:35,932 INFO ]: With dead ends: 52 [2018-06-22 11:22:35,932 INFO ]: Without dead ends: 52 [2018-06-22 11:22:35,933 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:22:35,933 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:22:35,941 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-06-22 11:22:35,941 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:22:35,941 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 80 transitions. [2018-06-22 11:22:35,942 INFO ]: Start accepts. Automaton has 42 states and 80 transitions. Word has length 17 [2018-06-22 11:22:35,942 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:35,942 INFO ]: Abstraction has 42 states and 80 transitions. [2018-06-22 11:22:35,942 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:22:35,942 INFO ]: Start isEmpty. Operand 42 states and 80 transitions. [2018-06-22 11:22:35,943 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:35,943 INFO ]: Found error trace [2018-06-22 11:22:35,943 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:35,943 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:35,943 INFO ]: Analyzing trace with hash -1547852138, now seen corresponding path program 1 times [2018-06-22 11:22:35,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:35,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:35,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:35,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:35,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:35,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:36,001 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:22:36,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:36,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:22:36,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:36,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:36,036 INFO ]: Computing forward predicates... [2018-06-22 11:22:36,126 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:22:36,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:36,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 11:22:36,145 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:36,145 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:36,145 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:36,146 INFO ]: Start difference. First operand 42 states and 80 transitions. Second operand 12 states. [2018-06-22 11:22:36,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:36,478 INFO ]: Finished difference Result 58 states and 119 transitions. [2018-06-22 11:22:36,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:22:36,478 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:22:36,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:36,479 INFO ]: With dead ends: 58 [2018-06-22 11:22:36,479 INFO ]: Without dead ends: 58 [2018-06-22 11:22:36,479 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:36,479 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:22:36,487 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-06-22 11:22:36,487 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:22:36,488 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 78 transitions. [2018-06-22 11:22:36,488 INFO ]: Start accepts. Automaton has 42 states and 78 transitions. Word has length 17 [2018-06-22 11:22:36,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:36,488 INFO ]: Abstraction has 42 states and 78 transitions. [2018-06-22 11:22:36,488 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:36,488 INFO ]: Start isEmpty. Operand 42 states and 78 transitions. [2018-06-22 11:22:36,489 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:36,489 INFO ]: Found error trace [2018-06-22 11:22:36,489 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:36,489 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:36,489 INFO ]: Analyzing trace with hash -1621302759, now seen corresponding path program 1 times [2018-06-22 11:22:36,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:36,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:36,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:36,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:36,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:36,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:36,544 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:22:36,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:36,544 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:22:36,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:36,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:36,572 INFO ]: Computing forward predicates... [2018-06-22 11:22:36,727 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:22:36,746 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:36,746 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:22:36,746 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:22:36,747 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:22:36,747 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:22:36,747 INFO ]: Start difference. First operand 42 states and 78 transitions. Second operand 14 states. [2018-06-22 11:22:37,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:37,459 INFO ]: Finished difference Result 76 states and 161 transitions. [2018-06-22 11:22:37,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:22:37,459 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:22:37,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:37,461 INFO ]: With dead ends: 76 [2018-06-22 11:22:37,461 INFO ]: Without dead ends: 76 [2018-06-22 11:22:37,461 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:22:37,461 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 11:22:37,470 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 46. [2018-06-22 11:22:37,470 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:22:37,471 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 88 transitions. [2018-06-22 11:22:37,471 INFO ]: Start accepts. Automaton has 46 states and 88 transitions. Word has length 17 [2018-06-22 11:22:37,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:37,471 INFO ]: Abstraction has 46 states and 88 transitions. [2018-06-22 11:22:37,471 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:22:37,471 INFO ]: Start isEmpty. Operand 46 states and 88 transitions. [2018-06-22 11:22:37,473 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:37,473 INFO ]: Found error trace [2018-06-22 11:22:37,473 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:37,473 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:37,473 INFO ]: Analyzing trace with hash 1717808436, now seen corresponding path program 1 times [2018-06-22 11:22:37,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:37,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:37,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:37,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:37,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:37,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:37,519 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:22:37,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:37,519 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:22:37,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:37,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:37,537 INFO ]: Computing forward predicates... [2018-06-22 11:22:37,576 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:22:37,596 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:37,596 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:22:37,596 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:22:37,596 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:22:37,596 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:22:37,596 INFO ]: Start difference. First operand 46 states and 88 transitions. Second operand 9 states. [2018-06-22 11:22:37,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:37,699 INFO ]: Finished difference Result 62 states and 126 transitions. [2018-06-22 11:22:37,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:22:37,702 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:22:37,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:37,703 INFO ]: With dead ends: 62 [2018-06-22 11:22:37,703 INFO ]: Without dead ends: 62 [2018-06-22 11:22:37,703 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:22:37,703 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:22:37,718 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-06-22 11:22:37,718 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:22:37,719 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2018-06-22 11:22:37,720 INFO ]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 17 [2018-06-22 11:22:37,720 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:37,720 INFO ]: Abstraction has 50 states and 94 transitions. [2018-06-22 11:22:37,720 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:22:37,720 INFO ]: Start isEmpty. Operand 50 states and 94 transitions. [2018-06-22 11:22:37,721 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:37,721 INFO ]: Found error trace [2018-06-22 11:22:37,721 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:37,721 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:37,721 INFO ]: Analyzing trace with hash 480181977, now seen corresponding path program 2 times [2018-06-22 11:22:37,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:37,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:37,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:37,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:37,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:37,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:37,800 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:22:37,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:37,800 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:22:37,806 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:37,817 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:37,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:37,818 INFO ]: Computing forward predicates... [2018-06-22 11:22:38,118 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:22:38,147 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:38,147 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:22:38,147 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:22:38,147 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:22:38,147 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:22:38,148 INFO ]: Start difference. First operand 50 states and 94 transitions. Second operand 11 states. [2018-06-22 11:22:38,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:38,596 INFO ]: Finished difference Result 66 states and 134 transitions. [2018-06-22 11:22:38,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:22:38,596 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:22:38,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:38,597 INFO ]: With dead ends: 66 [2018-06-22 11:22:38,597 INFO ]: Without dead ends: 66 [2018-06-22 11:22:38,598 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:38,598 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:22:38,608 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-06-22 11:22:38,608 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:22:38,615 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2018-06-22 11:22:38,615 INFO ]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 17 [2018-06-22 11:22:38,615 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:38,615 INFO ]: Abstraction has 50 states and 94 transitions. [2018-06-22 11:22:38,615 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:22:38,615 INFO ]: Start isEmpty. Operand 50 states and 94 transitions. [2018-06-22 11:22:38,616 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:38,616 INFO ]: Found error trace [2018-06-22 11:22:38,616 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:38,616 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:38,616 INFO ]: Analyzing trace with hash 1062269896, now seen corresponding path program 2 times [2018-06-22 11:22:38,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:38,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:38,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:38,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:38,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:38,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:38,802 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:22:38,949 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:38,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:38,949 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:22:38,955 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:38,968 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:38,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:38,970 INFO ]: Computing forward predicates... [2018-06-22 11:22:39,043 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:39,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:39,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:22:39,065 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:39,065 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:39,065 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:39,065 INFO ]: Start difference. First operand 50 states and 94 transitions. Second operand 12 states. [2018-06-22 11:22:39,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:39,415 INFO ]: Finished difference Result 62 states and 125 transitions. [2018-06-22 11:22:39,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:22:39,415 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:22:39,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:39,416 INFO ]: With dead ends: 62 [2018-06-22 11:22:39,416 INFO ]: Without dead ends: 62 [2018-06-22 11:22:39,416 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:39,416 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:22:39,421 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-06-22 11:22:39,422 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:22:39,423 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2018-06-22 11:22:39,423 INFO ]: Start accepts. Automaton has 52 states and 99 transitions. Word has length 17 [2018-06-22 11:22:39,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:39,423 INFO ]: Abstraction has 52 states and 99 transitions. [2018-06-22 11:22:39,423 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:39,423 INFO ]: Start isEmpty. Operand 52 states and 99 transitions. [2018-06-22 11:22:39,424 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:39,424 INFO ]: Found error trace [2018-06-22 11:22:39,424 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:39,424 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:39,424 INFO ]: Analyzing trace with hash -399999493, now seen corresponding path program 1 times [2018-06-22 11:22:39,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:39,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:39,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:39,425 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:39,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:39,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:39,485 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:22:39,485 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:39,485 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:22:39,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:39,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:39,525 INFO ]: Computing forward predicates... [2018-06-22 11:22:39,546 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:22:39,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:39,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:22:39,577 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:22:39,577 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:22:39,577 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:22:39,577 INFO ]: Start difference. First operand 52 states and 99 transitions. Second operand 8 states. [2018-06-22 11:22:40,088 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:22:40,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:40,198 INFO ]: Finished difference Result 70 states and 143 transitions. [2018-06-22 11:22:40,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:22:40,199 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:22:40,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:40,200 INFO ]: With dead ends: 70 [2018-06-22 11:22:40,200 INFO ]: Without dead ends: 70 [2018-06-22 11:22:40,200 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:40,200 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:22:40,207 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-06-22 11:22:40,207 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:22:40,208 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 99 transitions. [2018-06-22 11:22:40,208 INFO ]: Start accepts. Automaton has 52 states and 99 transitions. Word has length 21 [2018-06-22 11:22:40,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:40,208 INFO ]: Abstraction has 52 states and 99 transitions. [2018-06-22 11:22:40,208 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:22:40,208 INFO ]: Start isEmpty. Operand 52 states and 99 transitions. [2018-06-22 11:22:40,209 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:40,209 INFO ]: Found error trace [2018-06-22 11:22:40,210 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:40,216 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:40,216 INFO ]: Analyzing trace with hash 545292928, now seen corresponding path program 3 times [2018-06-22 11:22:40,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:40,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:40,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:40,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:40,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:40,228 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:40,379 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:40,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:40,380 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:22:40,394 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:40,407 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:22:40,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:40,409 INFO ]: Computing forward predicates... [2018-06-22 11:22:40,554 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:40,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:40,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:22:40,573 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:22:40,573 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:22:40,573 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:40,573 INFO ]: Start difference. First operand 52 states and 99 transitions. Second operand 18 states. [2018-06-22 11:22:41,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:41,942 INFO ]: Finished difference Result 98 states and 210 transitions. [2018-06-22 11:22:41,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:22:41,942 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:22:41,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:41,943 INFO ]: With dead ends: 98 [2018-06-22 11:22:41,943 INFO ]: Without dead ends: 98 [2018-06-22 11:22:41,943 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:22:41,943 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:22:41,954 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 58. [2018-06-22 11:22:41,955 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:22:41,955 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 112 transitions. [2018-06-22 11:22:41,955 INFO ]: Start accepts. Automaton has 58 states and 112 transitions. Word has length 21 [2018-06-22 11:22:41,956 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:41,956 INFO ]: Abstraction has 58 states and 112 transitions. [2018-06-22 11:22:41,956 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:22:41,956 INFO ]: Start isEmpty. Operand 58 states and 112 transitions. [2018-06-22 11:22:41,966 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:41,966 INFO ]: Found error trace [2018-06-22 11:22:41,966 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:41,966 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:41,966 INFO ]: Analyzing trace with hash -931989807, now seen corresponding path program 4 times [2018-06-22 11:22:41,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:41,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:41,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:41,967 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:41,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:41,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:42,062 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:42,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:42,062 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:22:42,067 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:22:42,079 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:22:42,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:42,080 INFO ]: Computing forward predicates... [2018-06-22 11:22:42,263 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:42,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:42,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:22:42,282 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:22:42,283 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:22:42,283 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:42,283 INFO ]: Start difference. First operand 58 states and 112 transitions. Second operand 18 states. [2018-06-22 11:22:43,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:43,179 INFO ]: Finished difference Result 118 states and 261 transitions. [2018-06-22 11:22:43,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:22:43,179 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:22:43,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:43,181 INFO ]: With dead ends: 118 [2018-06-22 11:22:43,181 INFO ]: Without dead ends: 118 [2018-06-22 11:22:43,182 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:22:43,182 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:22:43,194 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 62. [2018-06-22 11:22:43,194 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:22:43,194 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. [2018-06-22 11:22:43,195 INFO ]: Start accepts. Automaton has 62 states and 122 transitions. Word has length 21 [2018-06-22 11:22:43,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:43,195 INFO ]: Abstraction has 62 states and 122 transitions. [2018-06-22 11:22:43,195 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:22:43,195 INFO ]: Start isEmpty. Operand 62 states and 122 transitions. [2018-06-22 11:22:43,196 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:43,196 INFO ]: Found error trace [2018-06-22 11:22:43,196 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:22:43,196 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:43,196 INFO ]: Analyzing trace with hash 1141493420, now seen corresponding path program 1 times [2018-06-22 11:22:43,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:43,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:43,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:43,197 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:43,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:43,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:43,291 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:43,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:43,291 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:22:43,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:43,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:43,311 INFO ]: Computing forward predicates... [2018-06-22 11:22:43,494 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:43,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:43,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:22:43,514 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:22:43,514 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:22:43,514 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:43,514 INFO ]: Start difference. First operand 62 states and 122 transitions. Second operand 18 states. [2018-06-22 11:22:44,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:44,673 INFO ]: Finished difference Result 112 states and 245 transitions. [2018-06-22 11:22:44,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:22:44,673 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:22:44,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:44,674 INFO ]: With dead ends: 112 [2018-06-22 11:22:44,674 INFO ]: Without dead ends: 112 [2018-06-22 11:22:44,675 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=286, Invalid=1520, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:22:44,675 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:22:44,687 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 58. [2018-06-22 11:22:44,687 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:22:44,688 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 112 transitions. [2018-06-22 11:22:44,688 INFO ]: Start accepts. Automaton has 58 states and 112 transitions. Word has length 21 [2018-06-22 11:22:44,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:44,688 INFO ]: Abstraction has 58 states and 112 transitions. [2018-06-22 11:22:44,688 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:22:44,688 INFO ]: Start isEmpty. Operand 58 states and 112 transitions. [2018-06-22 11:22:44,689 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:44,689 INFO ]: Found error trace [2018-06-22 11:22:44,689 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:44,689 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:44,689 INFO ]: Analyzing trace with hash -187249812, now seen corresponding path program 1 times [2018-06-22 11:22:44,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:44,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:44,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:44,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:44,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:44,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:44,792 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:44,792 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:44,792 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:22:44,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:44,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:44,810 INFO ]: Computing forward predicates... [2018-06-22 11:22:44,932 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:44,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:44,950 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:22:44,950 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:22:44,951 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:22:44,951 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:44,951 INFO ]: Start difference. First operand 58 states and 112 transitions. Second operand 16 states. [2018-06-22 11:22:45,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:45,793 INFO ]: Finished difference Result 118 states and 263 transitions. [2018-06-22 11:22:45,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:22:45,824 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:22:45,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:45,826 INFO ]: With dead ends: 118 [2018-06-22 11:22:45,826 INFO ]: Without dead ends: 118 [2018-06-22 11:22:45,826 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:22:45,826 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:22:45,837 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 70. [2018-06-22 11:22:45,837 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:22:45,837 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 144 transitions. [2018-06-22 11:22:45,838 INFO ]: Start accepts. Automaton has 70 states and 144 transitions. Word has length 21 [2018-06-22 11:22:45,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:45,838 INFO ]: Abstraction has 70 states and 144 transitions. [2018-06-22 11:22:45,838 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:22:45,838 INFO ]: Start isEmpty. Operand 70 states and 144 transitions. [2018-06-22 11:22:45,839 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:45,839 INFO ]: Found error trace [2018-06-22 11:22:45,839 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:45,839 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:45,839 INFO ]: Analyzing trace with hash -2112732197, now seen corresponding path program 2 times [2018-06-22 11:22:45,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:45,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:45,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:45,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:45,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:45,847 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:46,489 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:46,489 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:46,489 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) [2018-06-22 11:22:46,501 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:46,539 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:46,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:46,541 INFO ]: Computing forward predicates... [2018-06-22 11:22:46,705 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:22:46,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:46,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-22 11:22:46,724 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:46,724 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:46,724 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:46,724 INFO ]: Start difference. First operand 70 states and 144 transitions. Second operand 12 states. [2018-06-22 11:22:46,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:46,911 INFO ]: Finished difference Result 96 states and 208 transitions. [2018-06-22 11:22:46,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:22:46,912 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:22:46,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:46,913 INFO ]: With dead ends: 96 [2018-06-22 11:22:46,913 INFO ]: Without dead ends: 96 [2018-06-22 11:22:46,913 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:22:46,913 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:22:46,921 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-06-22 11:22:46,921 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:22:46,922 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 145 transitions. [2018-06-22 11:22:46,922 INFO ]: Start accepts. Automaton has 72 states and 145 transitions. Word has length 21 [2018-06-22 11:22:46,922 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:46,922 INFO ]: Abstraction has 72 states and 145 transitions. [2018-06-22 11:22:46,922 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:46,922 INFO ]: Start isEmpty. Operand 72 states and 145 transitions. [2018-06-22 11:22:46,923 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:46,923 INFO ]: Found error trace [2018-06-22 11:22:46,923 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:46,923 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:46,923 INFO ]: Analyzing trace with hash -563413106, now seen corresponding path program 1 times [2018-06-22 11:22:46,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:46,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:46,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:46,924 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:46,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:46,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:47,009 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:47,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:47,009 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:22:47,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:47,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:47,039 INFO ]: Computing forward predicates... [2018-06-22 11:22:47,124 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:47,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:47,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-22 11:22:47,143 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:22:47,143 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:22:47,143 INFO ]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:22:47,143 INFO ]: Start difference. First operand 72 states and 145 transitions. Second operand 19 states. [2018-06-22 11:22:48,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:48,092 INFO ]: Finished difference Result 120 states and 256 transitions. [2018-06-22 11:22:48,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:22:48,092 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:22:48,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:48,094 INFO ]: With dead ends: 120 [2018-06-22 11:22:48,094 INFO ]: Without dead ends: 120 [2018-06-22 11:22:48,094 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1695, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:22:48,095 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 11:22:48,104 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 80. [2018-06-22 11:22:48,104 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:22:48,105 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 161 transitions. [2018-06-22 11:22:48,105 INFO ]: Start accepts. Automaton has 80 states and 161 transitions. Word has length 25 [2018-06-22 11:22:48,105 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:48,105 INFO ]: Abstraction has 80 states and 161 transitions. [2018-06-22 11:22:48,105 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:22:48,105 INFO ]: Start isEmpty. Operand 80 states and 161 transitions. [2018-06-22 11:22:48,107 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:48,107 INFO ]: Found error trace [2018-06-22 11:22:48,107 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:48,107 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:48,107 INFO ]: Analyzing trace with hash -1497220227, now seen corresponding path program 1 times [2018-06-22 11:22:48,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:48,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:48,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:48,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:48,767 INFO ]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:22:48,767 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:48,767 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) [2018-06-22 11:22:48,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:48,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:48,816 INFO ]: Computing forward predicates... [2018-06-22 11:22:49,007 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:49,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:49,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:22:49,028 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:22:49,028 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:22:49,028 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:22:49,029 INFO ]: Start difference. First operand 80 states and 161 transitions. Second operand 15 states. [2018-06-22 11:22:49,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:49,534 INFO ]: Finished difference Result 102 states and 210 transitions. [2018-06-22 11:22:49,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:22:49,535 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:22:49,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:49,536 INFO ]: With dead ends: 102 [2018-06-22 11:22:49,536 INFO ]: Without dead ends: 102 [2018-06-22 11:22:49,537 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:22:49,537 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 11:22:49,546 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 80. [2018-06-22 11:22:49,546 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:22:49,547 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 160 transitions. [2018-06-22 11:22:49,547 INFO ]: Start accepts. Automaton has 80 states and 160 transitions. Word has length 25 [2018-06-22 11:22:49,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:49,547 INFO ]: Abstraction has 80 states and 160 transitions. [2018-06-22 11:22:49,547 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:22:49,547 INFO ]: Start isEmpty. Operand 80 states and 160 transitions. [2018-06-22 11:22:49,548 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:49,548 INFO ]: Found error trace [2018-06-22 11:22:49,548 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:49,549 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:49,551 INFO ]: Analyzing trace with hash 1756339281, now seen corresponding path program 1 times [2018-06-22 11:22:49,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:49,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:49,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:49,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:49,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:49,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:50,306 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:50,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:50,306 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:50,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:50,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:50,325 INFO ]: Computing forward predicates... [2018-06-22 11:22:50,475 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:50,494 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:50,494 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:22:50,494 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:22:50,494 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:22:50,494 INFO ]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:50,494 INFO ]: Start difference. First operand 80 states and 160 transitions. Second operand 18 states. [2018-06-22 11:22:51,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:51,177 INFO ]: Finished difference Result 142 states and 319 transitions. [2018-06-22 11:22:51,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:22:51,324 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:22:51,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:51,326 INFO ]: With dead ends: 142 [2018-06-22 11:22:51,326 INFO ]: Without dead ends: 142 [2018-06-22 11:22:51,326 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:22:51,326 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 11:22:51,337 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 90. [2018-06-22 11:22:51,337 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 11:22:51,338 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 189 transitions. [2018-06-22 11:22:51,339 INFO ]: Start accepts. Automaton has 90 states and 189 transitions. Word has length 25 [2018-06-22 11:22:51,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:51,339 INFO ]: Abstraction has 90 states and 189 transitions. [2018-06-22 11:22:51,339 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:22:51,339 INFO ]: Start isEmpty. Operand 90 states and 189 transitions. [2018-06-22 11:22:51,340 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:51,340 INFO ]: Found error trace [2018-06-22 11:22:51,340 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:51,340 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:51,340 INFO ]: Analyzing trace with hash 2135903346, now seen corresponding path program 2 times [2018-06-22 11:22:51,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:51,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:51,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:51,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:51,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:51,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:51,442 INFO ]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:51,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:51,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:51,448 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:51,461 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:51,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:51,463 INFO ]: Computing forward predicates... [2018-06-22 11:22:51,849 INFO ]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:51,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:51,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-22 11:22:51,871 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:22:51,871 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:22:51,871 INFO ]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:22:51,871 INFO ]: Start difference. First operand 90 states and 189 transitions. Second operand 19 states. [2018-06-22 11:22:53,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:53,286 INFO ]: Finished difference Result 178 states and 404 transitions. [2018-06-22 11:22:53,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:22:53,287 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:22:53,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:53,289 INFO ]: With dead ends: 178 [2018-06-22 11:22:53,289 INFO ]: Without dead ends: 178 [2018-06-22 11:22:53,289 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=352, Invalid=2098, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:22:53,290 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 11:22:53,303 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 98. [2018-06-22 11:22:53,303 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 11:22:53,304 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 207 transitions. [2018-06-22 11:22:53,304 INFO ]: Start accepts. Automaton has 98 states and 207 transitions. Word has length 25 [2018-06-22 11:22:53,304 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:53,304 INFO ]: Abstraction has 98 states and 207 transitions. [2018-06-22 11:22:53,304 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:22:53,304 INFO ]: Start isEmpty. Operand 98 states and 207 transitions. [2018-06-22 11:22:53,306 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:53,306 INFO ]: Found error trace [2018-06-22 11:22:53,306 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:53,306 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:53,306 INFO ]: Analyzing trace with hash 1944428816, now seen corresponding path program 1 times [2018-06-22 11:22:53,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:53,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:53,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:53,306 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:53,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:53,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:53,531 INFO ]: Checked inductivity of 32 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:22:53,531 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:53,531 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:53,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:53,549 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:53,550 INFO ]: Computing forward predicates... [2018-06-22 11:22:53,615 INFO ]: Checked inductivity of 32 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:22:53,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:53,634 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:22:53,634 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:22:53,634 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:22:53,634 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:22:53,634 INFO ]: Start difference. First operand 98 states and 207 transitions. Second operand 14 states. [2018-06-22 11:22:54,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:54,196 INFO ]: Finished difference Result 180 states and 411 transitions. [2018-06-22 11:22:54,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:22:54,196 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:22:54,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:54,198 INFO ]: With dead ends: 180 [2018-06-22 11:22:54,198 INFO ]: Without dead ends: 180 [2018-06-22 11:22:54,199 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:22:54,199 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 11:22:54,213 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 140. [2018-06-22 11:22:54,213 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 11:22:54,214 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 311 transitions. [2018-06-22 11:22:54,214 INFO ]: Start accepts. Automaton has 140 states and 311 transitions. Word has length 25 [2018-06-22 11:22:54,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:54,214 INFO ]: Abstraction has 140 states and 311 transitions. [2018-06-22 11:22:54,214 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:22:54,214 INFO ]: Start isEmpty. Operand 140 states and 311 transitions. [2018-06-22 11:22:54,216 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:54,216 INFO ]: Found error trace [2018-06-22 11:22:54,216 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:54,216 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:54,216 INFO ]: Analyzing trace with hash 1388675829, now seen corresponding path program 1 times [2018-06-22 11:22:54,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:54,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:54,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:54,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:54,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:54,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:54,390 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:54,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:54,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:54,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:54,414 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:54,416 INFO ]: Computing forward predicates... [2018-06-22 11:22:54,485 INFO ]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:22:54,503 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:54,503 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-22 11:22:54,504 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:22:54,504 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:22:54,504 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:54,504 INFO ]: Start difference. First operand 140 states and 311 transitions. Second operand 17 states. [2018-06-22 11:22:55,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:55,516 INFO ]: Finished difference Result 254 states and 585 transitions. [2018-06-22 11:22:55,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:22:55,517 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:22:55,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:55,519 INFO ]: With dead ends: 254 [2018-06-22 11:22:55,519 INFO ]: Without dead ends: 254 [2018-06-22 11:22:55,520 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:22:55,520 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-22 11:22:55,541 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 184. [2018-06-22 11:22:55,541 INFO ]: Start removeUnreachable. Operand 184 states. [2018-06-22 11:22:55,543 INFO ]: Finished removeUnreachable. Reduced from 184 states to 184 states and 418 transitions. [2018-06-22 11:22:55,543 INFO ]: Start accepts. Automaton has 184 states and 418 transitions. Word has length 25 [2018-06-22 11:22:55,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:55,543 INFO ]: Abstraction has 184 states and 418 transitions. [2018-06-22 11:22:55,543 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:22:55,543 INFO ]: Start isEmpty. Operand 184 states and 418 transitions. [2018-06-22 11:22:55,547 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:55,547 INFO ]: Found error trace [2018-06-22 11:22:55,547 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:55,547 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:55,547 INFO ]: Analyzing trace with hash -1748808537, now seen corresponding path program 5 times [2018-06-22 11:22:55,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:55,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:55,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:55,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:55,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:55,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:55,681 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:55,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:55,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:55,691 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:22:55,706 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:22:55,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:55,707 INFO ]: Computing forward predicates... [2018-06-22 11:22:55,774 INFO ]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:55,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:55,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-06-22 11:22:55,793 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:22:55,793 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:22:55,793 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:55,793 INFO ]: Start difference. First operand 184 states and 418 transitions. Second operand 17 states. [2018-06-22 11:22:56,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:56,148 INFO ]: Finished difference Result 266 states and 615 transitions. [2018-06-22 11:22:56,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:22:56,148 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:22:56,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:56,151 INFO ]: With dead ends: 266 [2018-06-22 11:22:56,151 INFO ]: Without dead ends: 266 [2018-06-22 11:22:56,151 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:22:56,151 INFO ]: Start minimizeSevpa. Operand 266 states. [2018-06-22 11:22:56,173 INFO ]: Finished minimizeSevpa. Reduced states from 266 to 204. [2018-06-22 11:22:56,173 INFO ]: Start removeUnreachable. Operand 204 states. [2018-06-22 11:22:56,175 INFO ]: Finished removeUnreachable. Reduced from 204 states to 204 states and 464 transitions. [2018-06-22 11:22:56,175 INFO ]: Start accepts. Automaton has 204 states and 464 transitions. Word has length 25 [2018-06-22 11:22:56,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:56,176 INFO ]: Abstraction has 204 states and 464 transitions. [2018-06-22 11:22:56,176 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:22:56,176 INFO ]: Start isEmpty. Operand 204 states and 464 transitions. [2018-06-22 11:22:56,178 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:56,178 INFO ]: Found error trace [2018-06-22 11:22:56,179 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:56,179 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:56,179 INFO ]: Analyzing trace with hash 384364246, now seen corresponding path program 3 times [2018-06-22 11:22:56,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:56,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:56,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:56,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:56,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:56,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:56,373 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:22:56,563 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 11:22:56,641 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:56,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:56,641 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:56,647 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:56,662 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:22:56,663 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:56,665 INFO ]: Computing forward predicates... [2018-06-22 11:22:56,864 INFO ]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:56,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:56,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 11:22:56,898 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:22:56,898 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:22:56,899 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:22:56,899 INFO ]: Start difference. First operand 204 states and 464 transitions. Second operand 20 states. [2018-06-22 11:22:57,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:57,525 INFO ]: Finished difference Result 222 states and 509 transitions. [2018-06-22 11:22:57,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:22:57,525 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:22:57,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:57,527 INFO ]: With dead ends: 222 [2018-06-22 11:22:57,527 INFO ]: Without dead ends: 222 [2018-06-22 11:22:57,528 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:22:57,528 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 11:22:57,546 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 206. [2018-06-22 11:22:57,546 INFO ]: Start removeUnreachable. Operand 206 states. [2018-06-22 11:22:57,548 INFO ]: Finished removeUnreachable. Reduced from 206 states to 206 states and 469 transitions. [2018-06-22 11:22:57,548 INFO ]: Start accepts. Automaton has 206 states and 469 transitions. Word has length 25 [2018-06-22 11:22:57,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:57,548 INFO ]: Abstraction has 206 states and 469 transitions. [2018-06-22 11:22:57,548 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:22:57,548 INFO ]: Start isEmpty. Operand 206 states and 469 transitions. [2018-06-22 11:22:57,551 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:57,551 INFO ]: Found error trace [2018-06-22 11:22:57,551 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:57,551 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:57,551 INFO ]: Analyzing trace with hash 958990695, now seen corresponding path program 6 times [2018-06-22 11:22:57,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:57,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:57,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:57,552 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:57,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:57,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:57,659 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:57,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:57,659 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:57,670 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:22:57,689 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:22:57,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:57,691 INFO ]: Computing forward predicates... [2018-06-22 11:22:57,848 INFO ]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:22:57,869 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:57,869 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:22:57,869 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:22:57,869 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:22:57,869 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:22:57,870 INFO ]: Start difference. First operand 206 states and 469 transitions. Second operand 21 states. [2018-06-22 11:22:59,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:59,206 INFO ]: Finished difference Result 318 states and 735 transitions. [2018-06-22 11:22:59,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:22:59,206 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:22:59,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:59,208 INFO ]: With dead ends: 318 [2018-06-22 11:22:59,208 INFO ]: Without dead ends: 318 [2018-06-22 11:22:59,209 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:22:59,209 INFO ]: Start minimizeSevpa. Operand 318 states. [2018-06-22 11:22:59,235 INFO ]: Finished minimizeSevpa. Reduced states from 318 to 210. [2018-06-22 11:22:59,235 INFO ]: Start removeUnreachable. Operand 210 states. [2018-06-22 11:22:59,237 INFO ]: Finished removeUnreachable. Reduced from 210 states to 210 states and 479 transitions. [2018-06-22 11:22:59,237 INFO ]: Start accepts. Automaton has 210 states and 479 transitions. Word has length 25 [2018-06-22 11:22:59,237 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:59,237 INFO ]: Abstraction has 210 states and 479 transitions. [2018-06-22 11:22:59,237 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:22:59,237 INFO ]: Start isEmpty. Operand 210 states and 479 transitions. [2018-06-22 11:22:59,240 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:22:59,240 INFO ]: Found error trace [2018-06-22 11:22:59,240 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:59,240 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:59,240 INFO ]: Analyzing trace with hash 197784642, now seen corresponding path program 3 times [2018-06-22 11:22:59,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:59,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:59,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:59,240 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:59,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:59,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:59,364 INFO ]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:22:59,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:59,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:59,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:59,488 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:22:59,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:59,489 INFO ]: Computing forward predicates... [2018-06-22 11:22:59,547 INFO ]: Checked inductivity of 33 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:22:59,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:59,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-06-22 11:22:59,566 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:22:59,566 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:22:59,567 INFO ]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:22:59,567 INFO ]: Start difference. First operand 210 states and 479 transitions. Second operand 15 states. [2018-06-22 11:22:59,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:59,795 INFO ]: Finished difference Result 228 states and 518 transitions. [2018-06-22 11:22:59,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:59,801 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:22:59,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:59,803 INFO ]: With dead ends: 228 [2018-06-22 11:22:59,803 INFO ]: Without dead ends: 228 [2018-06-22 11:22:59,803 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:22:59,804 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-22 11:22:59,823 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 214. [2018-06-22 11:22:59,823 INFO ]: Start removeUnreachable. Operand 214 states. [2018-06-22 11:22:59,825 INFO ]: Finished removeUnreachable. Reduced from 214 states to 214 states and 485 transitions. [2018-06-22 11:22:59,825 INFO ]: Start accepts. Automaton has 214 states and 485 transitions. Word has length 25 [2018-06-22 11:22:59,825 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:59,825 INFO ]: Abstraction has 214 states and 485 transitions. [2018-06-22 11:22:59,825 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:22:59,825 INFO ]: Start isEmpty. Operand 214 states and 485 transitions. [2018-06-22 11:22:59,827 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:22:59,827 INFO ]: Found error trace [2018-06-22 11:22:59,827 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:59,827 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:59,827 INFO ]: Analyzing trace with hash 1249006598, now seen corresponding path program 2 times [2018-06-22 11:22:59,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:59,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:59,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:59,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:59,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:59,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:00,838 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:00,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:00,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:00,843 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:00,857 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:00,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:00,859 INFO ]: Computing forward predicates... [2018-06-22 11:23:01,052 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:01,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:01,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 11:23:01,070 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:23:01,071 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:23:01,071 INFO ]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:23:01,071 INFO ]: Start difference. First operand 214 states and 485 transitions. Second operand 19 states. [2018-06-22 11:23:02,045 WARN ]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 11:23:03,025 WARN ]: Spent 604.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-06-22 11:23:03,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:03,235 INFO ]: Finished difference Result 270 states and 611 transitions. [2018-06-22 11:23:03,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:23:03,235 INFO ]: Start accepts. Automaton has 19 states. Word has length 29 [2018-06-22 11:23:03,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:03,237 INFO ]: With dead ends: 270 [2018-06-22 11:23:03,237 INFO ]: Without dead ends: 270 [2018-06-22 11:23:03,238 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:23:03,238 INFO ]: Start minimizeSevpa. Operand 270 states. [2018-06-22 11:23:03,261 INFO ]: Finished minimizeSevpa. Reduced states from 270 to 208. [2018-06-22 11:23:03,261 INFO ]: Start removeUnreachable. Operand 208 states. [2018-06-22 11:23:03,263 INFO ]: Finished removeUnreachable. Reduced from 208 states to 208 states and 472 transitions. [2018-06-22 11:23:03,263 INFO ]: Start accepts. Automaton has 208 states and 472 transitions. Word has length 29 [2018-06-22 11:23:03,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:03,264 INFO ]: Abstraction has 208 states and 472 transitions. [2018-06-22 11:23:03,264 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:23:03,264 INFO ]: Start isEmpty. Operand 208 states and 472 transitions. [2018-06-22 11:23:03,266 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:03,266 INFO ]: Found error trace [2018-06-22 11:23:03,266 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:03,266 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:03,267 INFO ]: Analyzing trace with hash 1666055413, now seen corresponding path program 3 times [2018-06-22 11:23:03,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:03,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:03,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:03,267 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:03,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:03,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:03,498 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:03,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:03,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:03,506 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:23:03,522 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:23:03,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:03,523 INFO ]: Computing forward predicates... [2018-06-22 11:23:03,660 INFO ]: Checked inductivity of 31 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:03,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:03,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:23:03,678 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:23:03,678 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:23:03,678 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:23:03,679 INFO ]: Start difference. First operand 208 states and 472 transitions. Second operand 20 states. [2018-06-22 11:23:04,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:04,955 INFO ]: Finished difference Result 262 states and 595 transitions. [2018-06-22 11:23:04,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:23:04,955 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:23:04,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:04,958 INFO ]: With dead ends: 262 [2018-06-22 11:23:04,958 INFO ]: Without dead ends: 262 [2018-06-22 11:23:04,958 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:23:04,958 INFO ]: Start minimizeSevpa. Operand 262 states. [2018-06-22 11:23:04,979 INFO ]: Finished minimizeSevpa. Reduced states from 262 to 218. [2018-06-22 11:23:04,979 INFO ]: Start removeUnreachable. Operand 218 states. [2018-06-22 11:23:04,980 INFO ]: Finished removeUnreachable. Reduced from 218 states to 218 states and 497 transitions. [2018-06-22 11:23:04,980 INFO ]: Start accepts. Automaton has 218 states and 497 transitions. Word has length 29 [2018-06-22 11:23:04,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:04,980 INFO ]: Abstraction has 218 states and 497 transitions. [2018-06-22 11:23:04,980 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:23:04,981 INFO ]: Start isEmpty. Operand 218 states and 497 transitions. [2018-06-22 11:23:04,983 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:04,983 INFO ]: Found error trace [2018-06-22 11:23:04,983 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:04,983 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:04,984 INFO ]: Analyzing trace with hash 607337572, now seen corresponding path program 2 times [2018-06-22 11:23:04,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:04,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:04,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:04,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:04,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:04,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:05,321 INFO ]: Checked inductivity of 31 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:05,321 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:05,321 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:05,326 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:05,341 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:05,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:05,342 INFO ]: Computing forward predicates... [2018-06-22 11:23:05,510 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:05,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:05,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 11:23:05,541 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:23:05,542 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:23:05,542 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:23:05,542 INFO ]: Start difference. First operand 218 states and 497 transitions. Second operand 20 states. [2018-06-22 11:23:06,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:06,605 INFO ]: Finished difference Result 334 states and 741 transitions. [2018-06-22 11:23:06,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:23:06,605 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:23:06,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:06,608 INFO ]: With dead ends: 334 [2018-06-22 11:23:06,608 INFO ]: Without dead ends: 334 [2018-06-22 11:23:06,608 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:23:06,608 INFO ]: Start minimizeSevpa. Operand 334 states. [2018-06-22 11:23:06,635 INFO ]: Finished minimizeSevpa. Reduced states from 334 to 306. [2018-06-22 11:23:06,635 INFO ]: Start removeUnreachable. Operand 306 states. [2018-06-22 11:23:06,638 INFO ]: Finished removeUnreachable. Reduced from 306 states to 306 states and 679 transitions. [2018-06-22 11:23:06,638 INFO ]: Start accepts. Automaton has 306 states and 679 transitions. Word has length 29 [2018-06-22 11:23:06,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:06,638 INFO ]: Abstraction has 306 states and 679 transitions. [2018-06-22 11:23:06,638 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:23:06,638 INFO ]: Start isEmpty. Operand 306 states and 679 transitions. [2018-06-22 11:23:06,641 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:06,641 INFO ]: Found error trace [2018-06-22 11:23:06,641 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:06,641 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:06,641 INFO ]: Analyzing trace with hash -2098404319, now seen corresponding path program 1 times [2018-06-22 11:23:06,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:06,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:06,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:06,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:06,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:06,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:06,880 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:06,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:06,881 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:06,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:06,900 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:06,901 INFO ]: Computing forward predicates... [2018-06-22 11:23:07,441 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:07,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:07,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:23:07,471 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:23:07,471 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:23:07,471 INFO ]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:23:07,472 INFO ]: Start difference. First operand 306 states and 679 transitions. Second operand 21 states. [2018-06-22 11:23:09,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:09,074 INFO ]: Finished difference Result 462 states and 1050 transitions. [2018-06-22 11:23:09,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:23:09,074 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:23:09,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:09,079 INFO ]: With dead ends: 462 [2018-06-22 11:23:09,079 INFO ]: Without dead ends: 462 [2018-06-22 11:23:09,080 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:23:09,080 INFO ]: Start minimizeSevpa. Operand 462 states. [2018-06-22 11:23:09,124 INFO ]: Finished minimizeSevpa. Reduced states from 462 to 340. [2018-06-22 11:23:09,124 INFO ]: Start removeUnreachable. Operand 340 states. [2018-06-22 11:23:09,127 INFO ]: Finished removeUnreachable. Reduced from 340 states to 340 states and 757 transitions. [2018-06-22 11:23:09,127 INFO ]: Start accepts. Automaton has 340 states and 757 transitions. Word has length 29 [2018-06-22 11:23:09,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:09,128 INFO ]: Abstraction has 340 states and 757 transitions. [2018-06-22 11:23:09,128 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:23:09,128 INFO ]: Start isEmpty. Operand 340 states and 757 transitions. [2018-06-22 11:23:09,146 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:09,146 INFO ]: Found error trace [2018-06-22 11:23:09,147 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:09,147 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:09,147 INFO ]: Analyzing trace with hash -273778652, now seen corresponding path program 2 times [2018-06-22 11:23:09,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:09,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:09,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:09,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:09,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:09,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:09,429 INFO ]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:09,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:09,429 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:09,435 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:09,451 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:09,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:09,453 INFO ]: Computing forward predicates... [2018-06-22 11:23:09,614 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:23:09,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:09,634 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-06-22 11:23:09,634 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:23:09,634 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:23:09,634 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:23:09,634 INFO ]: Start difference. First operand 340 states and 757 transitions. Second operand 17 states. [2018-06-22 11:23:10,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:10,296 INFO ]: Finished difference Result 238 states and 510 transitions. [2018-06-22 11:23:10,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:23:10,296 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:23:10,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:10,297 INFO ]: With dead ends: 238 [2018-06-22 11:23:10,297 INFO ]: Without dead ends: 238 [2018-06-22 11:23:10,298 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:23:10,298 INFO ]: Start minimizeSevpa. Operand 238 states. [2018-06-22 11:23:10,308 INFO ]: Finished minimizeSevpa. Reduced states from 238 to 220. [2018-06-22 11:23:10,308 INFO ]: Start removeUnreachable. Operand 220 states. [2018-06-22 11:23:10,310 INFO ]: Finished removeUnreachable. Reduced from 220 states to 220 states and 471 transitions. [2018-06-22 11:23:10,310 INFO ]: Start accepts. Automaton has 220 states and 471 transitions. Word has length 29 [2018-06-22 11:23:10,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:10,311 INFO ]: Abstraction has 220 states and 471 transitions. [2018-06-22 11:23:10,311 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:23:10,311 INFO ]: Start isEmpty. Operand 220 states and 471 transitions. [2018-06-22 11:23:10,313 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:10,313 INFO ]: Found error trace [2018-06-22 11:23:10,313 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:10,313 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:10,313 INFO ]: Analyzing trace with hash -1359405640, now seen corresponding path program 2 times [2018-06-22 11:23:10,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:10,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:10,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:10,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:10,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:10,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:11,457 INFO ]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:11,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:11,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:11,462 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:11,476 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:11,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:11,478 INFO ]: Computing forward predicates... [2018-06-22 11:23:11,667 INFO ]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:23:11,685 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:11,685 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:23:11,685 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:23:11,685 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:23:11,686 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:23:11,686 INFO ]: Start difference. First operand 220 states and 471 transitions. Second operand 21 states. [2018-06-22 11:23:12,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:12,723 INFO ]: Finished difference Result 294 states and 633 transitions. [2018-06-22 11:23:12,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:23:12,724 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:23:12,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:12,725 INFO ]: With dead ends: 294 [2018-06-22 11:23:12,725 INFO ]: Without dead ends: 294 [2018-06-22 11:23:12,725 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:23:12,726 INFO ]: Start minimizeSevpa. Operand 294 states. [2018-06-22 11:23:12,742 INFO ]: Finished minimizeSevpa. Reduced states from 294 to 236. [2018-06-22 11:23:12,742 INFO ]: Start removeUnreachable. Operand 236 states. [2018-06-22 11:23:12,744 INFO ]: Finished removeUnreachable. Reduced from 236 states to 236 states and 501 transitions. [2018-06-22 11:23:12,744 INFO ]: Start accepts. Automaton has 236 states and 501 transitions. Word has length 29 [2018-06-22 11:23:12,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:12,745 INFO ]: Abstraction has 236 states and 501 transitions. [2018-06-22 11:23:12,745 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:23:12,745 INFO ]: Start isEmpty. Operand 236 states and 501 transitions. [2018-06-22 11:23:12,747 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:12,747 INFO ]: Found error trace [2018-06-22 11:23:12,747 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:12,747 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:12,747 INFO ]: Analyzing trace with hash 311739731, now seen corresponding path program 1 times [2018-06-22 11:23:12,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:12,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:12,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:12,747 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:12,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:12,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:12,891 INFO ]: Checked inductivity of 31 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:12,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:12,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:12,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:12,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:12,912 INFO ]: Computing forward predicates... [2018-06-22 11:23:13,135 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:23:13,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:13,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:23:13,154 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:23:13,154 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:23:13,154 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:23:13,154 INFO ]: Start difference. First operand 236 states and 501 transitions. Second operand 18 states. [2018-06-22 11:23:14,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:14,044 INFO ]: Finished difference Result 264 states and 562 transitions. [2018-06-22 11:23:14,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:23:14,044 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:23:14,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:14,045 INFO ]: With dead ends: 264 [2018-06-22 11:23:14,045 INFO ]: Without dead ends: 264 [2018-06-22 11:23:14,045 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:23:14,046 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-22 11:23:14,057 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 238. [2018-06-22 11:23:14,057 INFO ]: Start removeUnreachable. Operand 238 states. [2018-06-22 11:23:14,059 INFO ]: Finished removeUnreachable. Reduced from 238 states to 238 states and 502 transitions. [2018-06-22 11:23:14,059 INFO ]: Start accepts. Automaton has 238 states and 502 transitions. Word has length 29 [2018-06-22 11:23:14,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:14,059 INFO ]: Abstraction has 238 states and 502 transitions. [2018-06-22 11:23:14,059 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:23:14,059 INFO ]: Start isEmpty. Operand 238 states and 502 transitions. [2018-06-22 11:23:14,063 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:14,063 INFO ]: Found error trace [2018-06-22 11:23:14,063 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:14,063 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:14,063 INFO ]: Analyzing trace with hash 1742868622, now seen corresponding path program 7 times [2018-06-22 11:23:14,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:14,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:14,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:14,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:14,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:14,071 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:14,679 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:23:14,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:14,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:14,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:14,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:14,702 INFO ]: Computing forward predicates... [2018-06-22 11:23:14,890 INFO ]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:23:14,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:14,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-06-22 11:23:14,909 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:23:14,909 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:23:14,910 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:23:14,910 INFO ]: Start difference. First operand 238 states and 502 transitions. Second operand 23 states. [2018-06-22 11:23:16,879 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-06-22 11:23:18,955 WARN ]: Spent 587.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2018-06-22 11:23:19,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:19,442 INFO ]: Finished difference Result 346 states and 763 transitions. [2018-06-22 11:23:19,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:23:19,442 INFO ]: Start accepts. Automaton has 23 states. Word has length 29 [2018-06-22 11:23:19,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:19,444 INFO ]: With dead ends: 346 [2018-06-22 11:23:19,444 INFO ]: Without dead ends: 346 [2018-06-22 11:23:19,445 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=476, Invalid=2716, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:23:19,445 INFO ]: Start minimizeSevpa. Operand 346 states. [2018-06-22 11:23:19,467 INFO ]: Finished minimizeSevpa. Reduced states from 346 to 250. [2018-06-22 11:23:19,467 INFO ]: Start removeUnreachable. Operand 250 states. [2018-06-22 11:23:19,469 INFO ]: Finished removeUnreachable. Reduced from 250 states to 250 states and 532 transitions. [2018-06-22 11:23:19,469 INFO ]: Start accepts. Automaton has 250 states and 532 transitions. Word has length 29 [2018-06-22 11:23:19,469 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:19,469 INFO ]: Abstraction has 250 states and 532 transitions. [2018-06-22 11:23:19,469 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:23:19,469 INFO ]: Start isEmpty. Operand 250 states and 532 transitions. [2018-06-22 11:23:19,471 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:19,471 INFO ]: Found error trace [2018-06-22 11:23:19,471 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:19,471 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:19,471 INFO ]: Analyzing trace with hash 1187749198, now seen corresponding path program 8 times [2018-06-22 11:23:19,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:19,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:19,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:19,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:19,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:19,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:19,756 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:23:19,756 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:19,756 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:19,762 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:19,779 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:19,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:19,781 INFO ]: Computing forward predicates... [2018-06-22 11:23:20,080 INFO ]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:23:20,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:20,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-06-22 11:23:20,098 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:23:20,098 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:23:20,098 INFO ]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:23:20,099 INFO ]: Start difference. First operand 250 states and 532 transitions. Second operand 25 states. [2018-06-22 11:23:21,025 WARN ]: Spent 267.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-06-22 11:23:22,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:22,883 INFO ]: Finished difference Result 388 states and 871 transitions. [2018-06-22 11:23:22,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 11:23:22,884 INFO ]: Start accepts. Automaton has 25 states. Word has length 29 [2018-06-22 11:23:22,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:22,886 INFO ]: With dead ends: 388 [2018-06-22 11:23:22,886 INFO ]: Without dead ends: 388 [2018-06-22 11:23:22,887 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=785, Invalid=4471, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 11:23:22,887 INFO ]: Start minimizeSevpa. Operand 388 states. [2018-06-22 11:23:22,910 INFO ]: Finished minimizeSevpa. Reduced states from 388 to 248. [2018-06-22 11:23:22,910 INFO ]: Start removeUnreachable. Operand 248 states. [2018-06-22 11:23:22,912 INFO ]: Finished removeUnreachable. Reduced from 248 states to 248 states and 533 transitions. [2018-06-22 11:23:22,912 INFO ]: Start accepts. Automaton has 248 states and 533 transitions. Word has length 29 [2018-06-22 11:23:22,912 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:22,912 INFO ]: Abstraction has 248 states and 533 transitions. [2018-06-22 11:23:22,912 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:23:22,912 INFO ]: Start isEmpty. Operand 248 states and 533 transitions. [2018-06-22 11:23:22,914 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:22,914 INFO ]: Found error trace [2018-06-22 11:23:22,914 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:23:22,914 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:22,914 INFO ]: Analyzing trace with hash -277879430, now seen corresponding path program 2 times [2018-06-22 11:23:22,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:22,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:22,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:22,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:22,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:22,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:23,038 INFO ]: Checked inductivity of 48 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:23:23,038 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:23,038 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:23,048 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:23,064 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:23,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:23,066 INFO ]: Computing forward predicates... [2018-06-22 11:23:23,323 INFO ]: Checked inductivity of 48 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:23:23,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:23,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-22 11:23:23,341 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:23:23,341 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:23:23,342 INFO ]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:23:23,342 INFO ]: Start difference. First operand 248 states and 533 transitions. Second operand 25 states. [2018-06-22 11:23:25,007 WARN ]: Spent 479.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-06-22 11:23:26,558 WARN ]: Spent 699.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-06-22 11:23:26,984 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-06-22 11:23:27,152 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 Received shutdown request... [2018-06-22 11:23:28,011 WARN ]: Removed 8 from assertion stack [2018-06-22 11:23:28,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 11:23:28,011 WARN ]: Verification canceled [2018-06-22 11:23:28,014 WARN ]: Timeout [2018-06-22 11:23:28,014 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:23:28 BoogieIcfgContainer [2018-06-22 11:23:28,014 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:23:28,015 INFO ]: Toolchain (without parser) took 58715.00 ms. Allocated memory was 303.6 MB in the beginning and 805.8 MB in the end (delta: 502.3 MB). Free memory was 258.1 MB in the beginning and 497.8 MB in the end (delta: -239.7 MB). Peak memory consumption was 262.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:28,016 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:23:28,016 INFO ]: ChcToBoogie took 49.99 ms. Allocated memory is still 303.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:28,016 INFO ]: Boogie Preprocessor took 41.04 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:28,016 INFO ]: RCFGBuilder took 398.60 ms. Allocated memory is still 303.6 MB. Free memory was 254.1 MB in the beginning and 243.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:28,017 INFO ]: TraceAbstraction took 58213.55 ms. Allocated memory was 303.6 MB in the beginning and 805.8 MB in the end (delta: 502.3 MB). Free memory was 242.1 MB in the beginning and 497.8 MB in the end (delta: -255.7 MB). Peak memory consumption was 246.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:28,019 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.99 ms. Allocated memory is still 303.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.04 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 398.60 ms. Allocated memory is still 303.6 MB. Free memory was 254.1 MB in the beginning and 243.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58213.55 ms. Allocated memory was 303.6 MB in the beginning and 805.8 MB in the end (delta: 502.3 MB). Free memory was 242.1 MB in the beginning and 497.8 MB in the end (delta: -255.7 MB). Peak memory consumption was 246.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (248states) and interpolant automaton (currently 49 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 41. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. TIMEOUT Result, 58.1s OverallTime, 40 OverallIterations, 6 TraceHistogramMax, 39.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2031 SDtfs, 812 SDslu, 15757 SDs, 0 SdLazy, 18104 SolverSat, 4359 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1796 GetRequests, 689 SyntacticMatches, 5 SemanticMatches, 1101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7360 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=34, 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.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 1484 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 1725 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 1648 ConstructedInterpolants, 52 QuantifiedInterpolants, 194208 SizeOfPredicates, 341 NumberOfNonLiveVariables, 4397 ConjunctsInSsa, 785 ConjunctsInUnsatCore, 77 InterpolantComputations, 3 PerfectInterpolantSequences, 676/1657 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-23-28-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-23-28-035.csv Completed graceful shutdown