java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:09:35,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:09:35,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:09:35,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:09:35,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:09:35,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:09:35,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:09:35,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:09:35,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:09:35,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:09:35,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:09:35,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:09:35,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:09:35,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:09:35,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:09:35,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:09:35,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:09:35,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:09:35,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:09:35,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:09:35,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:09:35,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:09:35,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:09:35,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:09:35,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:09:35,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:09:35,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:09:35,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:09:35,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:09:35,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:09:35,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:09:35,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:09:35,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:09:35,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:09:35,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:09:35,191 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:09:35,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:09:35,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:09:35,210 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:09:35,210 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:09:35,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:09:35,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:09:35,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:09:35,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:09:35,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:09:35,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:09:35,215 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:09:35,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:09:35,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:09:35,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:09:35,216 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:09:35,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:09:35,216 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:09:35,217 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:09:35,219 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:09:35,270 INFO ]: Repository-Root is: /tmp [2018-06-22 01:09:35,290 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:09:35,296 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:09:35,297 INFO ]: Initializing SmtParser... [2018-06-22 01:09:35,298 INFO ]: SmtParser initialized [2018-06-22 01:09:35,298 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 [2018-06-22 01:09:35,301 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:09:35,402 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 unknown [2018-06-22 01:09:35,594 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 [2018-06-22 01:09:35,599 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:09:35,619 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:09:35,619 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:09:35,619 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:09:35,620 INFO ]: ChcToBoogie initialized [2018-06-22 01:09:35,624 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,684 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35 Unit [2018-06-22 01:09:35,684 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:09:35,684 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:09:35,684 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:09:35,684 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:09:35,709 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,709 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,716 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,716 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,719 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,722 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,723 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... [2018-06-22 01:09:35,726 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:09:35,726 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:09:35,726 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:09:35,726 INFO ]: RCFGBuilder initialized [2018-06-22 01:09:35,727 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:09:35,745 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:09:35,745 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:09:35,745 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:09:35,745 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:09:35,745 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:09:35,745 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:09:36,090 INFO ]: Using library mode [2018-06-22 01:09:36,091 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:09:36 BoogieIcfgContainer [2018-06-22 01:09:36,091 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:09:36,092 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:09:36,092 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:09:36,102 INFO ]: TraceAbstraction initialized [2018-06-22 01:09:36,103 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:09:35" (1/3) ... [2018-06-22 01:09:36,103 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b636a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:09:36, skipping insertion in model container [2018-06-22 01:09:36,103 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:35" (2/3) ... [2018-06-22 01:09:36,104 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b636a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:09:36, skipping insertion in model container [2018-06-22 01:09:36,104 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:09:36" (3/3) ... [2018-06-22 01:09:36,107 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:09:36,117 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:09:36,125 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:09:36,166 INFO ]: Using default assertion order modulation [2018-06-22 01:09:36,167 INFO ]: Interprodecural is true [2018-06-22 01:09:36,167 INFO ]: Hoare is false [2018-06-22 01:09:36,167 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:09:36,167 INFO ]: Backedges is TWOTRACK [2018-06-22 01:09:36,167 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:09:36,167 INFO ]: Difference is false [2018-06-22 01:09:36,167 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:09:36,167 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:09:36,183 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:09:36,195 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:09:36,195 INFO ]: Found error trace [2018-06-22 01:09:36,196 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:36,196 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:36,202 INFO ]: Analyzing trace with hash 1204444680, now seen corresponding path program 1 times [2018-06-22 01:09:36,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:36,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:36,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:36,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:36,384 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:36,385 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:09:36,385 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:09:36,387 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:09:36,397 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:09:36,398 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:09:36,400 INFO ]: Start difference. First operand 13 states. Second operand 3 states. [2018-06-22 01:09:36,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:36,460 INFO ]: Finished difference Result 12 states and 15 transitions. [2018-06-22 01:09:36,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:09:36,462 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-22 01:09:36,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:36,470 INFO ]: With dead ends: 12 [2018-06-22 01:09:36,470 INFO ]: Without dead ends: 12 [2018-06-22 01:09:36,472 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:09:36,484 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:09:36,513 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:09:36,514 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:09:36,515 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-06-22 01:09:36,517 INFO ]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 10 [2018-06-22 01:09:36,517 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:36,517 INFO ]: Abstraction has 12 states and 15 transitions. [2018-06-22 01:09:36,517 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:09:36,517 INFO ]: Start isEmpty. Operand 12 states and 15 transitions. [2018-06-22 01:09:36,517 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:09:36,517 INFO ]: Found error trace [2018-06-22 01:09:36,518 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:36,518 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:36,518 INFO ]: Analyzing trace with hash 1089928076, now seen corresponding path program 1 times [2018-06-22 01:09:36,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:36,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:36,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:36,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:36,697 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:36,697 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:09:36,698 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:09:36,699 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:36,699 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:36,699 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:36,699 INFO ]: Start difference. First operand 12 states and 15 transitions. Second operand 5 states. [2018-06-22 01:09:36,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:36,939 INFO ]: Finished difference Result 18 states and 24 transitions. [2018-06-22 01:09:36,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:36,940 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:09:36,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:36,943 INFO ]: With dead ends: 18 [2018-06-22 01:09:36,943 INFO ]: Without dead ends: 18 [2018-06-22 01:09:36,946 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:36,946 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:09:36,950 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-22 01:09:36,950 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:09:36,951 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-22 01:09:36,951 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 10 [2018-06-22 01:09:36,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:36,951 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-22 01:09:36,951 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:36,951 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-22 01:09:36,951 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:36,951 INFO ]: Found error trace [2018-06-22 01:09:36,951 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:36,951 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:36,952 INFO ]: Analyzing trace with hash -1263391770, now seen corresponding path program 1 times [2018-06-22 01:09:36,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:36,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:36,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:36,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:36,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:37,081 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:37,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:37,081 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:37,088 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:37,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:37,120 INFO ]: Computing forward predicates... [2018-06-22 01:09:37,159 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:37,180 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:37,180 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:09:37,180 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:37,181 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:37,181 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:37,181 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 5 states. [2018-06-22 01:09:37,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:37,213 INFO ]: Finished difference Result 16 states and 21 transitions. [2018-06-22 01:09:37,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:37,213 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:09:37,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:37,215 INFO ]: With dead ends: 16 [2018-06-22 01:09:37,215 INFO ]: Without dead ends: 16 [2018-06-22 01:09:37,215 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:37,216 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:09:37,219 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-22 01:09:37,219 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:09:37,219 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-22 01:09:37,219 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2018-06-22 01:09:37,219 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:37,219 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-22 01:09:37,219 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:37,220 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-22 01:09:37,220 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:37,220 INFO ]: Found error trace [2018-06-22 01:09:37,220 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:37,220 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:37,220 INFO ]: Analyzing trace with hash 168065780, now seen corresponding path program 1 times [2018-06-22 01:09:37,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:37,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:37,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:37,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:37,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:37,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:37,323 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:37,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:37,323 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:37,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:37,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:37,371 INFO ]: Computing forward predicates... [2018-06-22 01:09:37,538 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:37,562 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:09:37,562 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-06-22 01:09:37,562 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:09:37,562 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:09:37,562 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:37,562 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 7 states. [2018-06-22 01:09:37,816 WARN ]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 01:09:38,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:38,019 INFO ]: Finished difference Result 42 states and 55 transitions. [2018-06-22 01:09:38,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:09:38,020 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:09:38,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:38,021 INFO ]: With dead ends: 42 [2018-06-22 01:09:38,021 INFO ]: Without dead ends: 42 [2018-06-22 01:09:38,022 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:38,022 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:09:38,025 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 16. [2018-06-22 01:09:38,025 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:09:38,026 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-22 01:09:38,026 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 11 [2018-06-22 01:09:38,026 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:38,026 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-22 01:09:38,026 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:09:38,026 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-22 01:09:38,026 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:38,026 INFO ]: Found error trace [2018-06-22 01:09:38,026 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:38,026 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:38,026 INFO ]: Analyzing trace with hash -518439198, now seen corresponding path program 1 times [2018-06-22 01:09:38,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:38,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:38,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:38,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:38,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:38,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:38,223 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:38,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:38,223 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 01:09:38,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:38,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:38,279 INFO ]: Computing forward predicates... [2018-06-22 01:09:38,619 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:38,656 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:09:38,656 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-22 01:09:38,656 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:09:38,656 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:09:38,656 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:38,657 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 8 states. [2018-06-22 01:09:38,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:38,935 INFO ]: Finished difference Result 26 states and 36 transitions. [2018-06-22 01:09:38,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:09:38,935 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 01:09:38,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:38,936 INFO ]: With dead ends: 26 [2018-06-22 01:09:38,936 INFO ]: Without dead ends: 24 [2018-06-22 01:09:38,936 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:38,937 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:09:38,938 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-22 01:09:38,939 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:09:38,939 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 01:09:38,939 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 11 [2018-06-22 01:09:38,939 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:38,939 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 01:09:38,939 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:09:38,939 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 01:09:38,940 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:38,940 INFO ]: Found error trace [2018-06-22 01:09:38,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:38,940 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:38,940 INFO ]: Analyzing trace with hash -641280846, now seen corresponding path program 1 times [2018-06-22 01:09:38,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:38,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:38,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:38,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:38,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:38,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:38,977 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:38,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:38,977 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:38,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:39,002 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:39,003 INFO ]: Computing forward predicates... [2018-06-22 01:09:39,007 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:39,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:39,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:09:39,030 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:09:39,030 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:09:39,030 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:09:39,030 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2018-06-22 01:09:39,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:39,052 INFO ]: Finished difference Result 18 states and 24 transitions. [2018-06-22 01:09:39,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:09:39,052 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:09:39,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:39,052 INFO ]: With dead ends: 18 [2018-06-22 01:09:39,052 INFO ]: Without dead ends: 18 [2018-06-22 01:09:39,053 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:09:39,053 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:09:39,054 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:09:39,055 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:09:39,055 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-22 01:09:39,055 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2018-06-22 01:09:39,055 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:39,055 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-22 01:09:39,055 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:09:39,055 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-22 01:09:39,056 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:09:39,056 INFO ]: Found error trace [2018-06-22 01:09:39,056 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:39,056 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:39,056 INFO ]: Analyzing trace with hash 968600698, now seen corresponding path program 1 times [2018-06-22 01:09:39,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:39,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:39,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:39,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:39,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:39,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:39,480 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:39,480 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:39,480 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 01:09:39,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:39,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:39,509 INFO ]: Computing forward predicates... [2018-06-22 01:09:39,534 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:39,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:39,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:09:39,555 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:09:39,555 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:09:39,555 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:39,555 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 7 states. [2018-06-22 01:09:39,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:39,843 INFO ]: Finished difference Result 30 states and 40 transitions. [2018-06-22 01:09:39,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:09:39,844 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:09:39,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:39,844 INFO ]: With dead ends: 30 [2018-06-22 01:09:39,844 INFO ]: Without dead ends: 30 [2018-06-22 01:09:39,845 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:09:39,845 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:09:39,847 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-06-22 01:09:39,847 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:09:39,848 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-22 01:09:39,848 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 12 [2018-06-22 01:09:39,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:39,848 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-22 01:09:39,848 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:09:39,848 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-22 01:09:39,848 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:09:39,848 INFO ]: Found error trace [2018-06-22 01:09:39,848 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:39,849 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:39,849 INFO ]: Analyzing trace with hash -1959803250, now seen corresponding path program 2 times [2018-06-22 01:09:39,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:39,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:39,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:39,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:39,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:39,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:39,899 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:39,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:39,899 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:39,908 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:39,920 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:39,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:39,921 INFO ]: Computing forward predicates... [2018-06-22 01:09:39,926 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:39,947 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:39,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:09:39,947 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:39,947 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:39,947 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:39,947 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 5 states. [2018-06-22 01:09:39,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:39,967 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-22 01:09:39,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:39,968 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-22 01:09:39,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:39,968 INFO ]: With dead ends: 20 [2018-06-22 01:09:39,968 INFO ]: Without dead ends: 20 [2018-06-22 01:09:39,968 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:39,969 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:09:39,970 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:09:39,970 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:09:39,971 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-22 01:09:39,971 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 12 [2018-06-22 01:09:39,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:39,971 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-22 01:09:39,971 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:39,971 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-22 01:09:39,971 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:09:39,971 INFO ]: Found error trace [2018-06-22 01:09:39,971 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:39,971 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:39,972 INFO ]: Analyzing trace with hash -1225791450, now seen corresponding path program 2 times [2018-06-22 01:09:39,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:39,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:39,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:39,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:39,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:39,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,040 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:40,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:40,048 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:40,059 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:40,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,061 INFO ]: Computing forward predicates... [2018-06-22 01:09:40,085 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:40,106 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:09:40,106 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:09:40,106 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:09:40,106 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:40,106 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-06-22 01:09:40,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:40,130 INFO ]: Finished difference Result 24 states and 32 transitions. [2018-06-22 01:09:40,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:09:40,130 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 01:09:40,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:40,130 INFO ]: With dead ends: 24 [2018-06-22 01:09:40,130 INFO ]: Without dead ends: 24 [2018-06-22 01:09:40,131 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:40,131 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:09:40,133 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 01:09:40,133 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:09:40,134 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-06-22 01:09:40,134 INFO ]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2018-06-22 01:09:40,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:40,134 INFO ]: Abstraction has 22 states and 30 transitions. [2018-06-22 01:09:40,134 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:09:40,134 INFO ]: Start isEmpty. Operand 22 states and 30 transitions. [2018-06-22 01:09:40,134 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:09:40,134 INFO ]: Found error trace [2018-06-22 01:09:40,134 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:40,134 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:40,134 INFO ]: Analyzing trace with hash -177802782, now seen corresponding path program 2 times [2018-06-22 01:09:40,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:40,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:40,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:40,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,387 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,387 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:40,387 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:40,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:40,410 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:40,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,412 INFO ]: Computing forward predicates... [2018-06-22 01:09:40,461 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:40,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 01:09:40,491 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:09:40,491 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:09:40,491 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:09:40,491 INFO ]: Start difference. First operand 22 states and 30 transitions. Second operand 10 states. [2018-06-22 01:09:40,784 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:40,784 INFO ]: Finished difference Result 61 states and 74 transitions. [2018-06-22 01:09:40,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:09:40,786 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:09:40,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:40,787 INFO ]: With dead ends: 61 [2018-06-22 01:09:40,787 INFO ]: Without dead ends: 61 [2018-06-22 01:09:40,788 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:09:40,788 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:09:40,791 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 21. [2018-06-22 01:09:40,791 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:09:40,792 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 01:09:40,792 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2018-06-22 01:09:40,792 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:40,792 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 01:09:40,792 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:09:40,792 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 01:09:40,793 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:09:40,793 INFO ]: Found error trace [2018-06-22 01:09:40,793 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:40,793 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:40,793 INFO ]: Analyzing trace with hash 15379380, now seen corresponding path program 3 times [2018-06-22 01:09:40,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:40,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:40,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,799 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:40,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:40,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:40,995 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:40,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:40,995 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:41,003 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:41,032 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:09:41,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:41,035 INFO ]: Computing forward predicates... [2018-06-22 01:09:41,131 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:41,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:41,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:09:41,162 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:09:41,162 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:09:41,163 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:41,163 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 11 states. [2018-06-22 01:09:41,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:41,278 INFO ]: Finished difference Result 43 states and 53 transitions. [2018-06-22 01:09:41,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:09:41,279 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 01:09:41,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:41,279 INFO ]: With dead ends: 43 [2018-06-22 01:09:41,279 INFO ]: Without dead ends: 40 [2018-06-22 01:09:41,280 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:09:41,280 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:09:41,282 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-06-22 01:09:41,282 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:09:41,283 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-06-22 01:09:41,283 INFO ]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2018-06-22 01:09:41,283 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:41,283 INFO ]: Abstraction has 22 states and 29 transitions. [2018-06-22 01:09:41,283 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:09:41,283 INFO ]: Start isEmpty. Operand 22 states and 29 transitions. [2018-06-22 01:09:41,283 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:09:41,283 INFO ]: Found error trace [2018-06-22 01:09:41,283 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:41,284 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:41,284 INFO ]: Analyzing trace with hash 115675186, now seen corresponding path program 3 times [2018-06-22 01:09:41,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:41,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:41,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:41,284 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:41,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:41,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:41,348 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:41,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:41,348 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:41,357 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:41,396 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:09:41,396 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:41,398 INFO ]: Computing forward predicates... [2018-06-22 01:09:41,467 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:41,489 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:09:41,489 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 01:09:41,489 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:09:41,489 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:09:41,490 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:41,490 INFO ]: Start difference. First operand 22 states and 29 transitions. Second operand 8 states. [2018-06-22 01:09:41,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:41,553 INFO ]: Finished difference Result 34 states and 42 transitions. [2018-06-22 01:09:41,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:09:41,554 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:09:41,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:41,554 INFO ]: With dead ends: 34 [2018-06-22 01:09:41,554 INFO ]: Without dead ends: 34 [2018-06-22 01:09:41,555 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:41,555 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:09:41,557 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-22 01:09:41,557 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:09:41,557 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-22 01:09:41,557 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 13 [2018-06-22 01:09:41,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:41,557 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-22 01:09:41,557 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:09:41,557 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-22 01:09:41,558 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:09:41,558 INFO ]: Found error trace [2018-06-22 01:09:41,558 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:41,558 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:41,558 INFO ]: Analyzing trace with hash -1163390132, now seen corresponding path program 4 times [2018-06-22 01:09:41,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:41,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:41,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:41,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:41,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:41,568 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:41,635 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:41,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:41,635 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 01:09:41,644 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:41,656 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:41,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:41,657 INFO ]: Computing forward predicates... [2018-06-22 01:09:41,689 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:41,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:41,710 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:09:41,710 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:09:41,710 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:09:41,710 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:41,710 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 9 states. [2018-06-22 01:09:42,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:42,073 INFO ]: Finished difference Result 37 states and 48 transitions. [2018-06-22 01:09:42,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:09:42,073 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:09:42,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:42,073 INFO ]: With dead ends: 37 [2018-06-22 01:09:42,073 INFO ]: Without dead ends: 37 [2018-06-22 01:09:42,074 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:09:42,074 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:09:42,076 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-06-22 01:09:42,076 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:09:42,077 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-06-22 01:09:42,077 INFO ]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 14 [2018-06-22 01:09:42,077 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:42,077 INFO ]: Abstraction has 24 states and 33 transitions. [2018-06-22 01:09:42,077 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:09:42,077 INFO ]: Start isEmpty. Operand 24 states and 33 transitions. [2018-06-22 01:09:42,078 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:09:42,078 INFO ]: Found error trace [2018-06-22 01:09:42,078 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:42,078 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:42,078 INFO ]: Analyzing trace with hash 548377702, now seen corresponding path program 3 times [2018-06-22 01:09:42,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:42,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:42,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:42,079 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:42,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:42,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:42,142 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:42,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:42,142 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 01:09:42,148 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:42,187 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:09:42,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:42,189 INFO ]: Computing forward predicates... [2018-06-22 01:09:42,627 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:42,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:42,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:09:42,660 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:09:42,660 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:09:42,660 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:42,661 INFO ]: Start difference. First operand 24 states and 33 transitions. Second operand 9 states. [2018-06-22 01:09:42,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:42,955 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-22 01:09:42,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:09:42,958 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-22 01:09:42,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:42,958 INFO ]: With dead ends: 29 [2018-06-22 01:09:42,958 INFO ]: Without dead ends: 29 [2018-06-22 01:09:42,959 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:42,959 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:09:42,961 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-06-22 01:09:42,961 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:09:42,961 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-06-22 01:09:42,961 INFO ]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 15 [2018-06-22 01:09:42,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:42,961 INFO ]: Abstraction has 26 states and 35 transitions. [2018-06-22 01:09:42,961 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:09:42,961 INFO ]: Start isEmpty. Operand 26 states and 35 transitions. [2018-06-22 01:09:42,962 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:09:42,962 INFO ]: Found error trace [2018-06-22 01:09:42,962 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:42,962 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:42,962 INFO ]: Analyzing trace with hash 949460660, now seen corresponding path program 5 times [2018-06-22 01:09:42,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:42,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:42,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:42,963 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:42,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:42,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:43,468 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:43,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:43,468 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 01:09:43,484 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:43,518 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:09:43,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:43,519 INFO ]: Computing forward predicates... [2018-06-22 01:09:43,669 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:43,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:43,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:09:43,690 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:09:43,690 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:09:43,690 INFO ]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:09:43,690 INFO ]: Start difference. First operand 26 states and 35 transitions. Second operand 13 states. [2018-06-22 01:09:44,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:44,153 INFO ]: Finished difference Result 85 states and 100 transitions. [2018-06-22 01:09:44,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:09:44,154 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-22 01:09:44,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:44,155 INFO ]: With dead ends: 85 [2018-06-22 01:09:44,155 INFO ]: Without dead ends: 85 [2018-06-22 01:09:44,156 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=886, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:09:44,156 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 01:09:44,163 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 25. [2018-06-22 01:09:44,163 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:09:44,164 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-22 01:09:44,164 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2018-06-22 01:09:44,164 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:44,164 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-22 01:09:44,164 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:09:44,164 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-22 01:09:44,164 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:09:44,164 INFO ]: Found error trace [2018-06-22 01:09:44,165 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:44,166 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:44,166 INFO ]: Analyzing trace with hash -1651826910, now seen corresponding path program 6 times [2018-06-22 01:09:44,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:44,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:44,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:44,166 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:44,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:44,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:44,335 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:44,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:44,335 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 01:09:44,341 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:09:44,380 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:09:44,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:44,382 INFO ]: Computing forward predicates... [2018-06-22 01:09:44,460 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:44,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:44,481 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-22 01:09:44,481 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:09:44,481 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:09:44,481 INFO ]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:09:44,481 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 14 states. [2018-06-22 01:09:44,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:44,624 INFO ]: Finished difference Result 63 states and 75 transitions. [2018-06-22 01:09:44,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:09:44,624 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-22 01:09:44,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:44,625 INFO ]: With dead ends: 63 [2018-06-22 01:09:44,625 INFO ]: Without dead ends: 59 [2018-06-22 01:09:44,625 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:09:44,625 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:09:44,627 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 26. [2018-06-22 01:09:44,627 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:09:44,628 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-06-22 01:09:44,628 INFO ]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2018-06-22 01:09:44,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:44,628 INFO ]: Abstraction has 26 states and 34 transitions. [2018-06-22 01:09:44,628 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:09:44,628 INFO ]: Start isEmpty. Operand 26 states and 34 transitions. [2018-06-22 01:09:44,629 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:09:44,629 INFO ]: Found error trace [2018-06-22 01:09:44,629 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:44,629 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:44,629 INFO ]: Analyzing trace with hash 1014443936, now seen corresponding path program 1 times [2018-06-22 01:09:44,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:44,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:44,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:44,629 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:44,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:44,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:44,760 INFO ]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:44,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:44,760 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 01:09:44,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:44,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:44,788 INFO ]: Computing forward predicates... [2018-06-22 01:09:44,832 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:09:44,854 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:44,854 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 01:09:44,854 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:09:44,854 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:09:44,854 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:44,855 INFO ]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2018-06-22 01:09:45,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:45,332 INFO ]: Finished difference Result 42 states and 51 transitions. [2018-06-22 01:09:45,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:09:45,332 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:09:45,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:45,332 INFO ]: With dead ends: 42 [2018-06-22 01:09:45,332 INFO ]: Without dead ends: 42 [2018-06-22 01:09:45,333 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:09:45,333 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:09:45,335 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-06-22 01:09:45,335 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:09:45,336 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-06-22 01:09:45,336 INFO ]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2018-06-22 01:09:45,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:45,336 INFO ]: Abstraction has 27 states and 35 transitions. [2018-06-22 01:09:45,336 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:09:45,336 INFO ]: Start isEmpty. Operand 27 states and 35 transitions. [2018-06-22 01:09:45,336 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:09:45,336 INFO ]: Found error trace [2018-06-22 01:09:45,336 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:45,336 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:45,336 INFO ]: Analyzing trace with hash -577961798, now seen corresponding path program 7 times [2018-06-22 01:09:45,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:45,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:45,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:45,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:45,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:45,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:45,466 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:45,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:45,467 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 01:09:45,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:45,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:45,495 INFO ]: Computing forward predicates... [2018-06-22 01:09:45,524 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:45,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:45,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:09:45,544 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:09:45,544 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:09:45,544 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:45,544 INFO ]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2018-06-22 01:09:45,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:45,856 INFO ]: Finished difference Result 43 states and 55 transitions. [2018-06-22 01:09:45,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:09:45,856 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 01:09:45,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:45,857 INFO ]: With dead ends: 43 [2018-06-22 01:09:45,857 INFO ]: Without dead ends: 43 [2018-06-22 01:09:45,857 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:09:45,857 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:09:45,859 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-06-22 01:09:45,859 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:09:45,865 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-06-22 01:09:45,865 INFO ]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 16 [2018-06-22 01:09:45,865 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:45,865 INFO ]: Abstraction has 28 states and 38 transitions. [2018-06-22 01:09:45,865 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:09:45,865 INFO ]: Start isEmpty. Operand 28 states and 38 transitions. [2018-06-22 01:09:45,866 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:09:45,866 INFO ]: Found error trace [2018-06-22 01:09:45,866 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:45,866 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:45,866 INFO ]: Analyzing trace with hash 422916262, now seen corresponding path program 4 times [2018-06-22 01:09:45,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:45,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:45,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:45,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:45,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:45,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:45,991 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:45,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:45,991 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:45,997 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:46,011 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:46,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:46,012 INFO ]: Computing forward predicates... [2018-06-22 01:09:46,263 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:46,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:46,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:09:46,291 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:09:46,291 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:09:46,291 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:46,291 INFO ]: Start difference. First operand 28 states and 38 transitions. Second operand 11 states. [2018-06-22 01:09:46,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:46,307 INFO ]: Finished difference Result 34 states and 44 transitions. [2018-06-22 01:09:46,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:09:46,308 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 01:09:46,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:46,308 INFO ]: With dead ends: 34 [2018-06-22 01:09:46,308 INFO ]: Without dead ends: 34 [2018-06-22 01:09:46,308 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:46,308 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:09:46,310 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-06-22 01:09:46,310 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:09:46,310 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2018-06-22 01:09:46,311 INFO ]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2018-06-22 01:09:46,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:46,311 INFO ]: Abstraction has 30 states and 40 transitions. [2018-06-22 01:09:46,311 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:09:46,311 INFO ]: Start isEmpty. Operand 30 states and 40 transitions. [2018-06-22 01:09:46,311 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:09:46,311 INFO ]: Found error trace [2018-06-22 01:09:46,311 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:46,311 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:46,311 INFO ]: Analyzing trace with hash -1647881694, now seen corresponding path program 8 times [2018-06-22 01:09:46,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:46,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:46,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:46,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:46,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:46,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:46,404 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:46,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:46,404 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 01:09:46,419 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:46,440 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:46,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:46,442 INFO ]: Computing forward predicates... [2018-06-22 01:09:46,520 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:46,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:46,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 01:09:46,543 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:09:46,543 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:09:46,543 INFO ]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:09:46,544 INFO ]: Start difference. First operand 30 states and 40 transitions. Second operand 16 states. [2018-06-22 01:09:47,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:47,397 INFO ]: Finished difference Result 113 states and 130 transitions. [2018-06-22 01:09:47,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:09:47,398 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-22 01:09:47,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:47,399 INFO ]: With dead ends: 113 [2018-06-22 01:09:47,399 INFO ]: Without dead ends: 113 [2018-06-22 01:09:47,400 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=716, Invalid=1834, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:09:47,400 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 01:09:47,402 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 29. [2018-06-22 01:09:47,402 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:09:47,403 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-06-22 01:09:47,403 INFO ]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2018-06-22 01:09:47,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:47,403 INFO ]: Abstraction has 29 states and 37 transitions. [2018-06-22 01:09:47,403 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:09:47,403 INFO ]: Start isEmpty. Operand 29 states and 37 transitions. [2018-06-22 01:09:47,403 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:09:47,403 INFO ]: Found error trace [2018-06-22 01:09:47,404 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:47,404 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:47,404 INFO ]: Analyzing trace with hash -683417740, now seen corresponding path program 9 times [2018-06-22 01:09:47,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:47,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:47,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:47,404 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:47,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:47,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:47,559 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:47,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:47,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:09:47,565 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:47,580 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:09:47,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:47,582 INFO ]: Computing forward predicates... [2018-06-22 01:09:47,693 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:47,712 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:47,712 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-22 01:09:47,712 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:09:47,712 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:09:47,712 INFO ]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:09:47,712 INFO ]: Start difference. First operand 29 states and 37 transitions. Second operand 17 states. [2018-06-22 01:09:47,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:47,919 INFO ]: Finished difference Result 87 states and 101 transitions. [2018-06-22 01:09:47,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:09:47,919 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-22 01:09:47,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:47,920 INFO ]: With dead ends: 87 [2018-06-22 01:09:47,920 INFO ]: Without dead ends: 82 [2018-06-22 01:09:47,920 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:09:47,920 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 01:09:47,923 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 30. [2018-06-22 01:09:47,923 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:09:47,924 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-06-22 01:09:47,924 INFO ]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 17 [2018-06-22 01:09:47,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:47,924 INFO ]: Abstraction has 30 states and 39 transitions. [2018-06-22 01:09:47,924 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:09:47,924 INFO ]: Start isEmpty. Operand 30 states and 39 transitions. [2018-06-22 01:09:47,925 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:09:47,925 INFO ]: Found error trace [2018-06-22 01:09:47,925 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:47,925 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:47,925 INFO ]: Analyzing trace with hash -57711374, now seen corresponding path program 2 times [2018-06-22 01:09:47,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:47,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:47,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:47,925 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:47,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:47,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:48,097 INFO ]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:48,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:48,097 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 01:09:48,104 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:48,119 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:48,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:48,120 INFO ]: Computing forward predicates... [2018-06-22 01:09:48,175 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:48,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:48,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:09:48,195 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:09:48,195 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:09:48,195 INFO ]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:09:48,196 INFO ]: Start difference. First operand 30 states and 39 transitions. Second operand 14 states. [2018-06-22 01:09:48,661 WARN ]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:09:49,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:49,292 INFO ]: Finished difference Result 63 states and 74 transitions. [2018-06-22 01:09:49,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:09:49,292 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 01:09:49,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:49,292 INFO ]: With dead ends: 63 [2018-06-22 01:09:49,292 INFO ]: Without dead ends: 63 [2018-06-22 01:09:49,293 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:09:49,293 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:09:49,295 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 31. [2018-06-22 01:09:49,295 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:09:49,295 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2018-06-22 01:09:49,295 INFO ]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 17 [2018-06-22 01:09:49,296 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:49,296 INFO ]: Abstraction has 31 states and 40 transitions. [2018-06-22 01:09:49,296 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:09:49,296 INFO ]: Start isEmpty. Operand 31 states and 40 transitions. [2018-06-22 01:09:49,297 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:09:49,297 INFO ]: Found error trace [2018-06-22 01:09:49,297 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:49,297 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:49,297 INFO ]: Analyzing trace with hash 508803852, now seen corresponding path program 10 times [2018-06-22 01:09:49,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:49,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:49,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:49,298 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:49,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:49,304 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:49,506 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:49,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:49,506 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 01:09:49,512 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:49,527 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:49,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:49,530 INFO ]: Computing forward predicates... [2018-06-22 01:09:49,571 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:49,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:49,592 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:09:49,592 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:09:49,592 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:09:49,592 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:09:49,592 INFO ]: Start difference. First operand 31 states and 40 transitions. Second operand 13 states. [2018-06-22 01:09:50,134 WARN ]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-06-22 01:09:51,126 WARN ]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:09:52,082 WARN ]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 01:09:52,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:52,677 INFO ]: Finished difference Result 49 states and 62 transitions. [2018-06-22 01:09:52,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:09:52,677 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:09:52,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:52,677 INFO ]: With dead ends: 49 [2018-06-22 01:09:52,677 INFO ]: Without dead ends: 49 [2018-06-22 01:09:52,678 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:09:52,678 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:09:52,683 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-06-22 01:09:52,683 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:09:52,683 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2018-06-22 01:09:52,683 INFO ]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 18 [2018-06-22 01:09:52,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:52,684 INFO ]: Abstraction has 32 states and 43 transitions. [2018-06-22 01:09:52,684 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:09:52,684 INFO ]: Start isEmpty. Operand 32 states and 43 transitions. [2018-06-22 01:09:52,684 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:09:52,684 INFO ]: Found error trace [2018-06-22 01:09:52,684 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:52,684 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:52,685 INFO ]: Analyzing trace with hash 113556710, now seen corresponding path program 5 times [2018-06-22 01:09:52,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:52,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:52,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:52,685 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:52,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:52,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:53,378 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:53,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:53,378 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 01:09:53,384 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:53,412 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:09:53,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:53,414 INFO ]: Computing forward predicates... [2018-06-22 01:09:53,450 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:53,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:53,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:09:53,473 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:09:53,474 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:09:53,474 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:09:53,474 INFO ]: Start difference. First operand 32 states and 43 transitions. Second operand 13 states. [2018-06-22 01:09:53,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:53,490 INFO ]: Finished difference Result 39 states and 50 transitions. [2018-06-22 01:09:53,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:09:53,490 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:09:53,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:53,491 INFO ]: With dead ends: 39 [2018-06-22 01:09:53,491 INFO ]: Without dead ends: 39 [2018-06-22 01:09:53,491 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:09:53,491 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:09:53,492 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-06-22 01:09:53,492 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:09:53,493 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-06-22 01:09:53,493 INFO ]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2018-06-22 01:09:53,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:53,493 INFO ]: Abstraction has 34 states and 45 transitions. [2018-06-22 01:09:53,493 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:09:53,493 INFO ]: Start isEmpty. Operand 34 states and 45 transitions. [2018-06-22 01:09:53,494 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:09:53,494 INFO ]: Found error trace [2018-06-22 01:09:53,494 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:53,494 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:53,494 INFO ]: Analyzing trace with hash -1187032460, now seen corresponding path program 11 times [2018-06-22 01:09:53,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:53,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:53,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:53,494 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:53,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:53,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:53,629 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:53,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:53,629 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 01:09:53,637 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:53,671 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:09:53,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:53,716 INFO ]: Computing forward predicates... [2018-06-22 01:09:54,234 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:54,259 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:54,259 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 01:09:54,260 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:09:54,260 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:09:54,260 INFO ]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:09:54,260 INFO ]: Start difference. First operand 34 states and 45 transitions. Second operand 19 states. [2018-06-22 01:09:55,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:55,164 INFO ]: Finished difference Result 145 states and 164 transitions. [2018-06-22 01:09:55,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 01:09:55,164 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-22 01:09:55,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:55,165 INFO ]: With dead ends: 145 [2018-06-22 01:09:55,166 INFO ]: Without dead ends: 145 [2018-06-22 01:09:55,167 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1232, Invalid=3324, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:09:55,167 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 01:09:55,171 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 33. [2018-06-22 01:09:55,171 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:09:55,171 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-06-22 01:09:55,171 INFO ]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 19 [2018-06-22 01:09:55,171 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:55,171 INFO ]: Abstraction has 33 states and 42 transitions. [2018-06-22 01:09:55,171 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:09:55,171 INFO ]: Start isEmpty. Operand 33 states and 42 transitions. [2018-06-22 01:09:55,172 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:09:55,172 INFO ]: Found error trace [2018-06-22 01:09:55,172 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:55,172 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:55,172 INFO ]: Analyzing trace with hash -1353420958, now seen corresponding path program 12 times [2018-06-22 01:09:55,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:55,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:55,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:55,177 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:55,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:55,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:55,279 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:55,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:55,279 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 01:09:55,285 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:09:55,303 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:09:55,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:55,305 INFO ]: Computing forward predicates... [2018-06-22 01:09:56,773 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:56,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:56,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-22 01:09:56,794 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:09:56,794 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:09:56,794 INFO ]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:09:56,794 INFO ]: Start difference. First operand 33 states and 42 transitions. Second operand 20 states. [2018-06-22 01:09:57,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:57,009 INFO ]: Finished difference Result 115 states and 131 transitions. [2018-06-22 01:09:57,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:09:57,009 INFO ]: Start accepts. Automaton has 20 states. Word has length 19 [2018-06-22 01:09:57,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:57,010 INFO ]: With dead ends: 115 [2018-06-22 01:09:57,010 INFO ]: Without dead ends: 109 [2018-06-22 01:09:57,010 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:09:57,010 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 01:09:57,012 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 34. [2018-06-22 01:09:57,012 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:09:57,015 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-06-22 01:09:57,015 INFO ]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 19 [2018-06-22 01:09:57,015 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:57,015 INFO ]: Abstraction has 34 states and 44 transitions. [2018-06-22 01:09:57,015 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:09:57,015 INFO ]: Start isEmpty. Operand 34 states and 44 transitions. [2018-06-22 01:09:57,016 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:09:57,016 INFO ]: Found error trace [2018-06-22 01:09:57,016 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:57,016 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:57,016 INFO ]: Analyzing trace with hash 1122402528, now seen corresponding path program 3 times [2018-06-22 01:09:57,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:57,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:57,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:57,016 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:57,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:57,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:57,194 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 01:09:57,729 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:09:58,017 WARN ]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:09:58,445 INFO ]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:09:58,445 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:58,445 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 01:09:58,454 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:58,474 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:09:58,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:58,475 INFO ]: Computing forward predicates... [2018-06-22 01:09:58,552 INFO ]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:09:58,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:58,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 01:09:58,574 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:09:58,574 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:09:58,574 INFO ]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:09:58,574 INFO ]: Start difference. First operand 34 states and 44 transitions. Second operand 17 states. [2018-06-22 01:10:00,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:00,207 INFO ]: Finished difference Result 88 states and 101 transitions. [2018-06-22 01:10:00,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:10:00,208 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-22 01:10:00,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:00,208 INFO ]: With dead ends: 88 [2018-06-22 01:10:00,208 INFO ]: Without dead ends: 88 [2018-06-22 01:10:00,209 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=413, Invalid=1843, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:10:00,209 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:10:00,211 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 35. [2018-06-22 01:10:00,212 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:10:00,212 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-06-22 01:10:00,212 INFO ]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2018-06-22 01:10:00,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:00,212 INFO ]: Abstraction has 35 states and 45 transitions. [2018-06-22 01:10:00,212 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:10:00,212 INFO ]: Start isEmpty. Operand 35 states and 45 transitions. [2018-06-22 01:10:00,213 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:10:00,213 INFO ]: Found error trace [2018-06-22 01:10:00,213 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:00,213 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:00,213 INFO ]: Analyzing trace with hash 1910228218, now seen corresponding path program 13 times [2018-06-22 01:10:00,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:00,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:00,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:00,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:00,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:00,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:00,515 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:00,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:00,516 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 01:10:00,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:00,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:00,553 INFO ]: Computing forward predicates... [2018-06-22 01:10:00,593 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:00,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:00,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 01:10:00,615 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:10:00,615 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:10:00,615 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:10:00,615 INFO ]: Start difference. First operand 35 states and 45 transitions. Second operand 15 states. [2018-06-22 01:10:01,395 WARN ]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:10:02,232 WARN ]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-06-22 01:10:02,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:02,287 INFO ]: Finished difference Result 55 states and 69 transitions. [2018-06-22 01:10:02,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:10:02,287 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-22 01:10:02,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:02,287 INFO ]: With dead ends: 55 [2018-06-22 01:10:02,287 INFO ]: Without dead ends: 55 [2018-06-22 01:10:02,288 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:10:02,288 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:10:02,290 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-06-22 01:10:02,290 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:10:02,290 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-06-22 01:10:02,290 INFO ]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2018-06-22 01:10:02,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:02,290 INFO ]: Abstraction has 36 states and 48 transitions. [2018-06-22 01:10:02,290 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:10:02,290 INFO ]: Start isEmpty. Operand 36 states and 48 transitions. [2018-06-22 01:10:02,290 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:10:02,290 INFO ]: Found error trace [2018-06-22 01:10:02,291 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:02,291 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:02,291 INFO ]: Analyzing trace with hash -828229338, now seen corresponding path program 6 times [2018-06-22 01:10:02,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:02,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:02,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:02,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:02,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:02,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:02,373 INFO ]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:10:02,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:02,373 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 01:10:02,380 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:10:02,408 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:10:02,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:02,410 INFO ]: Computing forward predicates... [2018-06-22 01:10:02,429 INFO ]: Checked inductivity of 66 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:10:02,451 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:10:02,451 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-22 01:10:02,451 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:10:02,452 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:10:02,452 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:10:02,452 INFO ]: Start difference. First operand 36 states and 48 transitions. Second operand 6 states. [2018-06-22 01:10:02,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:02,545 INFO ]: Finished difference Result 48 states and 60 transitions. [2018-06-22 01:10:02,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:10:02,545 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 01:10:02,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:02,545 INFO ]: With dead ends: 48 [2018-06-22 01:10:02,545 INFO ]: Without dead ends: 36 [2018-06-22 01:10:02,546 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:10:02,546 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:10:02,547 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:10:02,547 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:10:02,547 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-06-22 01:10:02,547 INFO ]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 21 [2018-06-22 01:10:02,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:02,547 INFO ]: Abstraction has 36 states and 47 transitions. [2018-06-22 01:10:02,547 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:10:02,547 INFO ]: Start isEmpty. Operand 36 states and 47 transitions. [2018-06-22 01:10:02,548 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:10:02,548 INFO ]: Found error trace [2018-06-22 01:10:02,548 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:02,548 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:02,548 INFO ]: Analyzing trace with hash 4137570, now seen corresponding path program 14 times [2018-06-22 01:10:02,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:02,548 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:02,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:02,549 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:02,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:02,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:02,731 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:02,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:02,732 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 01:10:02,738 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:02,766 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:02,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:02,768 INFO ]: Computing forward predicates... [2018-06-22 01:10:03,321 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:03,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:03,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-22 01:10:03,341 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:10:03,341 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:10:03,342 INFO ]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:10:03,342 INFO ]: Start difference. First operand 36 states and 47 transitions. Second operand 22 states. [2018-06-22 01:10:05,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:05,218 INFO ]: Finished difference Result 150 states and 169 transitions. [2018-06-22 01:10:05,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-22 01:10:05,221 INFO ]: Start accepts. Automaton has 22 states. Word has length 21 [2018-06-22 01:10:05,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:05,222 INFO ]: With dead ends: 150 [2018-06-22 01:10:05,222 INFO ]: Without dead ends: 150 [2018-06-22 01:10:05,223 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2245 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1684, Invalid=4636, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:10:05,223 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 01:10:05,226 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 35. [2018-06-22 01:10:05,226 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:10:05,227 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2018-06-22 01:10:05,227 INFO ]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 21 [2018-06-22 01:10:05,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:05,227 INFO ]: Abstraction has 35 states and 44 transitions. [2018-06-22 01:10:05,227 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:10:05,227 INFO ]: Start isEmpty. Operand 35 states and 44 transitions. [2018-06-22 01:10:05,227 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:10:05,227 INFO ]: Found error trace [2018-06-22 01:10:05,227 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:05,227 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:05,228 INFO ]: Analyzing trace with hash -858938572, now seen corresponding path program 15 times [2018-06-22 01:10:05,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:05,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:05,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:05,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:05,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:05,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:05,746 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:05,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:05,746 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 01:10:05,756 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:05,779 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:10:05,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:05,782 INFO ]: Computing forward predicates... [2018-06-22 01:10:06,313 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:06,340 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:06,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-22 01:10:06,340 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:10:06,340 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:10:06,340 INFO ]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:10:06,340 INFO ]: Start difference. First operand 35 states and 44 transitions. Second operand 23 states. [2018-06-22 01:10:07,170 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:10:07,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:07,170 INFO ]: Finished difference Result 118 states and 134 transitions. [2018-06-22 01:10:07,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:10:07,170 INFO ]: Start accepts. Automaton has 23 states. Word has length 21 [2018-06-22 01:10:07,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:07,171 INFO ]: With dead ends: 118 [2018-06-22 01:10:07,171 INFO ]: Without dead ends: 111 [2018-06-22 01:10:07,171 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:10:07,171 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 01:10:07,173 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 36. [2018-06-22 01:10:07,173 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:10:07,173 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-06-22 01:10:07,173 INFO ]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 21 [2018-06-22 01:10:07,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:07,173 INFO ]: Abstraction has 36 states and 46 transitions. [2018-06-22 01:10:07,173 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:10:07,173 INFO ]: Start isEmpty. Operand 36 states and 46 transitions. [2018-06-22 01:10:07,174 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:10:07,175 INFO ]: Found error trace [2018-06-22 01:10:07,175 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:07,175 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:07,176 INFO ]: Analyzing trace with hash -1823618638, now seen corresponding path program 4 times [2018-06-22 01:10:07,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:07,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:07,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:07,176 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:07,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:07,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:07,334 INFO ]: Checked inductivity of 38 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:10:07,334 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:07,334 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 01:10:07,340 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:10:07,359 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:07,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:07,360 INFO ]: Computing forward predicates... [2018-06-22 01:10:07,545 INFO ]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:10:07,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:07,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 01:10:07,566 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:10:07,566 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:10:07,566 INFO ]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:10:07,566 INFO ]: Start difference. First operand 36 states and 46 transitions. Second operand 20 states. [2018-06-22 01:10:07,918 WARN ]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-06-22 01:10:08,400 WARN ]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-06-22 01:10:08,828 WARN ]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-06-22 01:10:09,634 WARN ]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-06-22 01:10:10,216 WARN ]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:10:10,751 WARN ]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-06-22 01:10:11,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:11,158 INFO ]: Finished difference Result 92 states and 105 transitions. [2018-06-22 01:10:11,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:10:11,158 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-22 01:10:11,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:11,159 INFO ]: With dead ends: 92 [2018-06-22 01:10:11,159 INFO ]: Without dead ends: 92 [2018-06-22 01:10:11,160 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=571, Invalid=2621, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:10:11,160 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 01:10:11,161 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 37. [2018-06-22 01:10:11,162 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:10:11,162 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-06-22 01:10:11,162 INFO ]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 21 [2018-06-22 01:10:11,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:11,162 INFO ]: Abstraction has 37 states and 47 transitions. [2018-06-22 01:10:11,162 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:10:11,162 INFO ]: Start isEmpty. Operand 37 states and 47 transitions. [2018-06-22 01:10:11,162 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:10:11,162 INFO ]: Found error trace [2018-06-22 01:10:11,162 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:11,163 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:11,163 INFO ]: Analyzing trace with hash 212502718, now seen corresponding path program 1 times [2018-06-22 01:10:11,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:11,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:11,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:11,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:11,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:11,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:11,223 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:10:11,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:11,223 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 01:10:11,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:11,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:11,250 INFO ]: Computing forward predicates... [2018-06-22 01:10:11,401 INFO ]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:11,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:11,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 18 [2018-06-22 01:10:11,422 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:10:11,423 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:10:11,423 INFO ]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:10:11,423 INFO ]: Start difference. First operand 37 states and 47 transitions. Second operand 18 states. [2018-06-22 01:10:11,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:11,685 INFO ]: Finished difference Result 49 states and 59 transitions. [2018-06-22 01:10:11,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:10:11,685 INFO ]: Start accepts. Automaton has 18 states. Word has length 22 [2018-06-22 01:10:11,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:11,686 INFO ]: With dead ends: 49 [2018-06-22 01:10:11,686 INFO ]: Without dead ends: 37 [2018-06-22 01:10:11,686 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:10:11,686 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:10:11,687 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:10:11,687 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:10:11,688 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-06-22 01:10:11,688 INFO ]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 22 [2018-06-22 01:10:11,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:11,688 INFO ]: Abstraction has 37 states and 46 transitions. [2018-06-22 01:10:11,688 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:10:11,688 INFO ]: Start isEmpty. Operand 37 states and 46 transitions. [2018-06-22 01:10:11,688 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:10:11,688 INFO ]: Found error trace [2018-06-22 01:10:11,688 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:11,688 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:11,688 INFO ]: Analyzing trace with hash 181793484, now seen corresponding path program 16 times [2018-06-22 01:10:11,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:11,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:11,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:11,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:11,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:11,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:11,914 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:11,914 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:11,914 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 01:10:11,920 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:10:11,940 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:11,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:11,943 INFO ]: Computing forward predicates... [2018-06-22 01:10:11,993 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:12,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:12,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-22 01:10:12,017 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:10:12,017 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:10:12,017 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:10:12,017 INFO ]: Start difference. First operand 37 states and 46 transitions. Second operand 17 states. [2018-06-22 01:10:13,019 WARN ]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 01:10:13,580 WARN ]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:10:13,745 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:13,745 INFO ]: Finished difference Result 59 states and 72 transitions. [2018-06-22 01:10:13,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:10:13,745 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 01:10:13,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:13,745 INFO ]: With dead ends: 59 [2018-06-22 01:10:13,745 INFO ]: Without dead ends: 59 [2018-06-22 01:10:13,746 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=383, Invalid=1339, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:10:13,746 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:10:13,747 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 38. [2018-06-22 01:10:13,747 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:10:13,748 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-06-22 01:10:13,748 INFO ]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 22 [2018-06-22 01:10:13,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:13,748 INFO ]: Abstraction has 38 states and 49 transitions. [2018-06-22 01:10:13,748 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:10:13,748 INFO ]: Start isEmpty. Operand 38 states and 49 transitions. [2018-06-22 01:10:13,748 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:10:13,748 INFO ]: Found error trace [2018-06-22 01:10:13,748 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:13,748 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:13,748 INFO ]: Analyzing trace with hash -1884541914, now seen corresponding path program 2 times [2018-06-22 01:10:13,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:13,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:13,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:13,749 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:13,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:13,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:13,852 INFO ]: Checked inductivity of 69 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:10:13,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:13,852 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 01:10:13,857 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:13,907 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:13,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:13,910 INFO ]: Computing forward predicates... [2018-06-22 01:10:14,171 INFO ]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:10:14,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:14,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 19 [2018-06-22 01:10:14,195 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:10:14,195 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:10:14,195 INFO ]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:10:14,195 INFO ]: Start difference. First operand 38 states and 49 transitions. Second operand 19 states. [2018-06-22 01:10:14,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:14,627 INFO ]: Finished difference Result 50 states and 61 transitions. [2018-06-22 01:10:14,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:10:14,627 INFO ]: Start accepts. Automaton has 19 states. Word has length 23 [2018-06-22 01:10:14,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:14,627 INFO ]: With dead ends: 50 [2018-06-22 01:10:14,627 INFO ]: Without dead ends: 38 [2018-06-22 01:10:14,627 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:10:14,627 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:10:14,628 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:10:14,628 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:10:14,629 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-06-22 01:10:14,629 INFO ]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 23 [2018-06-22 01:10:14,629 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:14,629 INFO ]: Abstraction has 38 states and 48 transitions. [2018-06-22 01:10:14,629 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:10:14,629 INFO ]: Start isEmpty. Operand 38 states and 48 transitions. [2018-06-22 01:10:14,629 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:10:14,629 INFO ]: Found error trace [2018-06-22 01:10:14,629 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:14,629 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:14,629 INFO ]: Analyzing trace with hash -1915251148, now seen corresponding path program 17 times [2018-06-22 01:10:14,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:14,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:14,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:14,630 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:14,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:14,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:15,182 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:15,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:15,182 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 01:10:15,189 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:15,231 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:10:15,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:15,234 INFO ]: Computing forward predicates... [2018-06-22 01:10:15,544 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:15,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:15,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-22 01:10:15,570 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:10:15,570 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:10:15,570 INFO ]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:10:15,570 INFO ]: Start difference. First operand 38 states and 48 transitions. Second operand 25 states. [2018-06-22 01:10:16,048 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:10:16,832 WARN ]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 01:10:17,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:17,737 INFO ]: Finished difference Result 140 states and 157 transitions. [2018-06-22 01:10:17,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 01:10:17,738 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-22 01:10:17,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:17,739 INFO ]: With dead ends: 140 [2018-06-22 01:10:17,739 INFO ]: Without dead ends: 140 [2018-06-22 01:10:17,741 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1859, Invalid=5113, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 01:10:17,742 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 01:10:17,745 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 37. [2018-06-22 01:10:17,745 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:10:17,745 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-06-22 01:10:17,745 INFO ]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2018-06-22 01:10:17,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:17,745 INFO ]: Abstraction has 37 states and 45 transitions. [2018-06-22 01:10:17,745 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:10:17,745 INFO ]: Start isEmpty. Operand 37 states and 45 transitions. [2018-06-22 01:10:17,745 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:10:17,746 INFO ]: Found error trace [2018-06-22 01:10:17,746 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:17,746 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:17,746 INFO ]: Analyzing trace with hash 1394159522, now seen corresponding path program 18 times [2018-06-22 01:10:17,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:17,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:17,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:17,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:17,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:17,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,156 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:18,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:18,156 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 01:10:18,162 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:10:18,186 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:10:18,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,188 INFO ]: Computing forward predicates... [2018-06-22 01:10:18,377 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:18,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:18,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-22 01:10:18,404 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:10:18,405 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:10:18,405 INFO ]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:10:18,405 INFO ]: Start difference. First operand 37 states and 45 transitions. Second operand 26 states. [2018-06-22 01:10:18,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:18,650 INFO ]: Finished difference Result 106 states and 120 transitions. [2018-06-22 01:10:18,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:10:18,650 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-22 01:10:18,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:18,650 INFO ]: With dead ends: 106 [2018-06-22 01:10:18,650 INFO ]: Without dead ends: 98 [2018-06-22 01:10:18,651 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=1337, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:10:18,651 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 01:10:18,652 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 38. [2018-06-22 01:10:18,652 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:10:18,653 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-06-22 01:10:18,653 INFO ]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 23 [2018-06-22 01:10:18,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:18,653 INFO ]: Abstraction has 38 states and 47 transitions. [2018-06-22 01:10:18,653 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:10:18,653 INFO ]: Start isEmpty. Operand 38 states and 47 transitions. [2018-06-22 01:10:18,653 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:10:18,653 INFO ]: Found error trace [2018-06-22 01:10:18,653 INFO ]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:18,654 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:18,654 INFO ]: Analyzing trace with hash -1869823456, now seen corresponding path program 5 times [2018-06-22 01:10:18,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:18,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:18,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:18,655 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:18,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:18,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,918 INFO ]: Checked inductivity of 51 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:10:18,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:18,919 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 01:10:18,925 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:18,951 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:10:18,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,952 INFO ]: Computing forward predicates... [2018-06-22 01:10:19,124 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:10:19,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:19,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-06-22 01:10:19,145 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:10:19,145 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:10:19,146 INFO ]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:10:19,146 INFO ]: Start difference. First operand 38 states and 47 transitions. Second operand 23 states. [2018-06-22 01:10:21,005 WARN ]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-06-22 01:10:21,445 WARN ]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-06-22 01:10:22,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:22,075 INFO ]: Finished difference Result 81 states and 92 transitions. [2018-06-22 01:10:22,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:10:22,075 INFO ]: Start accepts. Automaton has 23 states. Word has length 23 [2018-06-22 01:10:22,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:22,076 INFO ]: With dead ends: 81 [2018-06-22 01:10:22,076 INFO ]: Without dead ends: 81 [2018-06-22 01:10:22,077 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=634, Invalid=2788, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:10:22,077 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:10:22,078 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 39. [2018-06-22 01:10:22,078 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:10:22,079 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-06-22 01:10:22,079 INFO ]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 23 [2018-06-22 01:10:22,079 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:22,079 INFO ]: Abstraction has 39 states and 48 transitions. [2018-06-22 01:10:22,079 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:10:22,079 INFO ]: Start isEmpty. Operand 39 states and 48 transitions. [2018-06-22 01:10:22,079 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:10:22,079 INFO ]: Found error trace [2018-06-22 01:10:22,079 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:22,079 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:22,079 INFO ]: Analyzing trace with hash 1826551230, now seen corresponding path program 3 times [2018-06-22 01:10:22,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:22,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:22,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:22,080 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:22,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:22,091 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:22,606 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:22,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:22,606 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 01:10:22,612 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:22,640 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:10:22,640 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:22,642 INFO ]: Computing forward predicates... [2018-06-22 01:10:22,825 INFO ]: Checked inductivity of 72 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:22,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:22,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-22 01:10:22,853 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:10:22,854 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:10:22,854 INFO ]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:10:22,854 INFO ]: Start difference. First operand 39 states and 48 transitions. Second operand 15 states. [2018-06-22 01:10:23,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:23,124 INFO ]: Finished difference Result 51 states and 60 transitions. [2018-06-22 01:10:23,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:10:23,124 INFO ]: Start accepts. Automaton has 15 states. Word has length 24 [2018-06-22 01:10:23,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:23,125 INFO ]: With dead ends: 51 [2018-06-22 01:10:23,125 INFO ]: Without dead ends: 39 [2018-06-22 01:10:23,125 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:10:23,125 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:10:23,125 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:10:23,125 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:10:23,126 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-06-22 01:10:23,126 INFO ]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 24 [2018-06-22 01:10:23,126 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:23,126 INFO ]: Abstraction has 39 states and 47 transitions. [2018-06-22 01:10:23,126 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:10:23,126 INFO ]: Start isEmpty. Operand 39 states and 47 transitions. [2018-06-22 01:10:23,126 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:10:23,126 INFO ]: Found error trace [2018-06-22 01:10:23,126 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:23,126 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:23,126 INFO ]: Analyzing trace with hash 810285370, now seen corresponding path program 19 times [2018-06-22 01:10:23,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:23,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:23,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:23,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:23,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:23,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:23,601 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:23,601 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:23,601 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:23,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:23,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:23,631 INFO ]: Computing forward predicates... [2018-06-22 01:10:23,687 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:23,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:23,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-22 01:10:23,709 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:10:23,709 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:10:23,709 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:10:23,709 INFO ]: Start difference. First operand 39 states and 47 transitions. Second operand 19 states. [2018-06-22 01:10:24,192 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-06-22 01:10:25,112 WARN ]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-06-22 01:10:25,478 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:10:25,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:25,836 INFO ]: Finished difference Result 63 states and 75 transitions. [2018-06-22 01:10:25,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:10:25,836 INFO ]: Start accepts. Automaton has 19 states. Word has length 24 [2018-06-22 01:10:25,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:25,836 INFO ]: With dead ends: 63 [2018-06-22 01:10:25,836 INFO ]: Without dead ends: 63 [2018-06-22 01:10:25,837 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:10:25,837 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:10:25,838 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 40. [2018-06-22 01:10:25,838 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:10:25,838 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-06-22 01:10:25,838 INFO ]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 24 [2018-06-22 01:10:25,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:25,838 INFO ]: Abstraction has 40 states and 50 transitions. [2018-06-22 01:10:25,838 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:10:25,838 INFO ]: Start isEmpty. Operand 40 states and 50 transitions. [2018-06-22 01:10:25,838 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:10:25,838 INFO ]: Found error trace [2018-06-22 01:10:25,838 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:25,838 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:25,839 INFO ]: Analyzing trace with hash 906321702, now seen corresponding path program 4 times [2018-06-22 01:10:25,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:25,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:25,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:25,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:25,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:25,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:26,011 INFO ]: Checked inductivity of 76 backedges. 7 proven. 48 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:10:26,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:26,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:26,017 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:10:26,045 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:26,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:26,048 INFO ]: Computing forward predicates... [2018-06-22 01:10:26,916 INFO ]: Checked inductivity of 76 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:10:26,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:26,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 21 [2018-06-22 01:10:26,938 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:10:26,938 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:10:26,938 INFO ]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:10:26,938 INFO ]: Start difference. First operand 40 states and 50 transitions. Second operand 21 states. [2018-06-22 01:10:27,589 WARN ]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:10:28,055 WARN ]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:10:28,440 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:10:29,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:29,248 INFO ]: Finished difference Result 53 states and 63 transitions. [2018-06-22 01:10:29,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:10:29,248 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 01:10:29,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:29,248 INFO ]: With dead ends: 53 [2018-06-22 01:10:29,248 INFO ]: Without dead ends: 41 [2018-06-22 01:10:29,248 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:10:29,248 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:10:29,249 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-06-22 01:10:29,249 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:10:29,250 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-06-22 01:10:29,250 INFO ]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 25 [2018-06-22 01:10:29,250 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:29,250 INFO ]: Abstraction has 40 states and 49 transitions. [2018-06-22 01:10:29,250 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:10:29,250 INFO ]: Start isEmpty. Operand 40 states and 49 transitions. [2018-06-22 01:10:29,250 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:10:29,250 INFO ]: Found error trace [2018-06-22 01:10:29,250 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:29,250 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:29,250 INFO ]: Analyzing trace with hash -109944158, now seen corresponding path program 20 times [2018-06-22 01:10:29,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:29,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:29,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:29,251 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:29,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:29,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:30,279 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:30,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:30,279 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:30,290 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:30,328 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:30,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:30,331 INFO ]: Computing forward predicates... [2018-06-22 01:10:30,745 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:30,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:30,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-22 01:10:30,777 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:10:30,777 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:10:30,777 INFO ]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:10:30,777 INFO ]: Start difference. First operand 40 states and 49 transitions. Second operand 28 states. [2018-06-22 01:10:32,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:32,134 INFO ]: Finished difference Result 130 states and 145 transitions. [2018-06-22 01:10:32,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 01:10:32,134 INFO ]: Start accepts. Automaton has 28 states. Word has length 25 [2018-06-22 01:10:32,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:32,135 INFO ]: With dead ends: 130 [2018-06-22 01:10:32,135 INFO ]: Without dead ends: 130 [2018-06-22 01:10:32,136 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2567 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1954, Invalid=5356, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 01:10:32,136 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 01:10:32,138 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 39. [2018-06-22 01:10:32,138 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:10:32,138 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-22 01:10:32,138 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2018-06-22 01:10:32,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:32,138 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-22 01:10:32,138 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:10:32,138 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-22 01:10:32,139 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:10:32,139 INFO ]: Found error trace [2018-06-22 01:10:32,139 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:32,139 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:32,139 INFO ]: Analyzing trace with hash -597428492, now seen corresponding path program 21 times [2018-06-22 01:10:32,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:32,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:32,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:32,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:32,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:32,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:32,365 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:32,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:32,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:32,371 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:32,465 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:10:32,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:32,468 INFO ]: Computing forward predicates... [2018-06-22 01:10:32,899 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:32,919 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:32,919 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-06-22 01:10:32,920 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:10:32,920 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:10:32,920 INFO ]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:10:32,920 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 29 states. [2018-06-22 01:10:33,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:33,372 INFO ]: Finished difference Result 94 states and 106 transitions. [2018-06-22 01:10:33,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:10:33,372 INFO ]: Start accepts. Automaton has 29 states. Word has length 25 [2018-06-22 01:10:33,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:33,373 INFO ]: With dead ends: 94 [2018-06-22 01:10:33,373 INFO ]: Without dead ends: 85 [2018-06-22 01:10:33,373 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=428, Invalid=1464, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:10:33,373 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 01:10:33,375 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 40. [2018-06-22 01:10:33,375 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:10:33,375 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-06-22 01:10:33,375 INFO ]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 25 [2018-06-22 01:10:33,375 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:33,375 INFO ]: Abstraction has 40 states and 48 transitions. [2018-06-22 01:10:33,375 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:10:33,375 INFO ]: Start isEmpty. Operand 40 states and 48 transitions. [2018-06-22 01:10:33,376 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:10:33,376 INFO ]: Found error trace [2018-06-22 01:10:33,376 INFO ]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:33,376 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:33,376 INFO ]: Analyzing trace with hash 1094467186, now seen corresponding path program 6 times [2018-06-22 01:10:33,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:33,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:33,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:33,376 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:33,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:33,383 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:33,708 INFO ]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:10:33,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:33,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:33,715 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:10:33,743 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:10:33,743 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:33,744 INFO ]: Computing forward predicates... [2018-06-22 01:10:33,875 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:10:33,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:33,897 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-06-22 01:10:33,897 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:10:33,897 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:10:33,897 INFO ]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:10:33,897 INFO ]: Start difference. First operand 40 states and 48 transitions. Second operand 25 states. [2018-06-22 01:10:34,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:34,826 INFO ]: Finished difference Result 75 states and 85 transitions. [2018-06-22 01:10:34,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:10:34,930 INFO ]: Start accepts. Automaton has 25 states. Word has length 25 [2018-06-22 01:10:34,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:34,930 INFO ]: With dead ends: 75 [2018-06-22 01:10:34,930 INFO ]: Without dead ends: 75 [2018-06-22 01:10:34,931 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=2321, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:10:34,931 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 01:10:34,933 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 41. [2018-06-22 01:10:34,933 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:10:34,933 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-06-22 01:10:34,933 INFO ]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 25 [2018-06-22 01:10:34,933 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:34,933 INFO ]: Abstraction has 41 states and 49 transitions. [2018-06-22 01:10:34,933 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:10:34,933 INFO ]: Start isEmpty. Operand 41 states and 49 transitions. [2018-06-22 01:10:34,933 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:10:34,933 INFO ]: Found error trace [2018-06-22 01:10:34,933 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:34,933 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:34,934 INFO ]: Analyzing trace with hash -1850989890, now seen corresponding path program 5 times [2018-06-22 01:10:34,934 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:34,934 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:34,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:34,934 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:34,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:34,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:35,775 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:35,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:35,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:35,782 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:35,827 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:10:35,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:35,830 INFO ]: Computing forward predicates... [2018-06-22 01:10:35,990 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:10:36,011 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:36,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 27 [2018-06-22 01:10:36,011 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:10:36,011 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:10:36,011 INFO ]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:10:36,011 INFO ]: Start difference. First operand 41 states and 49 transitions. Second operand 27 states. [2018-06-22 01:10:36,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:36,414 INFO ]: Finished difference Result 61 states and 69 transitions. [2018-06-22 01:10:36,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:10:36,414 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-22 01:10:36,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:36,415 INFO ]: With dead ends: 61 [2018-06-22 01:10:36,415 INFO ]: Without dead ends: 49 [2018-06-22 01:10:36,415 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:10:36,415 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:10:36,416 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-06-22 01:10:36,416 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:10:36,416 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-06-22 01:10:36,416 INFO ]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 26 [2018-06-22 01:10:36,416 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:36,417 INFO ]: Abstraction has 41 states and 48 transitions. [2018-06-22 01:10:36,417 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:10:36,417 INFO ]: Start isEmpty. Operand 41 states and 48 transitions. [2018-06-22 01:10:36,417 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:10:36,417 INFO ]: Found error trace [2018-06-22 01:10:36,417 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:36,417 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:36,417 INFO ]: Analyzing trace with hash 940227212, now seen corresponding path program 22 times [2018-06-22 01:10:36,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:36,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:36,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:36,418 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:36,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:36,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:36,882 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:36,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:36,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:36,889 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:10:36,918 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:36,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:36,926 INFO ]: Computing forward predicates... [2018-06-22 01:10:37,080 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:37,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:37,105 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-22 01:10:37,106 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:10:37,106 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:10:37,106 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:10:37,106 INFO ]: Start difference. First operand 41 states and 48 transitions. Second operand 21 states. [2018-06-22 01:10:39,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:39,357 INFO ]: Finished difference Result 67 states and 78 transitions. [2018-06-22 01:10:39,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:10:39,357 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-22 01:10:39,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:39,357 INFO ]: With dead ends: 67 [2018-06-22 01:10:39,357 INFO ]: Without dead ends: 67 [2018-06-22 01:10:39,358 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=550, Invalid=2102, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:10:39,358 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:10:39,359 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 42. [2018-06-22 01:10:39,359 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:10:39,359 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-06-22 01:10:39,359 INFO ]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 26 [2018-06-22 01:10:39,359 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:39,359 INFO ]: Abstraction has 42 states and 51 transitions. [2018-06-22 01:10:39,359 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:10:39,359 INFO ]: Start isEmpty. Operand 42 states and 51 transitions. [2018-06-22 01:10:39,360 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:10:39,360 INFO ]: Found error trace [2018-06-22 01:10:39,360 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:39,360 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:39,360 INFO ]: Analyzing trace with hash -1428303322, now seen corresponding path program 6 times [2018-06-22 01:10:39,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:39,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:39,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:39,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:39,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:39,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:39,669 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:39,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:39,669 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:39,675 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:10:39,724 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:10:39,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:39,727 INFO ]: Computing forward predicates... [2018-06-22 01:10:39,901 INFO ]: Checked inductivity of 87 backedges. 35 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:10:39,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:39,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 29 [2018-06-22 01:10:39,923 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:10:39,923 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:10:39,923 INFO ]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:10:39,923 INFO ]: Start difference. First operand 42 states and 51 transitions. Second operand 29 states. [2018-06-22 01:10:40,361 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:10:40,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:40,478 INFO ]: Finished difference Result 63 states and 72 transitions. [2018-06-22 01:10:40,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:10:40,478 INFO ]: Start accepts. Automaton has 29 states. Word has length 27 [2018-06-22 01:10:40,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:40,479 INFO ]: With dead ends: 63 [2018-06-22 01:10:40,479 INFO ]: Without dead ends: 51 [2018-06-22 01:10:40,479 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:10:40,479 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:10:40,481 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 42. [2018-06-22 01:10:40,481 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:10:40,481 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-06-22 01:10:40,481 INFO ]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 27 [2018-06-22 01:10:40,481 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:40,481 INFO ]: Abstraction has 42 states and 50 transitions. [2018-06-22 01:10:40,481 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:10:40,481 INFO ]: Start isEmpty. Operand 42 states and 50 transitions. [2018-06-22 01:10:40,481 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:10:40,481 INFO ]: Found error trace [2018-06-22 01:10:40,481 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:40,481 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:40,481 INFO ]: Analyzing trace with hash 1362913780, now seen corresponding path program 23 times [2018-06-22 01:10:40,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:40,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:40,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:40,482 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:40,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:40,488 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:10:40,969 WARN ]: Removed 1 from assertion stack [2018-06-22 01:10:40,969 WARN ]: Verification canceled [2018-06-22 01:10:41,133 WARN ]: Timeout [2018-06-22 01:10:41,133 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:10:41 BoogieIcfgContainer [2018-06-22 01:10:41,133 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:10:41,134 INFO ]: Toolchain (without parser) took 65533.84 ms. Allocated memory was 309.9 MB in the beginning and 652.2 MB in the end (delta: 342.4 MB). Free memory was 266.2 MB in the beginning and 630.5 MB in the end (delta: -364.2 MB). Peak memory consumption was 236.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:41,135 INFO ]: SmtParser took 0.12 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:10:41,135 INFO ]: ChcToBoogie took 64.59 ms. Allocated memory is still 309.9 MB. Free memory was 266.2 MB in the beginning and 264.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:41,135 INFO ]: Boogie Preprocessor took 41.43 ms. Allocated memory is still 309.9 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:41,135 INFO ]: RCFGBuilder took 364.55 ms. Allocated memory is still 309.9 MB. Free memory was 262.3 MB in the beginning and 254.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:41,141 INFO ]: TraceAbstraction took 65040.93 ms. Allocated memory was 309.9 MB in the beginning and 652.2 MB in the end (delta: 342.4 MB). Free memory was 254.2 MB in the beginning and 630.5 MB in the end (delta: -376.2 MB). Peak memory consumption was 224.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:10:41,143 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.12 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.59 ms. Allocated memory is still 309.9 MB. Free memory was 266.2 MB in the beginning and 264.3 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.43 ms. Allocated memory is still 309.9 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 364.55 ms. Allocated memory is still 309.9 MB. Free memory was 262.3 MB in the beginning and 254.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 65040.93 ms. Allocated memory was 309.9 MB in the beginning and 652.2 MB in the end (delta: 342.4 MB). Free memory was 254.2 MB in the beginning and 630.5 MB in the end (delta: -376.2 MB). Peak memory consumption was 224.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 9, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 5. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 64.9s OverallTime, 48 OverallIterations, 11 TraceHistogramMax, 38.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 584 SDtfs, 1681 SDslu, 4019 SDs, 0 SdLazy, 5817 SolverSat, 2065 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2174 GetRequests, 645 SyntacticMatches, 114 SemanticMatches, 1415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15800 ImplicationChecksByTransitivity, 48.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 47 MinimizatonAttempts, 1420 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 1698 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 173 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 131493 SizeOfPredicates, 211 NumberOfNonLiveVariables, 6823 ConjunctsInSsa, 1931 ConjunctsInUnsatCore, 92 InterpolantComputations, 6 PerfectInterpolantSequences, 979/2964 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/break_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-10-41-158.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-10-41-158.csv Completed graceful shutdown