java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:31:13,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:31:13,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:31:13,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:31:13,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:31:13,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:31:13,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:31:13,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:31:13,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:31:13,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:31:13,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:31:13,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:31:13,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:31:13,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:31:13,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:31:13,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:31:13,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:31:13,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:31:13,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:31:13,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:31:13,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:31:13,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:31:13,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:31:13,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:31:13,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:31:13,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:31:13,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:31:13,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:31:13,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:31:13,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:31:13,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:31:13,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:31:13,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:31:13,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:31:13,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:31:13,287 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:31:13,309 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:31:13,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:31:13,309 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:31:13,310 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:31:13,311 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:31:13,311 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:31:13,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:31:13,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:31:13,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:31:13,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:31:13,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:31:13,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:31:13,312 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:31:13,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:31:13,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:31:13,313 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:31:13,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:31:13,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:31:13,313 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:31:13,315 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:31:13,315 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:31:13,363 INFO ]: Repository-Root is: /tmp [2018-06-22 11:31:13,377 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:31:13,382 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:31:13,383 INFO ]: Initializing SmtParser... [2018-06-22 11:31:13,383 INFO ]: SmtParser initialized [2018-06-22 11:31:13,384 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-22 11:31:13,385 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:31:13,471 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 unknown [2018-06-22 11:31:13,725 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-22 11:31:13,734 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:31:13,750 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:31:13,751 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:31:13,751 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:31:13,751 INFO ]: ChcToBoogie initialized [2018-06-22 11:31:13,754 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,799 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13 Unit [2018-06-22 11:31:13,799 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:31:13,800 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:31:13,800 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:31:13,800 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:31:13,823 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,823 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,834 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,834 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,838 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,841 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,842 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... [2018-06-22 11:31:13,844 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:31:13,844 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:31:13,844 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:31:13,844 INFO ]: RCFGBuilder initialized [2018-06-22 11:31:13,845 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:31:13,857 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:31:13,857 INFO ]: Found specification of procedure False [2018-06-22 11:31:13,857 INFO ]: Found implementation of procedure False [2018-06-22 11:31:13,857 INFO ]: Specification and implementation of procedure zipDLRunknownCLN13 given in one single declaration [2018-06-22 11:31:13,857 INFO ]: Found specification of procedure zipDLRunknownCLN13 [2018-06-22 11:31:13,857 INFO ]: Found implementation of procedure zipDLRunknownCLN13 [2018-06-22 11:31:13,857 INFO ]: Specification and implementation of procedure unzipDLRunknownCLN9 given in one single declaration [2018-06-22 11:31:13,857 INFO ]: Found specification of procedure unzipDLRunknownCLN9 [2018-06-22 11:31:13,857 INFO ]: Found implementation of procedure unzipDLRunknownCLN9 [2018-06-22 11:31:13,857 INFO ]: Specification and implementation of procedure unzipDLRunknownCLN7 given in one single declaration [2018-06-22 11:31:13,857 INFO ]: Found specification of procedure unzipDLRunknownCLN7 [2018-06-22 11:31:13,857 INFO ]: Found implementation of procedure unzipDLRunknownCLN7 [2018-06-22 11:31:13,857 INFO ]: Specification and implementation of procedure fDLRunknownCLN2 given in one single declaration [2018-06-22 11:31:13,857 INFO ]: Found specification of procedure fDLRunknownCLN2 [2018-06-22 11:31:13,858 INFO ]: Found implementation of procedure fDLRunknownCLN2 [2018-06-22 11:31:13,858 INFO ]: Specification and implementation of procedure fDLRunknownCLN5 given in one single declaration [2018-06-22 11:31:13,858 INFO ]: Found specification of procedure fDLRunknownCLN5 [2018-06-22 11:31:13,858 INFO ]: Found implementation of procedure fDLRunknownCLN5 [2018-06-22 11:31:13,858 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:31:13,858 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:31:13,858 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:31:14,319 INFO ]: Using library mode [2018-06-22 11:31:14,320 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:31:14 BoogieIcfgContainer [2018-06-22 11:31:14,320 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:31:14,321 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:31:14,321 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:31:14,324 INFO ]: TraceAbstraction initialized [2018-06-22 11:31:14,324 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:31:13" (1/3) ... [2018-06-22 11:31:14,325 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc0fe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:31:14, skipping insertion in model container [2018-06-22 11:31:14,325 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:31:13" (2/3) ... [2018-06-22 11:31:14,326 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc0fe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:31:14, skipping insertion in model container [2018-06-22 11:31:14,326 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:31:14" (3/3) ... [2018-06-22 11:31:14,328 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:31:14,337 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:31:14,344 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:31:14,384 INFO ]: Using default assertion order modulation [2018-06-22 11:31:14,385 INFO ]: Interprodecural is true [2018-06-22 11:31:14,385 INFO ]: Hoare is false [2018-06-22 11:31:14,385 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:31:14,385 INFO ]: Backedges is TWOTRACK [2018-06-22 11:31:14,385 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:31:14,385 INFO ]: Difference is false [2018-06-22 11:31:14,385 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:31:14,385 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:31:14,400 INFO ]: Start isEmpty. Operand 34 states. [2018-06-22 11:31:14,411 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:31:14,411 INFO ]: Found error trace [2018-06-22 11:31:14,412 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:31:14,412 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:14,417 INFO ]: Analyzing trace with hash 108619717, now seen corresponding path program 1 times [2018-06-22 11:31:14,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:14,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:14,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:14,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:14,488 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:31:14,490 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:14,490 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:31:14,492 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:31:14,509 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:31:14,509 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:31:14,512 INFO ]: Start difference. First operand 34 states. Second operand 2 states. [2018-06-22 11:31:14,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:14,536 INFO ]: Finished difference Result 32 states and 41 transitions. [2018-06-22 11:31:14,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:31:14,537 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:31:14,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:14,560 INFO ]: With dead ends: 32 [2018-06-22 11:31:14,560 INFO ]: Without dead ends: 32 [2018-06-22 11:31:14,562 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:31:14,575 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:31:14,593 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:31:14,594 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:31:14,596 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-06-22 11:31:14,597 INFO ]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 5 [2018-06-22 11:31:14,597 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:14,597 INFO ]: Abstraction has 32 states and 41 transitions. [2018-06-22 11:31:14,597 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:31:14,597 INFO ]: Start isEmpty. Operand 32 states and 41 transitions. [2018-06-22 11:31:14,601 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:31:14,601 INFO ]: Found error trace [2018-06-22 11:31:14,601 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:14,601 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:14,601 INFO ]: Analyzing trace with hash -547075155, now seen corresponding path program 1 times [2018-06-22 11:31:14,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:14,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:14,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:14,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:14,760 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:31:14,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:14,761 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:31:14,764 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:31:14,765 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:31:14,765 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:31:14,765 INFO ]: Start difference. First operand 32 states and 41 transitions. Second operand 5 states. [2018-06-22 11:31:14,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:14,905 INFO ]: Finished difference Result 38 states and 49 transitions. [2018-06-22 11:31:14,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:31:14,906 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:31:14,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:14,907 INFO ]: With dead ends: 38 [2018-06-22 11:31:14,908 INFO ]: Without dead ends: 38 [2018-06-22 11:31:14,908 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:31:14,908 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:31:14,923 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:31:14,923 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:31:14,925 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-06-22 11:31:14,925 INFO ]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 17 [2018-06-22 11:31:14,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:14,925 INFO ]: Abstraction has 36 states and 47 transitions. [2018-06-22 11:31:14,925 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:31:14,925 INFO ]: Start isEmpty. Operand 36 states and 47 transitions. [2018-06-22 11:31:14,926 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:31:14,926 INFO ]: Found error trace [2018-06-22 11:31:14,926 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:14,927 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:14,927 INFO ]: Analyzing trace with hash -1220261350, now seen corresponding path program 1 times [2018-06-22 11:31:14,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:14,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:14,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:14,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:14,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:15,018 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:31:15,018 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:15,018 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:31:15,018 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:31:15,018 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:31:15,018 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:31:15,019 INFO ]: Start difference. First operand 36 states and 47 transitions. Second operand 5 states. [2018-06-22 11:31:15,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:15,088 INFO ]: Finished difference Result 36 states and 46 transitions. [2018-06-22 11:31:15,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:31:15,089 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:31:15,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:15,090 INFO ]: With dead ends: 36 [2018-06-22 11:31:15,090 INFO ]: Without dead ends: 36 [2018-06-22 11:31:15,091 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:31:15,091 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:31:15,099 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:31:15,099 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:31:15,100 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-06-22 11:31:15,100 INFO ]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 17 [2018-06-22 11:31:15,100 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:15,100 INFO ]: Abstraction has 36 states and 46 transitions. [2018-06-22 11:31:15,100 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:31:15,100 INFO ]: Start isEmpty. Operand 36 states and 46 transitions. [2018-06-22 11:31:15,103 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:31:15,103 INFO ]: Found error trace [2018-06-22 11:31:15,103 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:15,103 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:15,103 INFO ]: Analyzing trace with hash -2067019662, now seen corresponding path program 1 times [2018-06-22 11:31:15,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:15,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:15,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:15,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:15,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:15,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:15,201 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:31:15,202 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:15,202 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:31:15,202 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:31:15,202 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:31:15,202 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:31:15,202 INFO ]: Start difference. First operand 36 states and 46 transitions. Second operand 7 states. [2018-06-22 11:31:15,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:15,610 INFO ]: Finished difference Result 40 states and 53 transitions. [2018-06-22 11:31:15,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:31:15,611 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:31:15,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:15,612 INFO ]: With dead ends: 40 [2018-06-22 11:31:15,612 INFO ]: Without dead ends: 40 [2018-06-22 11:31:15,612 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:31:15,613 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:31:15,626 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:31:15,627 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:31:15,628 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-06-22 11:31:15,628 INFO ]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 21 [2018-06-22 11:31:15,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:15,628 INFO ]: Abstraction has 38 states and 49 transitions. [2018-06-22 11:31:15,628 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:31:15,628 INFO ]: Start isEmpty. Operand 38 states and 49 transitions. [2018-06-22 11:31:15,629 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:31:15,629 INFO ]: Found error trace [2018-06-22 11:31:15,629 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:15,629 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:15,629 INFO ]: Analyzing trace with hash 641612127, now seen corresponding path program 1 times [2018-06-22 11:31:15,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:15,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:15,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:15,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:15,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:15,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:15,739 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:31:15,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:15,740 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:31:15,740 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:31:15,740 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:31:15,740 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:31:15,740 INFO ]: Start difference. First operand 38 states and 49 transitions. Second operand 7 states. [2018-06-22 11:31:15,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:15,993 INFO ]: Finished difference Result 42 states and 54 transitions. [2018-06-22 11:31:15,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:31:15,993 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:31:15,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:15,994 INFO ]: With dead ends: 42 [2018-06-22 11:31:15,994 INFO ]: Without dead ends: 38 [2018-06-22 11:31:15,995 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:31:15,995 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:31:15,999 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-06-22 11:31:15,999 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:31:16,000 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-06-22 11:31:16,000 INFO ]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 21 [2018-06-22 11:31:16,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:16,001 INFO ]: Abstraction has 34 states and 43 transitions. [2018-06-22 11:31:16,001 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:31:16,001 INFO ]: Start isEmpty. Operand 34 states and 43 transitions. [2018-06-22 11:31:16,002 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:31:16,002 INFO ]: Found error trace [2018-06-22 11:31:16,003 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:16,003 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:16,003 INFO ]: Analyzing trace with hash -1771136165, now seen corresponding path program 1 times [2018-06-22 11:31:16,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:16,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:16,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:16,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:16,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:16,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:16,302 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:31:16,303 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:16,303 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:31:16,303 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:31:16,303 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:31:16,303 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:31:16,303 INFO ]: Start difference. First operand 34 states and 43 transitions. Second operand 9 states. [2018-06-22 11:31:16,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:16,729 INFO ]: Finished difference Result 36 states and 46 transitions. [2018-06-22 11:31:16,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:31:16,729 INFO ]: Start accepts. Automaton has 9 states. Word has length 37 [2018-06-22 11:31:16,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:16,731 INFO ]: With dead ends: 36 [2018-06-22 11:31:16,731 INFO ]: Without dead ends: 36 [2018-06-22 11:31:16,731 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:31:16,731 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:31:16,735 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:31:16,735 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:31:16,736 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-06-22 11:31:16,736 INFO ]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 37 [2018-06-22 11:31:16,737 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:16,737 INFO ]: Abstraction has 36 states and 46 transitions. [2018-06-22 11:31:16,737 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:31:16,737 INFO ]: Start isEmpty. Operand 36 states and 46 transitions. [2018-06-22 11:31:16,738 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:31:16,738 INFO ]: Found error trace [2018-06-22 11:31:16,738 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:16,738 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:16,738 INFO ]: Analyzing trace with hash -511289784, now seen corresponding path program 1 times [2018-06-22 11:31:16,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:16,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:16,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:16,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:16,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:16,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:16,831 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:31:16,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:31:16,831 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:31:16,832 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:31:16,832 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:31:16,832 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:31:16,832 INFO ]: Start difference. First operand 36 states and 46 transitions. Second operand 9 states. [2018-06-22 11:31:16,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:16,971 INFO ]: Finished difference Result 38 states and 47 transitions. [2018-06-22 11:31:16,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:31:16,972 INFO ]: Start accepts. Automaton has 9 states. Word has length 37 [2018-06-22 11:31:16,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:16,973 INFO ]: With dead ends: 38 [2018-06-22 11:31:16,973 INFO ]: Without dead ends: 38 [2018-06-22 11:31:16,973 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:31:16,973 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:31:16,978 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:31:16,978 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:31:16,981 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-06-22 11:31:16,981 INFO ]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 37 [2018-06-22 11:31:16,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:16,981 INFO ]: Abstraction has 36 states and 45 transitions. [2018-06-22 11:31:16,981 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:31:16,981 INFO ]: Start isEmpty. Operand 36 states and 45 transitions. [2018-06-22 11:31:16,982 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:31:16,983 INFO ]: Found error trace [2018-06-22 11:31:16,983 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:16,983 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:16,983 INFO ]: Analyzing trace with hash -1478661856, now seen corresponding path program 1 times [2018-06-22 11:31:16,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:16,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:16,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:16,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:16,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:17,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:17,194 INFO ]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:31:17,194 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:17,194 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:17,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:17,226 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:17,236 INFO ]: Computing forward predicates... [2018-06-22 11:31:17,316 INFO ]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:31:17,352 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:17,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:31:17,352 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:31:17,353 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:31:17,353 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:31:17,353 INFO ]: Start difference. First operand 36 states and 45 transitions. Second operand 11 states. [2018-06-22 11:31:17,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:17,723 INFO ]: Finished difference Result 50 states and 63 transitions. [2018-06-22 11:31:17,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:31:17,724 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 11:31:17,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:17,725 INFO ]: With dead ends: 50 [2018-06-22 11:31:17,725 INFO ]: Without dead ends: 50 [2018-06-22 11:31:17,726 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:31:17,726 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:31:17,732 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 11:31:17,732 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:31:17,733 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-06-22 11:31:17,733 INFO ]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 41 [2018-06-22 11:31:17,733 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:17,733 INFO ]: Abstraction has 48 states and 61 transitions. [2018-06-22 11:31:17,733 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:31:17,733 INFO ]: Start isEmpty. Operand 48 states and 61 transitions. [2018-06-22 11:31:17,734 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:31:17,734 INFO ]: Found error trace [2018-06-22 11:31:17,734 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:17,734 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:17,734 INFO ]: Analyzing trace with hash -1454025075, now seen corresponding path program 1 times [2018-06-22 11:31:17,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:17,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:17,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:17,735 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:17,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:17,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:17,875 INFO ]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:31:17,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:17,876 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:17,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:17,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:17,931 INFO ]: Computing forward predicates... [2018-06-22 11:31:17,993 INFO ]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:31:18,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:18,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:31:18,012 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:31:18,013 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:31:18,013 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:31:18,013 INFO ]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2018-06-22 11:31:18,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:18,139 INFO ]: Finished difference Result 48 states and 60 transitions. [2018-06-22 11:31:18,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:31:18,140 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 11:31:18,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:18,141 INFO ]: With dead ends: 48 [2018-06-22 11:31:18,141 INFO ]: Without dead ends: 48 [2018-06-22 11:31:18,141 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:31:18,141 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:31:18,146 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 11:31:18,146 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:31:18,148 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-06-22 11:31:18,148 INFO ]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 41 [2018-06-22 11:31:18,148 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:18,148 INFO ]: Abstraction has 46 states and 58 transitions. [2018-06-22 11:31:18,148 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:31:18,148 INFO ]: Start isEmpty. Operand 46 states and 58 transitions. [2018-06-22 11:31:18,150 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:31:18,150 INFO ]: Found error trace [2018-06-22 11:31:18,150 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:18,150 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:18,150 INFO ]: Analyzing trace with hash 386413605, now seen corresponding path program 2 times [2018-06-22 11:31:18,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:18,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:18,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:18,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:18,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:18,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:18,297 INFO ]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:31:18,297 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:18,297 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:18,303 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:18,336 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:18,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:18,339 INFO ]: Computing forward predicates... [2018-06-22 11:31:18,476 INFO ]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:31:18,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:18,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:31:18,495 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:31:18,496 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:31:18,496 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:31:18,496 INFO ]: Start difference. First operand 46 states and 58 transitions. Second operand 21 states. [2018-06-22 11:31:18,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:18,793 INFO ]: Finished difference Result 48 states and 59 transitions. [2018-06-22 11:31:18,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:31:18,798 INFO ]: Start accepts. Automaton has 21 states. Word has length 45 [2018-06-22 11:31:18,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:18,799 INFO ]: With dead ends: 48 [2018-06-22 11:31:18,799 INFO ]: Without dead ends: 44 [2018-06-22 11:31:18,800 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:31:18,800 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:31:18,806 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:31:18,807 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:31:18,807 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-06-22 11:31:18,807 INFO ]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 45 [2018-06-22 11:31:18,807 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:18,807 INFO ]: Abstraction has 44 states and 55 transitions. [2018-06-22 11:31:18,807 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:31:18,807 INFO ]: Start isEmpty. Operand 44 states and 55 transitions. [2018-06-22 11:31:18,811 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:31:18,811 INFO ]: Found error trace [2018-06-22 11:31:18,811 INFO ]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:18,811 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:18,811 INFO ]: Analyzing trace with hash 310587707, now seen corresponding path program 2 times [2018-06-22 11:31:18,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:18,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:18,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:18,812 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:18,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:18,826 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:19,008 INFO ]: Checked inductivity of 53 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:31:19,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:19,008 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:19,015 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:19,039 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:19,039 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:19,045 INFO ]: Computing forward predicates... [2018-06-22 11:31:19,445 INFO ]: Checked inductivity of 53 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:31:19,467 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:19,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 11:31:19,483 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:31:19,483 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:31:19,483 INFO ]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:31:19,483 INFO ]: Start difference. First operand 44 states and 55 transitions. Second operand 26 states. [2018-06-22 11:31:19,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:19,876 INFO ]: Finished difference Result 60 states and 76 transitions. [2018-06-22 11:31:19,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:31:19,876 INFO ]: Start accepts. Automaton has 26 states. Word has length 61 [2018-06-22 11:31:19,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:19,877 INFO ]: With dead ends: 60 [2018-06-22 11:31:19,877 INFO ]: Without dead ends: 60 [2018-06-22 11:31:19,877 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:31:19,878 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:31:19,883 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-06-22 11:31:19,883 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:31:19,884 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-06-22 11:31:19,884 INFO ]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 61 [2018-06-22 11:31:19,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:19,885 INFO ]: Abstraction has 46 states and 58 transitions. [2018-06-22 11:31:19,885 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:31:19,885 INFO ]: Start isEmpty. Operand 46 states and 58 transitions. [2018-06-22 11:31:19,886 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:31:19,886 INFO ]: Found error trace [2018-06-22 11:31:19,886 INFO ]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:19,886 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:19,886 INFO ]: Analyzing trace with hash -2111764658, now seen corresponding path program 3 times [2018-06-22 11:31:19,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:19,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:19,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:19,887 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:19,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:19,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:20,001 INFO ]: Checked inductivity of 53 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:31:20,002 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:20,002 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:20,007 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:20,033 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:31:20,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:20,037 INFO ]: Computing forward predicates... [2018-06-22 11:31:20,068 INFO ]: Checked inductivity of 53 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:31:20,091 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:20,092 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 11:31:20,092 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:31:20,092 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:31:20,092 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:31:20,092 INFO ]: Start difference. First operand 46 states and 58 transitions. Second operand 15 states. [2018-06-22 11:31:20,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:20,319 INFO ]: Finished difference Result 46 states and 57 transitions. [2018-06-22 11:31:20,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:31:20,320 INFO ]: Start accepts. Automaton has 15 states. Word has length 61 [2018-06-22 11:31:20,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:20,321 INFO ]: With dead ends: 46 [2018-06-22 11:31:20,321 INFO ]: Without dead ends: 46 [2018-06-22 11:31:20,321 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:31:20,321 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:31:20,325 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 11:31:20,325 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:31:20,326 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-06-22 11:31:20,326 INFO ]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 61 [2018-06-22 11:31:20,327 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:20,327 INFO ]: Abstraction has 46 states and 57 transitions. [2018-06-22 11:31:20,327 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:31:20,327 INFO ]: Start isEmpty. Operand 46 states and 57 transitions. [2018-06-22 11:31:20,328 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:31:20,328 INFO ]: Found error trace [2018-06-22 11:31:20,328 INFO ]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:20,328 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:20,329 INFO ]: Analyzing trace with hash 538182483, now seen corresponding path program 4 times [2018-06-22 11:31:20,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:20,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:20,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:20,329 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:20,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:20,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:20,599 INFO ]: Checked inductivity of 60 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:31:20,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:20,599 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:20,607 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:20,629 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:20,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:20,633 INFO ]: Computing forward predicates... [2018-06-22 11:31:20,862 INFO ]: Checked inductivity of 60 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:31:20,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:20,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 11:31:20,885 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:31:20,885 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:31:20,885 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:31:20,885 INFO ]: Start difference. First operand 46 states and 57 transitions. Second operand 15 states. [2018-06-22 11:31:21,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:21,118 INFO ]: Finished difference Result 62 states and 77 transitions. [2018-06-22 11:31:21,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:31:21,119 INFO ]: Start accepts. Automaton has 15 states. Word has length 65 [2018-06-22 11:31:21,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:21,120 INFO ]: With dead ends: 62 [2018-06-22 11:31:21,120 INFO ]: Without dead ends: 62 [2018-06-22 11:31:21,120 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:31:21,120 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:31:21,127 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-06-22 11:31:21,127 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:31:21,128 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-06-22 11:31:21,129 INFO ]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 65 [2018-06-22 11:31:21,129 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:21,129 INFO ]: Abstraction has 60 states and 75 transitions. [2018-06-22 11:31:21,129 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:31:21,129 INFO ]: Start isEmpty. Operand 60 states and 75 transitions. [2018-06-22 11:31:21,130 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:31:21,130 INFO ]: Found error trace [2018-06-22 11:31:21,130 INFO ]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:21,130 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:21,130 INFO ]: Analyzing trace with hash -838410304, now seen corresponding path program 3 times [2018-06-22 11:31:21,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:21,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:21,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:21,131 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:21,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:21,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:22,019 INFO ]: Checked inductivity of 60 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:31:22,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:22,020 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:22,026 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:22,083 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:31:22,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:22,087 INFO ]: Computing forward predicates... [2018-06-22 11:31:22,293 INFO ]: Checked inductivity of 60 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:31:22,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:22,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 11:31:22,314 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:31:22,314 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:31:22,315 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:31:22,315 INFO ]: Start difference. First operand 60 states and 75 transitions. Second operand 15 states. [2018-06-22 11:31:22,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:22,562 INFO ]: Finished difference Result 60 states and 74 transitions. [2018-06-22 11:31:22,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:31:22,562 INFO ]: Start accepts. Automaton has 15 states. Word has length 65 [2018-06-22 11:31:22,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:22,563 INFO ]: With dead ends: 60 [2018-06-22 11:31:22,563 INFO ]: Without dead ends: 60 [2018-06-22 11:31:22,564 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:31:22,564 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:31:22,569 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-06-22 11:31:22,569 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:31:22,570 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-06-22 11:31:22,570 INFO ]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 65 [2018-06-22 11:31:22,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:22,570 INFO ]: Abstraction has 56 states and 70 transitions. [2018-06-22 11:31:22,570 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:31:22,570 INFO ]: Start isEmpty. Operand 56 states and 70 transitions. [2018-06-22 11:31:22,572 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:31:22,572 INFO ]: Found error trace [2018-06-22 11:31:22,572 INFO ]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:22,572 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:22,572 INFO ]: Analyzing trace with hash -156701544, now seen corresponding path program 5 times [2018-06-22 11:31:22,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:22,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:22,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:22,573 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:22,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:22,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:22,771 INFO ]: Checked inductivity of 71 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:31:22,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:22,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:22,780 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:22,802 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:31:22,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:22,805 INFO ]: Computing forward predicates... [2018-06-22 11:31:23,058 INFO ]: Checked inductivity of 71 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:31:23,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:23,077 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-06-22 11:31:23,078 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:31:23,078 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:31:23,078 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:31:23,078 INFO ]: Start difference. First operand 56 states and 70 transitions. Second operand 29 states. [2018-06-22 11:31:23,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:23,436 INFO ]: Finished difference Result 60 states and 73 transitions. [2018-06-22 11:31:23,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:31:23,436 INFO ]: Start accepts. Automaton has 29 states. Word has length 69 [2018-06-22 11:31:23,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:23,438 INFO ]: With dead ends: 60 [2018-06-22 11:31:23,438 INFO ]: Without dead ends: 54 [2018-06-22 11:31:23,438 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:31:23,439 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:31:23,443 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 11:31:23,443 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:31:23,444 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-06-22 11:31:23,444 INFO ]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 69 [2018-06-22 11:31:23,445 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:23,445 INFO ]: Abstraction has 54 states and 67 transitions. [2018-06-22 11:31:23,445 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:31:23,445 INFO ]: Start isEmpty. Operand 54 states and 67 transitions. [2018-06-22 11:31:23,446 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:31:23,446 INFO ]: Found error trace [2018-06-22 11:31:23,446 INFO ]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:23,446 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:23,446 INFO ]: Analyzing trace with hash -2103930879, now seen corresponding path program 6 times [2018-06-22 11:31:23,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:23,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:23,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:23,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:23,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:23,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:23,809 INFO ]: Checked inductivity of 124 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 11:31:23,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:23,809 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:23,814 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:23,892 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:31:23,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:23,895 INFO ]: Computing forward predicates... [2018-06-22 11:31:23,930 INFO ]: Checked inductivity of 124 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 11:31:23,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:23,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-22 11:31:23,961 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:31:23,961 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:31:23,961 INFO ]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:31:23,961 INFO ]: Start difference. First operand 54 states and 67 transitions. Second operand 19 states. [2018-06-22 11:31:24,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:24,129 INFO ]: Finished difference Result 56 states and 70 transitions. [2018-06-22 11:31:24,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:31:24,130 INFO ]: Start accepts. Automaton has 19 states. Word has length 85 [2018-06-22 11:31:24,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:24,131 INFO ]: With dead ends: 56 [2018-06-22 11:31:24,131 INFO ]: Without dead ends: 56 [2018-06-22 11:31:24,131 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:31:24,131 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:31:24,135 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:31:24,135 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:31:24,136 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-06-22 11:31:24,136 INFO ]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 85 [2018-06-22 11:31:24,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:24,137 INFO ]: Abstraction has 56 states and 70 transitions. [2018-06-22 11:31:24,137 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:31:24,137 INFO ]: Start isEmpty. Operand 56 states and 70 transitions. [2018-06-22 11:31:24,138 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:31:24,138 INFO ]: Found error trace [2018-06-22 11:31:24,138 INFO ]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:24,138 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:24,138 INFO ]: Analyzing trace with hash -1951913746, now seen corresponding path program 4 times [2018-06-22 11:31:24,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:24,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:24,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:24,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:24,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:24,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:24,405 INFO ]: Checked inductivity of 124 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 11:31:24,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:24,405 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:24,411 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:24,432 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:24,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:24,434 INFO ]: Computing forward predicates... [2018-06-22 11:31:24,466 INFO ]: Checked inductivity of 124 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 11:31:24,494 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:24,494 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-22 11:31:24,495 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:31:24,495 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:31:24,495 INFO ]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:31:24,495 INFO ]: Start difference. First operand 56 states and 70 transitions. Second operand 19 states. [2018-06-22 11:31:24,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:24,627 INFO ]: Finished difference Result 58 states and 71 transitions. [2018-06-22 11:31:24,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:31:24,628 INFO ]: Start accepts. Automaton has 19 states. Word has length 85 [2018-06-22 11:31:24,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:24,628 INFO ]: With dead ends: 58 [2018-06-22 11:31:24,628 INFO ]: Without dead ends: 58 [2018-06-22 11:31:24,629 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:31:24,630 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:31:24,634 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 11:31:24,634 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:31:24,639 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2018-06-22 11:31:24,639 INFO ]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 85 [2018-06-22 11:31:24,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:24,639 INFO ]: Abstraction has 56 states and 69 transitions. [2018-06-22 11:31:24,639 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:31:24,639 INFO ]: Start isEmpty. Operand 56 states and 69 transitions. [2018-06-22 11:31:24,640 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:31:24,640 INFO ]: Found error trace [2018-06-22 11:31:24,640 INFO ]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:24,640 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:24,640 INFO ]: Analyzing trace with hash 69162419, now seen corresponding path program 5 times [2018-06-22 11:31:24,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:24,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:24,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:24,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:24,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:24,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:24,895 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:31:25,433 INFO ]: Checked inductivity of 135 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:31:25,433 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:25,433 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) [2018-06-22 11:31:25,447 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:25,513 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:31:25,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:25,517 INFO ]: Computing forward predicates... [2018-06-22 11:31:25,637 INFO ]: Checked inductivity of 135 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:31:25,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:25,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-22 11:31:25,662 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:31:25,662 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:31:25,662 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:31:25,663 INFO ]: Start difference. First operand 56 states and 69 transitions. Second operand 19 states. [2018-06-22 11:31:25,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:25,902 INFO ]: Finished difference Result 72 states and 89 transitions. [2018-06-22 11:31:25,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:31:25,908 INFO ]: Start accepts. Automaton has 19 states. Word has length 89 [2018-06-22 11:31:25,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:25,909 INFO ]: With dead ends: 72 [2018-06-22 11:31:25,909 INFO ]: Without dead ends: 72 [2018-06-22 11:31:25,910 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:31:25,910 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:31:25,918 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 11:31:25,918 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:31:25,924 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2018-06-22 11:31:25,925 INFO ]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 89 [2018-06-22 11:31:25,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:25,925 INFO ]: Abstraction has 72 states and 89 transitions. [2018-06-22 11:31:25,925 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:31:25,925 INFO ]: Start isEmpty. Operand 72 states and 89 transitions. [2018-06-22 11:31:25,926 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:31:25,926 INFO ]: Found error trace [2018-06-22 11:31:25,926 INFO ]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:25,926 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:25,926 INFO ]: Analyzing trace with hash -540112314, now seen corresponding path program 7 times [2018-06-22 11:31:25,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:25,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:25,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:25,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:25,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:25,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:26,183 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:31:26,382 INFO ]: Checked inductivity of 135 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:31:26,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:26,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:26,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:26,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:26,413 INFO ]: Computing forward predicates... [2018-06-22 11:31:26,482 INFO ]: Checked inductivity of 135 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:31:26,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:26,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-22 11:31:26,513 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:31:26,514 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:31:26,514 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:31:26,515 INFO ]: Start difference. First operand 72 states and 89 transitions. Second operand 19 states. [2018-06-22 11:31:26,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:26,851 INFO ]: Finished difference Result 74 states and 90 transitions. [2018-06-22 11:31:26,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:31:26,851 INFO ]: Start accepts. Automaton has 19 states. Word has length 89 [2018-06-22 11:31:26,852 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:26,852 INFO ]: With dead ends: 74 [2018-06-22 11:31:26,852 INFO ]: Without dead ends: 74 [2018-06-22 11:31:26,852 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:31:26,852 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:31:26,858 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-06-22 11:31:26,858 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:31:26,859 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-06-22 11:31:26,859 INFO ]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 89 [2018-06-22 11:31:26,859 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:26,859 INFO ]: Abstraction has 66 states and 82 transitions. [2018-06-22 11:31:26,859 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:31:26,859 INFO ]: Start isEmpty. Operand 66 states and 82 transitions. [2018-06-22 11:31:26,860 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:31:26,860 INFO ]: Found error trace [2018-06-22 11:31:26,860 INFO ]: trace histogram [7, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:26,861 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:26,861 INFO ]: Analyzing trace with hash -1701289525, now seen corresponding path program 8 times [2018-06-22 11:31:26,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:26,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:26,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:26,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:26,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:26,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:27,178 INFO ]: Checked inductivity of 150 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 11:31:27,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:27,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:27,183 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:27,208 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:27,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:27,211 INFO ]: Computing forward predicates... [2018-06-22 11:31:27,485 INFO ]: Checked inductivity of 150 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 11:31:27,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:27,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-06-22 11:31:27,509 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:31:27,509 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:31:27,509 INFO ]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:31:27,509 INFO ]: Start difference. First operand 66 states and 82 transitions. Second operand 37 states. [2018-06-22 11:31:27,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:27,931 INFO ]: Finished difference Result 72 states and 87 transitions. [2018-06-22 11:31:27,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:31:27,932 INFO ]: Start accepts. Automaton has 37 states. Word has length 93 [2018-06-22 11:31:27,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:27,933 INFO ]: With dead ends: 72 [2018-06-22 11:31:27,933 INFO ]: Without dead ends: 64 [2018-06-22 11:31:27,934 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=1709, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:31:27,934 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:31:27,939 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-22 11:31:27,939 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:31:27,940 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-06-22 11:31:27,940 INFO ]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 93 [2018-06-22 11:31:27,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:27,940 INFO ]: Abstraction has 64 states and 79 transitions. [2018-06-22 11:31:27,940 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:31:27,940 INFO ]: Start isEmpty. Operand 64 states and 79 transitions. [2018-06-22 11:31:27,941 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:31:27,941 INFO ]: Found error trace [2018-06-22 11:31:27,942 INFO ]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:27,942 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:27,942 INFO ]: Analyzing trace with hash -626809484, now seen corresponding path program 9 times [2018-06-22 11:31:27,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:27,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:27,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:27,942 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:27,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:27,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:28,216 INFO ]: Checked inductivity of 225 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 11:31:28,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:28,216 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:28,223 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:28,252 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:31:28,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:28,255 INFO ]: Computing forward predicates... [2018-06-22 11:31:28,301 INFO ]: Checked inductivity of 225 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 11:31:28,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:28,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-22 11:31:28,322 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:31:28,322 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:31:28,322 INFO ]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:31:28,323 INFO ]: Start difference. First operand 64 states and 79 transitions. Second operand 23 states. [2018-06-22 11:31:28,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:28,488 INFO ]: Finished difference Result 66 states and 82 transitions. [2018-06-22 11:31:28,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:31:28,488 INFO ]: Start accepts. Automaton has 23 states. Word has length 109 [2018-06-22 11:31:28,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:28,489 INFO ]: With dead ends: 66 [2018-06-22 11:31:28,489 INFO ]: Without dead ends: 66 [2018-06-22 11:31:28,489 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:31:28,489 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:31:28,493 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:31:28,494 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:31:28,494 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-06-22 11:31:28,494 INFO ]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 109 [2018-06-22 11:31:28,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:28,495 INFO ]: Abstraction has 66 states and 82 transitions. [2018-06-22 11:31:28,495 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:31:28,495 INFO ]: Start isEmpty. Operand 66 states and 82 transitions. [2018-06-22 11:31:28,496 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:31:28,496 INFO ]: Found error trace [2018-06-22 11:31:28,496 INFO ]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:28,497 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:28,497 INFO ]: Analyzing trace with hash 1455664481, now seen corresponding path program 6 times [2018-06-22 11:31:28,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:28,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:28,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:28,498 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:28,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:28,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:29,421 INFO ]: Checked inductivity of 225 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 11:31:29,422 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:29,422 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:29,427 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:29,458 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:31:29,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:29,463 INFO ]: Computing forward predicates... [2018-06-22 11:31:29,938 INFO ]: Checked inductivity of 225 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 11:31:29,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:29,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-06-22 11:31:29,957 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:31:29,957 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:31:29,957 INFO ]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:31:29,957 INFO ]: Start difference. First operand 66 states and 82 transitions. Second operand 42 states. [2018-06-22 11:31:30,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:30,428 INFO ]: Finished difference Result 84 states and 102 transitions. [2018-06-22 11:31:30,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:31:30,428 INFO ]: Start accepts. Automaton has 42 states. Word has length 109 [2018-06-22 11:31:30,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:30,429 INFO ]: With dead ends: 84 [2018-06-22 11:31:30,429 INFO ]: Without dead ends: 84 [2018-06-22 11:31:30,430 INFO ]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=2512, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:31:30,430 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:31:30,436 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 66. [2018-06-22 11:31:30,436 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:31:30,437 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-06-22 11:31:30,437 INFO ]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 109 [2018-06-22 11:31:30,437 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:30,437 INFO ]: Abstraction has 66 states and 81 transitions. [2018-06-22 11:31:30,437 INFO ]: Interpolant automaton has 42 states. [2018-06-22 11:31:30,437 INFO ]: Start isEmpty. Operand 66 states and 81 transitions. [2018-06-22 11:31:30,438 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:31:30,438 INFO ]: Found error trace [2018-06-22 11:31:30,438 INFO ]: trace histogram [9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:30,438 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:30,439 INFO ]: Analyzing trace with hash -419467783, now seen corresponding path program 10 times [2018-06-22 11:31:30,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:30,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:30,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:30,441 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:30,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:30,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:30,752 INFO ]: Checked inductivity of 240 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-22 11:31:30,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:30,752 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:30,759 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:30,788 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:30,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:30,792 INFO ]: Computing forward predicates... [2018-06-22 11:31:30,965 INFO ]: Checked inductivity of 240 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-22 11:31:30,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:30,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 11:31:30,985 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:31:30,985 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:31:30,985 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:31:30,985 INFO ]: Start difference. First operand 66 states and 81 transitions. Second operand 23 states. [2018-06-22 11:31:31,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:31,539 INFO ]: Finished difference Result 86 states and 105 transitions. [2018-06-22 11:31:31,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:31:31,540 INFO ]: Start accepts. Automaton has 23 states. Word has length 113 [2018-06-22 11:31:31,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:31,541 INFO ]: With dead ends: 86 [2018-06-22 11:31:31,541 INFO ]: Without dead ends: 86 [2018-06-22 11:31:31,542 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:31:31,542 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:31:31,551 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-06-22 11:31:31,551 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:31:31,552 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2018-06-22 11:31:31,552 INFO ]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 113 [2018-06-22 11:31:31,552 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:31,552 INFO ]: Abstraction has 84 states and 103 transitions. [2018-06-22 11:31:31,552 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:31:31,552 INFO ]: Start isEmpty. Operand 84 states and 103 transitions. [2018-06-22 11:31:31,552 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:31:31,552 INFO ]: Found error trace [2018-06-22 11:31:31,553 INFO ]: trace histogram [9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:31,553 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:31,553 INFO ]: Analyzing trace with hash -1835980698, now seen corresponding path program 7 times [2018-06-22 11:31:31,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:31,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:31,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:31,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:31,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:31,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:31,927 INFO ]: Checked inductivity of 240 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-22 11:31:31,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:31,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:31,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:31,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:31,966 INFO ]: Computing forward predicates... [2018-06-22 11:31:32,024 INFO ]: Checked inductivity of 240 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-22 11:31:32,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:32,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 11:31:32,043 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:31:32,043 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:31:32,043 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:31:32,043 INFO ]: Start difference. First operand 84 states and 103 transitions. Second operand 23 states. [2018-06-22 11:31:32,396 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:32,396 INFO ]: Finished difference Result 84 states and 102 transitions. [2018-06-22 11:31:32,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:31:32,396 INFO ]: Start accepts. Automaton has 23 states. Word has length 113 [2018-06-22 11:31:32,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:32,397 INFO ]: With dead ends: 84 [2018-06-22 11:31:32,397 INFO ]: Without dead ends: 84 [2018-06-22 11:31:32,397 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:31:32,397 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:31:32,401 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-06-22 11:31:32,401 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:31:32,403 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2018-06-22 11:31:32,404 INFO ]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 113 [2018-06-22 11:31:32,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:32,404 INFO ]: Abstraction has 76 states and 94 transitions. [2018-06-22 11:31:32,404 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:31:32,404 INFO ]: Start isEmpty. Operand 76 states and 94 transitions. [2018-06-22 11:31:32,405 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:31:32,405 INFO ]: Found error trace [2018-06-22 11:31:32,405 INFO ]: trace histogram [9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:32,405 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:32,405 INFO ]: Analyzing trace with hash -2031287362, now seen corresponding path program 11 times [2018-06-22 11:31:32,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:32,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:32,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:32,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:32,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:32,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:32,975 INFO ]: Checked inductivity of 259 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-06-22 11:31:32,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:32,976 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:32,981 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:33,015 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:31:33,015 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:33,018 INFO ]: Computing forward predicates... [2018-06-22 11:31:33,403 INFO ]: Checked inductivity of 259 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-06-22 11:31:33,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:33,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2018-06-22 11:31:33,422 INFO ]: Interpolant automaton has 45 states [2018-06-22 11:31:33,422 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-22 11:31:33,423 INFO ]: CoverageRelationStatistics Valid=124, Invalid=1856, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:31:33,423 INFO ]: Start difference. First operand 76 states and 94 transitions. Second operand 45 states. [2018-06-22 11:31:34,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:34,563 INFO ]: Finished difference Result 84 states and 101 transitions. [2018-06-22 11:31:34,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:31:34,564 INFO ]: Start accepts. Automaton has 45 states. Word has length 117 [2018-06-22 11:31:34,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:34,565 INFO ]: With dead ends: 84 [2018-06-22 11:31:34,565 INFO ]: Without dead ends: 74 [2018-06-22 11:31:34,566 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=265, Invalid=3895, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 11:31:34,566 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:31:34,569 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 11:31:34,569 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:31:34,570 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-06-22 11:31:34,570 INFO ]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 117 [2018-06-22 11:31:34,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:34,570 INFO ]: Abstraction has 74 states and 91 transitions. [2018-06-22 11:31:34,570 INFO ]: Interpolant automaton has 45 states. [2018-06-22 11:31:34,570 INFO ]: Start isEmpty. Operand 74 states and 91 transitions. [2018-06-22 11:31:34,571 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:31:34,571 INFO ]: Found error trace [2018-06-22 11:31:34,571 INFO ]: trace histogram [11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:34,571 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:34,571 INFO ]: Analyzing trace with hash 1060943783, now seen corresponding path program 12 times [2018-06-22 11:31:34,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:34,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:34,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:34,572 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:34,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:34,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:35,372 INFO ]: Checked inductivity of 356 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 11:31:35,372 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:35,372 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:35,379 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:35,429 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:31:35,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:35,432 INFO ]: Computing forward predicates... [2018-06-22 11:31:35,496 INFO ]: Checked inductivity of 356 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 11:31:35,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:35,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-22 11:31:35,517 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:31:35,517 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:31:35,517 INFO ]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:31:35,517 INFO ]: Start difference. First operand 74 states and 91 transitions. Second operand 27 states. [2018-06-22 11:31:36,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:36,381 INFO ]: Finished difference Result 76 states and 94 transitions. [2018-06-22 11:31:36,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:31:36,382 INFO ]: Start accepts. Automaton has 27 states. Word has length 133 [2018-06-22 11:31:36,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:36,382 INFO ]: With dead ends: 76 [2018-06-22 11:31:36,382 INFO ]: Without dead ends: 76 [2018-06-22 11:31:36,382 INFO ]: 0 DeclaredPredicates, 174 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:31:36,383 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 11:31:36,385 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-22 11:31:36,385 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:31:36,385 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2018-06-22 11:31:36,385 INFO ]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 133 [2018-06-22 11:31:36,388 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:36,388 INFO ]: Abstraction has 76 states and 94 transitions. [2018-06-22 11:31:36,388 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:31:36,388 INFO ]: Start isEmpty. Operand 76 states and 94 transitions. [2018-06-22 11:31:36,389 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:31:36,389 INFO ]: Found error trace [2018-06-22 11:31:36,389 INFO ]: trace histogram [11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:36,389 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:36,390 INFO ]: Analyzing trace with hash -271569260, now seen corresponding path program 8 times [2018-06-22 11:31:36,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:36,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:36,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:36,390 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:36,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:36,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:37,406 INFO ]: Checked inductivity of 356 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 11:31:37,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:37,406 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:37,412 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:37,465 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:37,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:37,470 INFO ]: Computing forward predicates... [2018-06-22 11:31:38,008 INFO ]: Checked inductivity of 356 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 11:31:38,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:38,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-06-22 11:31:38,028 INFO ]: Interpolant automaton has 50 states [2018-06-22 11:31:38,028 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 11:31:38,028 INFO ]: CoverageRelationStatistics Valid=211, Invalid=2239, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:31:38,029 INFO ]: Start difference. First operand 76 states and 94 transitions. Second operand 50 states. [2018-06-22 11:31:38,602 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:31:38,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:38,812 INFO ]: Finished difference Result 96 states and 116 transitions. [2018-06-22 11:31:38,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:31:38,812 INFO ]: Start accepts. Automaton has 50 states. Word has length 133 [2018-06-22 11:31:38,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:38,813 INFO ]: With dead ends: 96 [2018-06-22 11:31:38,813 INFO ]: Without dead ends: 96 [2018-06-22 11:31:38,814 INFO ]: 0 DeclaredPredicates, 179 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=333, Invalid=3699, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:31:38,814 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:31:38,818 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 76. [2018-06-22 11:31:38,818 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:31:38,819 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-06-22 11:31:38,819 INFO ]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 133 [2018-06-22 11:31:38,819 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:38,819 INFO ]: Abstraction has 76 states and 93 transitions. [2018-06-22 11:31:38,819 INFO ]: Interpolant automaton has 50 states. [2018-06-22 11:31:38,819 INFO ]: Start isEmpty. Operand 76 states and 93 transitions. [2018-06-22 11:31:38,820 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:31:38,820 INFO ]: Found error trace [2018-06-22 11:31:38,820 INFO ]: trace histogram [11, 11, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:38,820 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:38,820 INFO ]: Analyzing trace with hash -859496852, now seen corresponding path program 13 times [2018-06-22 11:31:38,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:38,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:38,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:38,823 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:38,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:38,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:39,257 INFO ]: Checked inductivity of 375 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-06-22 11:31:39,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:39,257 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:39,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:39,315 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:39,320 INFO ]: Computing forward predicates... [2018-06-22 11:31:39,892 INFO ]: Checked inductivity of 375 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-06-22 11:31:39,910 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:39,910 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-22 11:31:39,910 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:31:39,910 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:31:39,911 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:31:39,911 INFO ]: Start difference. First operand 76 states and 93 transitions. Second operand 27 states. [2018-06-22 11:31:40,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:40,473 INFO ]: Finished difference Result 98 states and 119 transitions. [2018-06-22 11:31:40,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:31:40,473 INFO ]: Start accepts. Automaton has 27 states. Word has length 137 [2018-06-22 11:31:40,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:40,474 INFO ]: With dead ends: 98 [2018-06-22 11:31:40,474 INFO ]: Without dead ends: 98 [2018-06-22 11:31:40,474 INFO ]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:31:40,475 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:31:40,478 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-06-22 11:31:40,478 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:31:40,479 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2018-06-22 11:31:40,479 INFO ]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 137 [2018-06-22 11:31:40,479 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:40,479 INFO ]: Abstraction has 96 states and 117 transitions. [2018-06-22 11:31:40,479 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:31:40,479 INFO ]: Start isEmpty. Operand 96 states and 117 transitions. [2018-06-22 11:31:40,480 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:31:40,480 INFO ]: Found error trace [2018-06-22 11:31:40,480 INFO ]: trace histogram [11, 11, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:40,480 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:40,481 INFO ]: Analyzing trace with hash 1467664345, now seen corresponding path program 9 times [2018-06-22 11:31:40,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:40,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:40,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:40,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:31:40,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:40,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:40,711 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:31:41,416 INFO ]: Checked inductivity of 375 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-06-22 11:31:41,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:41,417 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:41,423 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:41,472 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:31:41,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:41,476 INFO ]: Computing forward predicates... [2018-06-22 11:31:41,615 INFO ]: Checked inductivity of 375 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-06-22 11:31:41,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:41,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-22 11:31:41,648 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:31:41,648 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:31:41,649 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:31:41,649 INFO ]: Start difference. First operand 96 states and 117 transitions. Second operand 27 states. [2018-06-22 11:31:42,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:42,619 INFO ]: Finished difference Result 96 states and 116 transitions. [2018-06-22 11:31:42,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:31:42,619 INFO ]: Start accepts. Automaton has 27 states. Word has length 137 [2018-06-22 11:31:42,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:42,620 INFO ]: With dead ends: 96 [2018-06-22 11:31:42,620 INFO ]: Without dead ends: 96 [2018-06-22 11:31:42,621 INFO ]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:31:42,621 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:31:42,625 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-06-22 11:31:42,625 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:31:42,626 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2018-06-22 11:31:42,626 INFO ]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 137 [2018-06-22 11:31:42,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:42,627 INFO ]: Abstraction has 86 states and 106 transitions. [2018-06-22 11:31:42,627 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:31:42,627 INFO ]: Start isEmpty. Operand 86 states and 106 transitions. [2018-06-22 11:31:42,628 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:31:42,628 INFO ]: Found error trace [2018-06-22 11:31:42,628 INFO ]: trace histogram [11, 11, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:42,628 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:42,628 INFO ]: Analyzing trace with hash -1142341007, now seen corresponding path program 14 times [2018-06-22 11:31:42,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:42,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:42,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:42,629 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:42,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:42,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:43,517 INFO ]: Checked inductivity of 398 backedges. 42 proven. 90 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-06-22 11:31:43,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:43,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:43,524 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:31:43,575 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:31:43,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:43,579 INFO ]: Computing forward predicates... [2018-06-22 11:31:44,066 INFO ]: Checked inductivity of 398 backedges. 12 proven. 125 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-06-22 11:31:44,084 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:44,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2018-06-22 11:31:44,085 INFO ]: Interpolant automaton has 53 states [2018-06-22 11:31:44,085 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-22 11:31:44,086 INFO ]: CoverageRelationStatistics Valid=233, Invalid=2523, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:31:44,086 INFO ]: Start difference. First operand 86 states and 106 transitions. Second operand 53 states. [2018-06-22 11:31:45,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:45,216 INFO ]: Finished difference Result 96 states and 115 transitions. [2018-06-22 11:31:45,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:31:45,222 INFO ]: Start accepts. Automaton has 53 states. Word has length 141 [2018-06-22 11:31:45,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:45,223 INFO ]: With dead ends: 96 [2018-06-22 11:31:45,223 INFO ]: Without dead ends: 84 [2018-06-22 11:31:45,225 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=333, Invalid=3699, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:31:45,225 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:31:45,230 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-22 11:31:45,230 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:31:45,231 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2018-06-22 11:31:45,231 INFO ]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 141 [2018-06-22 11:31:45,231 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:45,231 INFO ]: Abstraction has 84 states and 103 transitions. [2018-06-22 11:31:45,231 INFO ]: Interpolant automaton has 53 states. [2018-06-22 11:31:45,231 INFO ]: Start isEmpty. Operand 84 states and 103 transitions. [2018-06-22 11:31:45,232 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 11:31:45,232 INFO ]: Found error trace [2018-06-22 11:31:45,232 INFO ]: trace histogram [13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:45,232 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:45,232 INFO ]: Analyzing trace with hash -2037762406, now seen corresponding path program 15 times [2018-06-22 11:31:45,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:45,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:45,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:45,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:45,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:45,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:45,809 INFO ]: Checked inductivity of 517 backedges. 132 proven. 30 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-22 11:31:45,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:45,809 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:45,815 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:31:45,858 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:31:45,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:45,864 INFO ]: Computing forward predicates... [2018-06-22 11:31:46,036 INFO ]: Checked inductivity of 517 backedges. 132 proven. 30 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-22 11:31:46,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:46,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-22 11:31:46,070 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:31:46,070 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:31:46,070 INFO ]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:31:46,070 INFO ]: Start difference. First operand 84 states and 103 transitions. Second operand 31 states. [2018-06-22 11:31:46,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:46,382 INFO ]: Finished difference Result 86 states and 106 transitions. [2018-06-22 11:31:46,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:31:46,382 INFO ]: Start accepts. Automaton has 31 states. Word has length 157 [2018-06-22 11:31:46,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:46,383 INFO ]: With dead ends: 86 [2018-06-22 11:31:46,383 INFO ]: Without dead ends: 86 [2018-06-22 11:31:46,383 INFO ]: 0 DeclaredPredicates, 206 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:31:46,384 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:31:46,387 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-06-22 11:31:46,387 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:31:46,388 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2018-06-22 11:31:46,388 INFO ]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 157 [2018-06-22 11:31:46,388 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:46,388 INFO ]: Abstraction has 86 states and 106 transitions. [2018-06-22 11:31:46,388 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:31:46,388 INFO ]: Start isEmpty. Operand 86 states and 106 transitions. [2018-06-22 11:31:46,389 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 11:31:46,389 INFO ]: Found error trace [2018-06-22 11:31:46,389 INFO ]: trace histogram [13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:46,390 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:46,390 INFO ]: Analyzing trace with hash -202105721, now seen corresponding path program 10 times [2018-06-22 11:31:46,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:46,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:46,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:46,391 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:46,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:46,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:47,335 INFO ]: Checked inductivity of 517 backedges. 132 proven. 30 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-22 11:31:47,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:47,335 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:47,343 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:47,385 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:47,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:47,392 INFO ]: Computing forward predicates... [2018-06-22 11:31:49,353 INFO ]: Checked inductivity of 517 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-22 11:31:49,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:49,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-06-22 11:31:49,373 INFO ]: Interpolant automaton has 58 states [2018-06-22 11:31:49,373 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 11:31:49,373 INFO ]: CoverageRelationStatistics Valid=273, Invalid=3033, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:31:49,374 INFO ]: Start difference. First operand 86 states and 106 transitions. Second operand 58 states. [2018-06-22 11:31:50,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:50,028 INFO ]: Finished difference Result 108 states and 130 transitions. [2018-06-22 11:31:50,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:31:50,028 INFO ]: Start accepts. Automaton has 58 states. Word has length 157 [2018-06-22 11:31:50,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:50,029 INFO ]: With dead ends: 108 [2018-06-22 11:31:50,029 INFO ]: Without dead ends: 108 [2018-06-22 11:31:50,030 INFO ]: 0 DeclaredPredicates, 212 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=435, Invalid=5115, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 11:31:50,030 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:31:50,036 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 86. [2018-06-22 11:31:50,036 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:31:50,037 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-06-22 11:31:50,037 INFO ]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 157 [2018-06-22 11:31:50,038 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:50,038 INFO ]: Abstraction has 86 states and 105 transitions. [2018-06-22 11:31:50,038 INFO ]: Interpolant automaton has 58 states. [2018-06-22 11:31:50,038 INFO ]: Start isEmpty. Operand 86 states and 105 transitions. [2018-06-22 11:31:50,039 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 11:31:50,039 INFO ]: Found error trace [2018-06-22 11:31:50,039 INFO ]: trace histogram [13, 13, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:50,039 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:50,039 INFO ]: Analyzing trace with hash -1368781921, now seen corresponding path program 16 times [2018-06-22 11:31:50,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:50,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:50,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:50,040 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:50,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:50,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:50,554 INFO ]: Checked inductivity of 540 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-06-22 11:31:50,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:50,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:50,560 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:31:50,622 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:31:50,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:50,628 INFO ]: Computing forward predicates... [2018-06-22 11:31:50,922 INFO ]: Checked inductivity of 540 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-06-22 11:31:50,952 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:50,952 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-22 11:31:50,953 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:31:50,953 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:31:50,953 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:31:50,953 INFO ]: Start difference. First operand 86 states and 105 transitions. Second operand 31 states. [2018-06-22 11:31:51,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:51,621 INFO ]: Finished difference Result 110 states and 133 transitions. [2018-06-22 11:31:51,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:31:51,624 INFO ]: Start accepts. Automaton has 31 states. Word has length 161 [2018-06-22 11:31:51,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:51,625 INFO ]: With dead ends: 110 [2018-06-22 11:31:51,625 INFO ]: Without dead ends: 110 [2018-06-22 11:31:51,626 INFO ]: 0 DeclaredPredicates, 213 GetRequests, 158 SyntacticMatches, 14 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=1699, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:31:51,626 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 11:31:51,631 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-06-22 11:31:51,631 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:31:51,632 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-06-22 11:31:51,632 INFO ]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 161 [2018-06-22 11:31:51,633 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:51,633 INFO ]: Abstraction has 108 states and 131 transitions. [2018-06-22 11:31:51,633 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:31:51,633 INFO ]: Start isEmpty. Operand 108 states and 131 transitions. [2018-06-22 11:31:51,634 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 11:31:51,634 INFO ]: Found error trace [2018-06-22 11:31:51,634 INFO ]: trace histogram [13, 13, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:51,634 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:51,634 INFO ]: Analyzing trace with hash -1222204404, now seen corresponding path program 11 times [2018-06-22 11:31:51,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:51,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:51,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:51,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:51,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:51,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:51,853 WARN ]: Spent 150.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:31:52,268 INFO ]: Checked inductivity of 540 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-06-22 11:31:52,268 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:52,268 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:52,274 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:52,322 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:31:52,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:52,326 INFO ]: Computing forward predicates... [2018-06-22 11:31:52,397 INFO ]: Checked inductivity of 540 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-06-22 11:31:52,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:52,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-22 11:31:52,417 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:31:52,417 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:31:52,417 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:31:52,417 INFO ]: Start difference. First operand 108 states and 131 transitions. Second operand 31 states. [2018-06-22 11:31:53,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:53,458 INFO ]: Finished difference Result 108 states and 130 transitions. [2018-06-22 11:31:53,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:31:53,459 INFO ]: Start accepts. Automaton has 31 states. Word has length 161 [2018-06-22 11:31:53,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:53,460 INFO ]: With dead ends: 108 [2018-06-22 11:31:53,460 INFO ]: Without dead ends: 108 [2018-06-22 11:31:53,460 INFO ]: 0 DeclaredPredicates, 213 GetRequests, 158 SyntacticMatches, 14 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=1699, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:31:53,461 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:31:53,466 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-06-22 11:31:53,466 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:31:53,467 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-06-22 11:31:53,467 INFO ]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 161 [2018-06-22 11:31:53,467 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:53,467 INFO ]: Abstraction has 96 states and 118 transitions. [2018-06-22 11:31:53,467 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:31:53,467 INFO ]: Start isEmpty. Operand 96 states and 118 transitions. [2018-06-22 11:31:53,468 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 11:31:53,468 INFO ]: Found error trace [2018-06-22 11:31:53,468 INFO ]: trace histogram [13, 13, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:53,468 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:53,469 INFO ]: Analyzing trace with hash -453276188, now seen corresponding path program 17 times [2018-06-22 11:31:53,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:53,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:53,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:53,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:53,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:53,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:54,369 INFO ]: Checked inductivity of 567 backedges. 56 proven. 132 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-06-22 11:31:54,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:54,369 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:54,375 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:31:54,428 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:31:54,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:54,433 INFO ]: Computing forward predicates... [2018-06-22 11:31:55,253 INFO ]: Checked inductivity of 567 backedges. 14 proven. 180 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2018-06-22 11:31:55,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:55,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-06-22 11:31:55,272 INFO ]: Interpolant automaton has 61 states [2018-06-22 11:31:55,272 INFO ]: Constructing interpolant automaton starting with 61 interpolants. [2018-06-22 11:31:55,273 INFO ]: CoverageRelationStatistics Valid=198, Invalid=3462, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:31:55,273 INFO ]: Start difference. First operand 96 states and 118 transitions. Second operand 61 states. [2018-06-22 11:31:56,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:56,502 INFO ]: Finished difference Result 108 states and 129 transitions. [2018-06-22 11:31:56,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:31:56,503 INFO ]: Start accepts. Automaton has 61 states. Word has length 165 [2018-06-22 11:31:56,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:56,503 INFO ]: With dead ends: 108 [2018-06-22 11:31:56,503 INFO ]: Without dead ends: 94 [2018-06-22 11:31:56,504 INFO ]: 0 DeclaredPredicates, 235 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=425, Invalid=7407, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 11:31:56,504 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:31:56,506 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-06-22 11:31:56,506 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 11:31:56,507 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-06-22 11:31:56,507 INFO ]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 165 [2018-06-22 11:31:56,508 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:56,508 INFO ]: Abstraction has 94 states and 115 transitions. [2018-06-22 11:31:56,508 INFO ]: Interpolant automaton has 61 states. [2018-06-22 11:31:56,508 INFO ]: Start isEmpty. Operand 94 states and 115 transitions. [2018-06-22 11:31:56,509 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:31:56,509 INFO ]: Found error trace [2018-06-22 11:31:56,509 INFO ]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:56,509 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:56,509 INFO ]: Analyzing trace with hash 383685197, now seen corresponding path program 18 times [2018-06-22 11:31:56,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:56,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:56,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:56,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:56,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:56,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:57,004 INFO ]: Checked inductivity of 708 backedges. 182 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-06-22 11:31:57,004 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:57,004 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:57,010 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:57,064 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 11:31:57,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:57,068 INFO ]: Computing forward predicates... [2018-06-22 11:31:57,126 INFO ]: Checked inductivity of 708 backedges. 182 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-06-22 11:31:57,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:57,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-22 11:31:57,145 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:31:57,145 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:31:57,145 INFO ]: CoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:31:57,145 INFO ]: Start difference. First operand 94 states and 115 transitions. Second operand 35 states. [2018-06-22 11:31:57,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:57,423 INFO ]: Finished difference Result 96 states and 118 transitions. [2018-06-22 11:31:57,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:31:57,430 INFO ]: Start accepts. Automaton has 35 states. Word has length 181 [2018-06-22 11:31:57,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:57,431 INFO ]: With dead ends: 96 [2018-06-22 11:31:57,431 INFO ]: Without dead ends: 96 [2018-06-22 11:31:57,431 INFO ]: 0 DeclaredPredicates, 238 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=1973, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:31:57,432 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:31:57,436 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-06-22 11:31:57,436 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:31:57,437 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-06-22 11:31:57,437 INFO ]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 181 [2018-06-22 11:31:57,437 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:57,437 INFO ]: Abstraction has 96 states and 118 transitions. [2018-06-22 11:31:57,437 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:31:57,437 INFO ]: Start isEmpty. Operand 96 states and 118 transitions. [2018-06-22 11:31:57,438 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:31:57,438 INFO ]: Found error trace [2018-06-22 11:31:57,438 INFO ]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:57,438 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:57,438 INFO ]: Analyzing trace with hash -1870534854, now seen corresponding path program 12 times [2018-06-22 11:31:57,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:57,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:57,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:57,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:57,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:57,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:57,849 INFO ]: Checked inductivity of 708 backedges. 182 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-06-22 11:31:57,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:31:57,849 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:31:57,855 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:31:57,910 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 11:31:57,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:57,917 INFO ]: Computing forward predicates... [2018-06-22 11:31:58,744 INFO ]: Checked inductivity of 708 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-06-22 11:31:58,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:31:58,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-06-22 11:31:58,764 INFO ]: Interpolant automaton has 66 states [2018-06-22 11:31:58,764 INFO ]: Constructing interpolant automaton starting with 66 interpolants. [2018-06-22 11:31:58,765 INFO ]: CoverageRelationStatistics Valid=343, Invalid=3947, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 11:31:58,765 INFO ]: Start difference. First operand 96 states and 118 transitions. Second operand 66 states. [2018-06-22 11:31:59,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:31:59,486 INFO ]: Finished difference Result 120 states and 144 transitions. [2018-06-22 11:31:59,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 11:31:59,486 INFO ]: Start accepts. Automaton has 66 states. Word has length 181 [2018-06-22 11:31:59,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:31:59,487 INFO ]: With dead ends: 120 [2018-06-22 11:31:59,487 INFO ]: Without dead ends: 120 [2018-06-22 11:31:59,488 INFO ]: 0 DeclaredPredicates, 245 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2491 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=550, Invalid=6760, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 11:31:59,488 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 11:31:59,492 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 96. [2018-06-22 11:31:59,492 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:31:59,493 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2018-06-22 11:31:59,493 INFO ]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 181 [2018-06-22 11:31:59,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:31:59,493 INFO ]: Abstraction has 96 states and 117 transitions. [2018-06-22 11:31:59,493 INFO ]: Interpolant automaton has 66 states. [2018-06-22 11:31:59,493 INFO ]: Start isEmpty. Operand 96 states and 117 transitions. [2018-06-22 11:31:59,494 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 11:31:59,494 INFO ]: Found error trace [2018-06-22 11:31:59,494 INFO ]: trace histogram [15, 15, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:31:59,495 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:31:59,495 INFO ]: Analyzing trace with hash -563829358, now seen corresponding path program 19 times [2018-06-22 11:31:59,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:31:59,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:31:59,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:59,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:31:59,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:31:59,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:31:59,749 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:32:00,404 INFO ]: Checked inductivity of 735 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-06-22 11:32:00,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:32:00,405 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:32:00,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:32:00,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:00,482 INFO ]: Computing forward predicates... [2018-06-22 11:32:00,673 INFO ]: Checked inductivity of 735 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-06-22 11:32:00,693 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:32:00,693 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-22 11:32:00,693 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:32:00,693 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:32:00,693 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:32:00,694 INFO ]: Start difference. First operand 96 states and 117 transitions. Second operand 35 states. [2018-06-22 11:32:01,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:32:01,597 INFO ]: Finished difference Result 122 states and 147 transitions. [2018-06-22 11:32:01,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:32:01,597 INFO ]: Start accepts. Automaton has 35 states. Word has length 185 [2018-06-22 11:32:01,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:32:01,599 INFO ]: With dead ends: 122 [2018-06-22 11:32:01,599 INFO ]: Without dead ends: 122 [2018-06-22 11:32:01,599 INFO ]: 0 DeclaredPredicates, 245 GetRequests, 182 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=2229, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:32:01,599 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:32:01,604 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-06-22 11:32:01,604 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 11:32:01,605 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2018-06-22 11:32:01,605 INFO ]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 185 [2018-06-22 11:32:01,605 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:32:01,605 INFO ]: Abstraction has 120 states and 145 transitions. [2018-06-22 11:32:01,605 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:32:01,605 INFO ]: Start isEmpty. Operand 120 states and 145 transitions. [2018-06-22 11:32:01,606 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 11:32:01,607 INFO ]: Found error trace [2018-06-22 11:32:01,607 INFO ]: trace histogram [15, 15, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:32:01,607 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:32:01,607 INFO ]: Analyzing trace with hash 1259023615, now seen corresponding path program 13 times [2018-06-22 11:32:01,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:32:01,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:32:01,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:01,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:32:01,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:01,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:01,834 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:32:02,502 INFO ]: Checked inductivity of 735 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-06-22 11:32:02,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:32:02,503 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:32:02,518 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:32:02,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:02,581 INFO ]: Computing forward predicates... [2018-06-22 11:32:03,487 INFO ]: Checked inductivity of 735 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-06-22 11:32:03,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:32:03,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-22 11:32:03,516 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:32:03,516 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:32:03,516 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:32:03,516 INFO ]: Start difference. First operand 120 states and 145 transitions. Second operand 35 states. [2018-06-22 11:32:04,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:32:04,583 INFO ]: Finished difference Result 120 states and 144 transitions. [2018-06-22 11:32:04,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:32:04,584 INFO ]: Start accepts. Automaton has 35 states. Word has length 185 [2018-06-22 11:32:04,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:32:04,585 INFO ]: With dead ends: 120 [2018-06-22 11:32:04,585 INFO ]: Without dead ends: 120 [2018-06-22 11:32:04,585 INFO ]: 0 DeclaredPredicates, 245 GetRequests, 182 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=123, Invalid=2229, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:32:04,585 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 11:32:04,590 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 106. [2018-06-22 11:32:04,590 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:32:04,591 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2018-06-22 11:32:04,591 INFO ]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 185 [2018-06-22 11:32:04,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:32:04,592 INFO ]: Abstraction has 106 states and 130 transitions. [2018-06-22 11:32:04,592 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:32:04,592 INFO ]: Start isEmpty. Operand 106 states and 130 transitions. [2018-06-22 11:32:04,593 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 11:32:04,593 INFO ]: Found error trace [2018-06-22 11:32:04,593 INFO ]: trace histogram [15, 15, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:32:04,593 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:32:04,593 INFO ]: Analyzing trace with hash 1203656215, now seen corresponding path program 20 times [2018-06-22 11:32:04,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:32:04,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:32:04,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:04,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:32:04,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:04,606 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:05,267 INFO ]: Checked inductivity of 766 backedges. 72 proven. 182 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-06-22 11:32:05,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:32:05,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:32:05,272 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:32:05,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:32:05,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:05,326 INFO ]: Computing forward predicates... [2018-06-22 11:32:06,077 INFO ]: Checked inductivity of 766 backedges. 16 proven. 245 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-06-22 11:32:06,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:32:06,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 69 [2018-06-22 11:32:06,097 INFO ]: Interpolant automaton has 69 states [2018-06-22 11:32:06,097 INFO ]: Constructing interpolant automaton starting with 69 interpolants. [2018-06-22 11:32:06,097 INFO ]: CoverageRelationStatistics Valid=371, Invalid=4321, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:32:06,097 INFO ]: Start difference. First operand 106 states and 130 transitions. Second operand 69 states. [2018-06-22 11:32:06,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:32:06,994 INFO ]: Finished difference Result 120 states and 143 transitions. [2018-06-22 11:32:06,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:32:06,994 INFO ]: Start accepts. Automaton has 69 states. Word has length 189 [2018-06-22 11:32:06,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:32:06,995 INFO ]: With dead ends: 120 [2018-06-22 11:32:06,995 INFO ]: Without dead ends: 104 [2018-06-22 11:32:06,996 INFO ]: 0 DeclaredPredicates, 252 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=523, Invalid=6449, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 11:32:06,996 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:32:07,002 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-06-22 11:32:07,002 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:32:07,003 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2018-06-22 11:32:07,003 INFO ]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 189 [2018-06-22 11:32:07,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:32:07,003 INFO ]: Abstraction has 104 states and 127 transitions. [2018-06-22 11:32:07,003 INFO ]: Interpolant automaton has 69 states. [2018-06-22 11:32:07,003 INFO ]: Start isEmpty. Operand 104 states and 127 transitions. [2018-06-22 11:32:07,005 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 11:32:07,005 INFO ]: Found error trace [2018-06-22 11:32:07,005 INFO ]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:32:07,005 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:32:07,005 INFO ]: Analyzing trace with hash 364395200, now seen corresponding path program 21 times [2018-06-22 11:32:07,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:32:07,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:32:07,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:07,005 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:32:07,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:07,018 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:07,553 INFO ]: Checked inductivity of 929 backedges. 240 proven. 56 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2018-06-22 11:32:07,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:32:07,553 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:32:07,559 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:32:07,618 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:32:07,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:32:07,621 INFO ]: Computing forward predicates... [2018-06-22 11:32:07,690 INFO ]: Checked inductivity of 929 backedges. 240 proven. 56 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2018-06-22 11:32:07,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:32:07,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-22 11:32:07,723 INFO ]: Interpolant automaton has 39 states [2018-06-22 11:32:07,723 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 11:32:07,723 INFO ]: CoverageRelationStatistics Valid=196, Invalid=1286, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:32:07,723 INFO ]: Start difference. First operand 104 states and 127 transitions. Second operand 39 states. [2018-06-22 11:32:08,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:32:08,319 INFO ]: Finished difference Result 106 states and 130 transitions. [2018-06-22 11:32:08,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:32:08,319 INFO ]: Start accepts. Automaton has 39 states. Word has length 205 [2018-06-22 11:32:08,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:32:08,320 INFO ]: With dead ends: 106 [2018-06-22 11:32:08,320 INFO ]: Without dead ends: 106 [2018-06-22 11:32:08,320 INFO ]: 0 DeclaredPredicates, 270 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=2508, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:32:08,321 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:32:08,324 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-06-22 11:32:08,324 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:32:08,325 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2018-06-22 11:32:08,325 INFO ]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 205 [2018-06-22 11:32:08,326 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:32:08,326 INFO ]: Abstraction has 106 states and 130 transitions. [2018-06-22 11:32:08,326 INFO ]: Interpolant automaton has 39 states. [2018-06-22 11:32:08,326 INFO ]: Start isEmpty. Operand 106 states and 130 transitions. [2018-06-22 11:32:08,327 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 11:32:08,327 INFO ]: Found error trace [2018-06-22 11:32:08,327 INFO ]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:32:08,327 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:32:08,327 INFO ]: Analyzing trace with hash -1309147475, now seen corresponding path program 14 times [2018-06-22 11:32:08,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:32:08,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:32:08,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:08,328 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:32:08,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:32:08,341 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:32:08,863 WARN ]: Verification canceled [2018-06-22 11:32:08,870 WARN ]: Timeout [2018-06-22 11:32:08,870 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:32:08 BoogieIcfgContainer [2018-06-22 11:32:08,870 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:32:08,871 INFO ]: Toolchain (without parser) took 55136.94 ms. Allocated memory was 305.7 MB in the beginning and 690.0 MB in the end (delta: 384.3 MB). Free memory was 258.0 MB in the beginning and 320.0 MB in the end (delta: -61.9 MB). Peak memory consumption was 322.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:32:08,872 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:32:08,872 INFO ]: ChcToBoogie took 48.67 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:32:08,872 INFO ]: Boogie Preprocessor took 44.03 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 255.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 11:32:08,874 INFO ]: RCFGBuilder took 475.84 ms. Allocated memory is still 305.7 MB. Free memory was 255.1 MB in the beginning and 245.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:32:08,875 INFO ]: TraceAbstraction took 54549.26 ms. Allocated memory was 305.7 MB in the beginning and 690.0 MB in the end (delta: 384.3 MB). Free memory was 245.1 MB in the beginning and 320.0 MB in the end (delta: -74.9 MB). Peak memory consumption was 309.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:32:08,877 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.67 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.03 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 255.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 475.84 ms. Allocated memory is still 305.7 MB. Free memory was 255.1 MB in the beginning and 245.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54549.26 ms. Allocated memory was 305.7 MB in the beginning and 690.0 MB in the end (delta: 384.3 MB). Free memory was 245.1 MB in the beginning and 320.0 MB in the end (delta: -74.9 MB). Peak memory consumption was 309.4 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 206 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 34 locations, 1 error locations. TIMEOUT Result, 54.4s OverallTime, 42 OverallIterations, 17 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2433 SDtfs, 473 SDslu, 45742 SDs, 0 SdLazy, 20430 SolverSat, 378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5454 GetRequests, 3913 SyntacticMatches, 140 SemanticMatches, 1401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15816 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 180 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 8271 NumberOfCodeBlocks, 8141 NumberOfCodeBlocksAsserted, 181 NumberOfCheckSat, 8196 ConstructedInterpolants, 0 QuantifiedInterpolants, 3399904 SizeOfPredicates, 395 NumberOfNonLiveVariables, 11458 ConjunctsInSsa, 2072 ConjunctsInUnsatCore, 75 InterpolantComputations, 7 PerfectInterpolantSequences, 17762/22686 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/enc-zip_unzip.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-32-08-897.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-32-08-897.csv Completed graceful shutdown