java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/down.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:26:16,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:26:16,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:26:16,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:26:16,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:26:16,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:26:16,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:26:16,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:26:16,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:26:16,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:26:16,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:26:16,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:26:16,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:26:16,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:26:16,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:26:16,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:26:16,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:26:16,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:26:16,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:26:16,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:26:16,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:26:16,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:26:16,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:26:16,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:26:16,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:26:16,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:26:16,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:26:16,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:26:16,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:26:16,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:26:16,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:26:16,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:26:16,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:26:16,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:26:16,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:26:16,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:26:16,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:26:16,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:26:16,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:26:16,454 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:26:16,454 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:26:16,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:26:16,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:26:16,456 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:26:16,456 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:26:16,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:26:16,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:26:16,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:26:16,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:26:16,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:26:16,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:26:16,460 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:26:16,460 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:26:16,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:26:16,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:26:16,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:26:16,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:26:16,461 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:26:16,464 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:26:16,465 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:26:16,513 INFO ]: Repository-Root is: /tmp [2018-06-26 21:26:16,528 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:26:16,534 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:26:16,536 INFO ]: Initializing SmtParser... [2018-06-26 21:26:16,536 INFO ]: SmtParser initialized [2018-06-26 21:26:16,537 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/down.c.smt2 [2018-06-26 21:26:16,538 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-26 21:26:16,625 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/down.c.smt2 unknown [2018-06-26 21:26:16,875 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/down.c.smt2 [2018-06-26 21:26:16,879 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:26:16,887 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:26:16,888 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:26:16,888 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:26:16,888 INFO ]: ChcToBoogie initialized [2018-06-26 21:26:16,891 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,943 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16 Unit [2018-06-26 21:26:16,943 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:26:16,944 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:26:16,944 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:26:16,944 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:26:16,964 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,964 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,970 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,971 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,985 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,986 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,988 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... [2018-06-26 21:26:16,989 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:26:16,990 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:26:16,990 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:26:16,990 INFO ]: RCFGBuilder initialized [2018-06-26 21:26:16,991 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:26:17,015 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:26:17,015 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:26:17,015 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:26:17,015 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:26:17,015 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:26:17,015 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 21:26:17,208 INFO ]: Using library mode [2018-06-26 21:26:17,209 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:26:17 BoogieIcfgContainer [2018-06-26 21:26:17,209 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:26:17,209 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:26:17,209 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:26:17,210 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:26:17,211 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:26:17" (1/1) ... [2018-06-26 21:26:17,225 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:26:17,226 INFO ]: Using Remove infeasible edges [2018-06-26 21:26:17,226 INFO ]: Using Maximize final states [2018-06-26 21:26:17,227 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:26:17,227 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:26:17,229 INFO ]: Using Remove sink states [2018-06-26 21:26:17,230 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:26:17,230 INFO ]: Using Use SBE [2018-06-26 21:26:17,239 WARN ]: expecting exponential blowup for input size 22 [2018-06-26 21:26:27,367 INFO ]: SBE split 1 edges [2018-06-26 21:26:27,374 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:26:27,376 INFO ]: 0 new accepting states [2018-06-26 21:26:27,416 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:26:27,418 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:26:27,423 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:26:27,423 INFO ]: 0 new accepting states [2018-06-26 21:26:27,423 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:26:27,423 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:26:27,426 INFO ]: Encoded RCFG 6 locations, 86 edges [2018-06-26 21:26:27,427 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:26:27 BasicIcfg [2018-06-26 21:26:27,427 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:26:27,428 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:26:27,428 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:26:27,431 INFO ]: TraceAbstraction initialized [2018-06-26 21:26:27,431 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:26:16" (1/4) ... [2018-06-26 21:26:27,432 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9f7277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:26:27, skipping insertion in model container [2018-06-26 21:26:27,433 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:26:16" (2/4) ... [2018-06-26 21:26:27,433 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9f7277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:26:27, skipping insertion in model container [2018-06-26 21:26:27,433 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:26:17" (3/4) ... [2018-06-26 21:26:27,433 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9f7277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:26:27, skipping insertion in model container [2018-06-26 21:26:27,433 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:26:27" (4/4) ... [2018-06-26 21:26:27,435 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:26:27,446 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:26:27,454 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:26:27,511 INFO ]: Using default assertion order modulation [2018-06-26 21:26:27,511 INFO ]: Interprodecural is true [2018-06-26 21:26:27,511 INFO ]: Hoare is false [2018-06-26 21:26:27,511 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:26:27,511 INFO ]: Backedges is TWOTRACK [2018-06-26 21:26:27,511 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:26:27,512 INFO ]: Difference is false [2018-06-26 21:26:27,512 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:26:27,512 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:26:27,526 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:26:27,543 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:26:27,543 INFO ]: Found error trace [2018-06-26 21:26:27,544 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:26:27,544 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:27,549 INFO ]: Analyzing trace with hash 37893474, now seen corresponding path program 1 times [2018-06-26 21:26:27,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:27,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:27,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:27,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:27,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:27,625 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:27,707 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:26:27,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:27,710 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:27,711 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:27,735 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:27,736 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:27,739 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:26:28,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:28,680 INFO ]: Finished difference Result 7 states and 114 transitions. [2018-06-26 21:26:28,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:28,681 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:26:28,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:28,690 INFO ]: With dead ends: 7 [2018-06-26 21:26:28,690 INFO ]: Without dead ends: 7 [2018-06-26 21:26:28,691 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:28,703 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:26:28,719 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:26:28,720 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:26:28,721 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-06-26 21:26:28,722 INFO ]: Start accepts. Automaton has 7 states and 114 transitions. Word has length 5 [2018-06-26 21:26:28,723 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:28,723 INFO ]: Abstraction has 7 states and 114 transitions. [2018-06-26 21:26:28,723 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:28,723 INFO ]: Start isEmpty. Operand 7 states and 114 transitions. [2018-06-26 21:26:28,723 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:26:28,723 INFO ]: Found error trace [2018-06-26 21:26:28,723 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:26:28,723 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:28,724 INFO ]: Analyzing trace with hash 1172543291, now seen corresponding path program 1 times [2018-06-26 21:26:28,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:28,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:28,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:28,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:28,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:28,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:28,794 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:26:28,794 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:28,794 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:28,796 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:28,796 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:28,796 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:28,796 INFO ]: Start difference. First operand 7 states and 114 transitions. Second operand 3 states. [2018-06-26 21:26:29,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:29,453 INFO ]: Finished difference Result 9 states and 166 transitions. [2018-06-26 21:26:29,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:29,453 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:26:29,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:29,454 INFO ]: With dead ends: 9 [2018-06-26 21:26:29,454 INFO ]: Without dead ends: 9 [2018-06-26 21:26:29,455 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:29,455 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:26:29,458 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:26:29,458 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:26:29,459 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2018-06-26 21:26:29,459 INFO ]: Start accepts. Automaton has 9 states and 166 transitions. Word has length 6 [2018-06-26 21:26:29,459 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:29,459 INFO ]: Abstraction has 9 states and 166 transitions. [2018-06-26 21:26:29,459 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:29,459 INFO ]: Start isEmpty. Operand 9 states and 166 transitions. [2018-06-26 21:26:29,460 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:26:29,460 INFO ]: Found error trace [2018-06-26 21:26:29,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:29,460 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:29,460 INFO ]: Analyzing trace with hash 2023443225, now seen corresponding path program 1 times [2018-06-26 21:26:29,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:29,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:29,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:29,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:29,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:29,473 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:29,510 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:26:29,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:29,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:29,510 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:29,511 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:29,511 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:29,511 INFO ]: Start difference. First operand 9 states and 166 transitions. Second operand 3 states. [2018-06-26 21:26:29,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:29,785 INFO ]: Finished difference Result 13 states and 224 transitions. [2018-06-26 21:26:29,813 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:29,813 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 21:26:29,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:29,814 INFO ]: With dead ends: 13 [2018-06-26 21:26:29,814 INFO ]: Without dead ends: 13 [2018-06-26 21:26:29,814 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:29,814 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:26:29,818 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:26:29,818 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:26:29,819 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 224 transitions. [2018-06-26 21:26:29,819 INFO ]: Start accepts. Automaton has 13 states and 224 transitions. Word has length 7 [2018-06-26 21:26:29,819 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:29,819 INFO ]: Abstraction has 13 states and 224 transitions. [2018-06-26 21:26:29,819 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:29,819 INFO ]: Start isEmpty. Operand 13 states and 224 transitions. [2018-06-26 21:26:29,820 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:26:29,820 INFO ]: Found error trace [2018-06-26 21:26:29,820 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:29,820 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:29,820 INFO ]: Analyzing trace with hash 1630638817, now seen corresponding path program 1 times [2018-06-26 21:26:29,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:29,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:29,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:29,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:29,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:29,840 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:29,884 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:26:29,884 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:29,884 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:29,884 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:29,884 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:29,884 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:29,884 INFO ]: Start difference. First operand 13 states and 224 transitions. Second operand 3 states. [2018-06-26 21:26:30,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:30,058 INFO ]: Finished difference Result 19 states and 230 transitions. [2018-06-26 21:26:30,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:30,058 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 21:26:30,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:30,059 INFO ]: With dead ends: 19 [2018-06-26 21:26:30,059 INFO ]: Without dead ends: 18 [2018-06-26 21:26:30,059 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:30,059 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 21:26:30,062 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 21:26:30,062 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 21:26:30,063 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 174 transitions. [2018-06-26 21:26:30,063 INFO ]: Start accepts. Automaton has 18 states and 174 transitions. Word has length 9 [2018-06-26 21:26:30,063 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:30,063 INFO ]: Abstraction has 18 states and 174 transitions. [2018-06-26 21:26:30,063 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:30,063 INFO ]: Start isEmpty. Operand 18 states and 174 transitions. [2018-06-26 21:26:30,064 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:26:30,064 INFO ]: Found error trace [2018-06-26 21:26:30,064 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:30,064 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:30,064 INFO ]: Analyzing trace with hash 334783557, now seen corresponding path program 1 times [2018-06-26 21:26:30,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:30,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:30,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:30,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:30,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:30,085 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:30,164 INFO ]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:26:30,164 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:30,164 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 21:26:30,164 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:26:30,164 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:26:30,164 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:26:30,164 INFO ]: Start difference. First operand 18 states and 174 transitions. Second operand 4 states. [2018-06-26 21:26:30,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:30,628 INFO ]: Finished difference Result 44 states and 489 transitions. [2018-06-26 21:26:30,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:26:30,629 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-26 21:26:30,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:30,631 INFO ]: With dead ends: 44 [2018-06-26 21:26:30,631 INFO ]: Without dead ends: 36 [2018-06-26 21:26:30,631 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:26:30,631 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 21:26:30,637 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-06-26 21:26:30,637 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 21:26:30,639 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 294 transitions. [2018-06-26 21:26:30,639 INFO ]: Start accepts. Automaton has 33 states and 294 transitions. Word has length 10 [2018-06-26 21:26:30,639 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:30,639 INFO ]: Abstraction has 33 states and 294 transitions. [2018-06-26 21:26:30,639 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:26:30,639 INFO ]: Start isEmpty. Operand 33 states and 294 transitions. [2018-06-26 21:26:30,640 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:26:30,640 INFO ]: Found error trace [2018-06-26 21:26:30,640 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:30,640 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:30,640 INFO ]: Analyzing trace with hash -189460851, now seen corresponding path program 1 times [2018-06-26 21:26:30,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:30,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:30,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:30,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:30,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:30,654 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:30,705 INFO ]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:26:30,705 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:30,705 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-26 21:26:30,712 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:30,753 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:30,762 INFO ]: Computing forward predicates... [2018-06-26 21:26:30,881 INFO ]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:26:30,905 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:30,905 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-26 21:26:30,905 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:26:30,905 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:26:30,905 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:26:30,905 INFO ]: Start difference. First operand 33 states and 294 transitions. Second operand 9 states. [2018-06-26 21:26:31,525 WARN ]: Spent 277.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-06-26 21:26:33,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:33,013 INFO ]: Finished difference Result 275 states and 2028 transitions. [2018-06-26 21:26:33,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 21:26:33,015 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 21:26:33,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:33,021 INFO ]: With dead ends: 275 [2018-06-26 21:26:33,021 INFO ]: Without dead ends: 275 [2018-06-26 21:26:33,022 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-06-26 21:26:33,022 INFO ]: Start minimizeSevpa. Operand 275 states. [2018-06-26 21:26:33,054 INFO ]: Finished minimizeSevpa. Reduced states from 275 to 156. [2018-06-26 21:26:33,054 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-26 21:26:33,058 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 1366 transitions. [2018-06-26 21:26:33,058 INFO ]: Start accepts. Automaton has 156 states and 1366 transitions. Word has length 10 [2018-06-26 21:26:33,058 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:33,058 INFO ]: Abstraction has 156 states and 1366 transitions. [2018-06-26 21:26:33,058 INFO ]: Interpolant automaton has 9 states. [2018-06-26 21:26:33,058 INFO ]: Start isEmpty. Operand 156 states and 1366 transitions. [2018-06-26 21:26:33,061 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:26:33,061 INFO ]: Found error trace [2018-06-26 21:26:33,061 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:33,061 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:33,061 INFO ]: Analyzing trace with hash -267617906, now seen corresponding path program 1 times [2018-06-26 21:26:33,061 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:33,061 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:33,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:33,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:33,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:33,069 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:33,098 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 21:26:33,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:33,098 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:33,098 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:33,098 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:33,098 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:33,099 INFO ]: Start difference. First operand 156 states and 1366 transitions. Second operand 3 states. [2018-06-26 21:26:33,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:33,196 INFO ]: Finished difference Result 78 states and 420 transitions. [2018-06-26 21:26:33,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:33,205 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:26:33,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:33,207 INFO ]: With dead ends: 78 [2018-06-26 21:26:33,207 INFO ]: Without dead ends: 70 [2018-06-26 21:26:33,207 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:33,207 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 21:26:33,216 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-06-26 21:26:33,216 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 21:26:33,217 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 342 transitions. [2018-06-26 21:26:33,217 INFO ]: Start accepts. Automaton has 63 states and 342 transitions. Word has length 10 [2018-06-26 21:26:33,217 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:33,217 INFO ]: Abstraction has 63 states and 342 transitions. [2018-06-26 21:26:33,217 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:33,217 INFO ]: Start isEmpty. Operand 63 states and 342 transitions. [2018-06-26 21:26:33,218 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:26:33,218 INFO ]: Found error trace [2018-06-26 21:26:33,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:33,218 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:33,219 INFO ]: Analyzing trace with hash 1667923631, now seen corresponding path program 1 times [2018-06-26 21:26:33,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:33,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:33,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:33,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:33,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:33,249 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:33,286 INFO ]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 21:26:33,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:33,286 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:33,287 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:33,287 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:33,287 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:33,287 INFO ]: Start difference. First operand 63 states and 342 transitions. Second operand 3 states. [2018-06-26 21:26:33,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:33,508 INFO ]: Finished difference Result 83 states and 416 transitions. [2018-06-26 21:26:33,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:33,509 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 21:26:33,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:33,511 INFO ]: With dead ends: 83 [2018-06-26 21:26:33,511 INFO ]: Without dead ends: 83 [2018-06-26 21:26:33,513 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:33,513 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-26 21:26:33,519 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 61. [2018-06-26 21:26:33,519 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 21:26:33,520 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 316 transitions. [2018-06-26 21:26:33,520 INFO ]: Start accepts. Automaton has 61 states and 316 transitions. Word has length 14 [2018-06-26 21:26:33,520 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:33,520 INFO ]: Abstraction has 61 states and 316 transitions. [2018-06-26 21:26:33,520 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:33,520 INFO ]: Start isEmpty. Operand 61 states and 316 transitions. [2018-06-26 21:26:33,521 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:26:33,521 INFO ]: Found error trace [2018-06-26 21:26:33,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:33,521 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:33,521 INFO ]: Analyzing trace with hash -6321773, now seen corresponding path program 1 times [2018-06-26 21:26:33,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:33,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:33,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:33,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:33,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:33,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:33,591 INFO ]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 21:26:33,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:33,591 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 21:26:33,592 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:26:33,592 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:26:33,592 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:26:33,592 INFO ]: Start difference. First operand 61 states and 316 transitions. Second operand 4 states. [2018-06-26 21:26:34,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:34,576 INFO ]: Finished difference Result 100 states and 464 transitions. [2018-06-26 21:26:34,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:26:34,576 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-26 21:26:34,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:34,577 INFO ]: With dead ends: 100 [2018-06-26 21:26:34,577 INFO ]: Without dead ends: 69 [2018-06-26 21:26:34,577 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:26:34,577 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-26 21:26:34,582 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-06-26 21:26:34,582 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 21:26:34,583 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 297 transitions. [2018-06-26 21:26:34,583 INFO ]: Start accepts. Automaton has 63 states and 297 transitions. Word has length 14 [2018-06-26 21:26:34,583 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:34,583 INFO ]: Abstraction has 63 states and 297 transitions. [2018-06-26 21:26:34,583 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:26:34,584 INFO ]: Start isEmpty. Operand 63 states and 297 transitions. [2018-06-26 21:26:34,584 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 21:26:34,584 INFO ]: Found error trace [2018-06-26 21:26:34,585 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:34,585 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:34,585 INFO ]: Analyzing trace with hash -1000679951, now seen corresponding path program 1 times [2018-06-26 21:26:34,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:34,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:34,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:34,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:34,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:34,622 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:35,053 INFO ]: Checked inductivity of 120 backedges. 45 proven. 61 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 21:26:35,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:35,053 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-26 21:26:35,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:35,119 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:35,123 INFO ]: Computing forward predicates... [2018-06-26 21:26:35,151 INFO ]: Checked inductivity of 120 backedges. 53 proven. 53 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 21:26:35,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:35,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-26 21:26:35,171 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:26:35,171 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:26:35,171 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:26:35,171 INFO ]: Start difference. First operand 63 states and 297 transitions. Second operand 8 states. [2018-06-26 21:26:35,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:35,797 INFO ]: Finished difference Result 210 states and 925 transitions. [2018-06-26 21:26:35,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 21:26:35,799 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-26 21:26:35,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:35,801 INFO ]: With dead ends: 210 [2018-06-26 21:26:35,801 INFO ]: Without dead ends: 210 [2018-06-26 21:26:35,802 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-06-26 21:26:35,802 INFO ]: Start minimizeSevpa. Operand 210 states. [2018-06-26 21:26:35,811 INFO ]: Finished minimizeSevpa. Reduced states from 210 to 118. [2018-06-26 21:26:35,811 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-26 21:26:35,813 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 582 transitions. [2018-06-26 21:26:35,813 INFO ]: Start accepts. Automaton has 118 states and 582 transitions. Word has length 20 [2018-06-26 21:26:35,813 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:35,813 INFO ]: Abstraction has 118 states and 582 transitions. [2018-06-26 21:26:35,813 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:26:35,813 INFO ]: Start isEmpty. Operand 118 states and 582 transitions. [2018-06-26 21:26:35,815 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 21:26:35,815 INFO ]: Found error trace [2018-06-26 21:26:35,815 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:35,815 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:35,815 INFO ]: Analyzing trace with hash 469235940, now seen corresponding path program 2 times [2018-06-26 21:26:35,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:35,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:35,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:35,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:35,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:35,825 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:35,859 INFO ]: Checked inductivity of 136 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-26 21:26:35,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:35,859 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:35,859 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:35,859 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:35,859 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:35,860 INFO ]: Start difference. First operand 118 states and 582 transitions. Second operand 3 states. [2018-06-26 21:26:35,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:35,921 INFO ]: Finished difference Result 115 states and 433 transitions. [2018-06-26 21:26:35,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:35,924 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-26 21:26:35,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:35,925 INFO ]: With dead ends: 115 [2018-06-26 21:26:35,925 INFO ]: Without dead ends: 115 [2018-06-26 21:26:35,925 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:35,926 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-26 21:26:35,932 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-06-26 21:26:35,932 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-26 21:26:35,933 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 427 transitions. [2018-06-26 21:26:35,933 INFO ]: Start accepts. Automaton has 113 states and 427 transitions. Word has length 21 [2018-06-26 21:26:35,934 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:35,934 INFO ]: Abstraction has 113 states and 427 transitions. [2018-06-26 21:26:35,934 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:35,934 INFO ]: Start isEmpty. Operand 113 states and 427 transitions. [2018-06-26 21:26:35,935 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 21:26:35,935 INFO ]: Found error trace [2018-06-26 21:26:35,935 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:35,935 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:35,935 INFO ]: Analyzing trace with hash 1669366298, now seen corresponding path program 1 times [2018-06-26 21:26:35,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:35,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:35,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:35,936 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:35,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:35,946 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:36,004 INFO ]: Checked inductivity of 153 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-26 21:26:36,004 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:36,004 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:36,004 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:36,004 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:36,004 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:36,004 INFO ]: Start difference. First operand 113 states and 427 transitions. Second operand 3 states. [2018-06-26 21:26:36,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:36,113 INFO ]: Finished difference Result 93 states and 288 transitions. [2018-06-26 21:26:36,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:36,114 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 21:26:36,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:36,115 INFO ]: With dead ends: 93 [2018-06-26 21:26:36,115 INFO ]: Without dead ends: 93 [2018-06-26 21:26:36,115 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:36,115 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-26 21:26:36,118 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 67. [2018-06-26 21:26:36,118 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 21:26:36,119 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 206 transitions. [2018-06-26 21:26:36,119 INFO ]: Start accepts. Automaton has 67 states and 206 transitions. Word has length 22 [2018-06-26 21:26:36,119 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:36,119 INFO ]: Abstraction has 67 states and 206 transitions. [2018-06-26 21:26:36,119 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:36,119 INFO ]: Start isEmpty. Operand 67 states and 206 transitions. [2018-06-26 21:26:36,120 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 21:26:36,120 INFO ]: Found error trace [2018-06-26 21:26:36,120 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:36,120 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:36,121 INFO ]: Analyzing trace with hash 1884088335, now seen corresponding path program 3 times [2018-06-26 21:26:36,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:36,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:36,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:36,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:36,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:36,131 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:36,194 INFO ]: Checked inductivity of 171 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-26 21:26:36,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:26:36,194 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:26:36,194 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:26:36,194 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:26:36,194 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:36,194 INFO ]: Start difference. First operand 67 states and 206 transitions. Second operand 3 states. [2018-06-26 21:26:36,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:36,269 INFO ]: Finished difference Result 44 states and 93 transitions. [2018-06-26 21:26:36,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:26:36,270 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-26 21:26:36,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:36,270 INFO ]: With dead ends: 44 [2018-06-26 21:26:36,270 INFO ]: Without dead ends: 38 [2018-06-26 21:26:36,270 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:26:36,270 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 21:26:36,272 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-06-26 21:26:36,272 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 21:26:36,272 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2018-06-26 21:26:36,272 INFO ]: Start accepts. Automaton has 35 states and 83 transitions. Word has length 23 [2018-06-26 21:26:36,272 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:36,272 INFO ]: Abstraction has 35 states and 83 transitions. [2018-06-26 21:26:36,272 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:26:36,272 INFO ]: Start isEmpty. Operand 35 states and 83 transitions. [2018-06-26 21:26:36,273 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 21:26:36,273 INFO ]: Found error trace [2018-06-26 21:26:36,273 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:36,273 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:36,273 INFO ]: Analyzing trace with hash -766118893, now seen corresponding path program 1 times [2018-06-26 21:26:36,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:36,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:36,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:36,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:36,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:36,294 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:36,351 INFO ]: Checked inductivity of 190 backedges. 114 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-26 21:26:36,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:36,351 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-26 21:26:36,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:36,448 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:36,453 INFO ]: Computing forward predicates... [2018-06-26 21:26:36,487 INFO ]: Checked inductivity of 190 backedges. 114 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-26 21:26:36,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:36,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:26:36,517 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:26:36,517 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:26:36,517 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:26:36,517 INFO ]: Start difference. First operand 35 states and 83 transitions. Second operand 5 states. [2018-06-26 21:26:36,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:36,624 INFO ]: Finished difference Result 66 states and 148 transitions. [2018-06-26 21:26:36,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:26:36,624 INFO ]: Start accepts. Automaton has 5 states. Word has length 24 [2018-06-26 21:26:36,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:36,625 INFO ]: With dead ends: 66 [2018-06-26 21:26:36,625 INFO ]: Without dead ends: 44 [2018-06-26 21:26:36,625 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:26:36,625 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 21:26:36,627 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-06-26 21:26:36,627 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 21:26:36,627 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 94 transitions. [2018-06-26 21:26:36,627 INFO ]: Start accepts. Automaton has 41 states and 94 transitions. Word has length 24 [2018-06-26 21:26:36,627 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:36,627 INFO ]: Abstraction has 41 states and 94 transitions. [2018-06-26 21:26:36,628 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:26:36,628 INFO ]: Start isEmpty. Operand 41 states and 94 transitions. [2018-06-26 21:26:36,628 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 21:26:36,628 INFO ]: Found error trace [2018-06-26 21:26:36,628 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:36,629 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:36,629 INFO ]: Analyzing trace with hash -1168383247, now seen corresponding path program 2 times [2018-06-26 21:26:36,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:36,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:36,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:36,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:36,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:36,654 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:36,843 INFO ]: Checked inductivity of 325 backedges. 87 proven. 200 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-26 21:26:36,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:36,843 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-26 21:26:36,850 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:26:36,929 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:26:36,929 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:36,935 INFO ]: Computing forward predicates... [2018-06-26 21:26:37,092 INFO ]: Checked inductivity of 325 backedges. 125 proven. 165 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 21:26:37,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:37,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-06-26 21:26:37,112 INFO ]: Interpolant automaton has 11 states [2018-06-26 21:26:37,112 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 21:26:37,112 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-26 21:26:37,112 INFO ]: Start difference. First operand 41 states and 94 transitions. Second operand 11 states. [2018-06-26 21:26:37,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:37,637 INFO ]: Finished difference Result 87 states and 209 transitions. [2018-06-26 21:26:37,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 21:26:37,638 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-26 21:26:37,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:37,638 INFO ]: With dead ends: 87 [2018-06-26 21:26:37,638 INFO ]: Without dead ends: 87 [2018-06-26 21:26:37,639 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2018-06-26 21:26:37,639 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-26 21:26:37,641 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 49. [2018-06-26 21:26:37,641 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 21:26:37,643 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2018-06-26 21:26:37,643 INFO ]: Start accepts. Automaton has 49 states and 114 transitions. Word has length 30 [2018-06-26 21:26:37,643 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:37,643 INFO ]: Abstraction has 49 states and 114 transitions. [2018-06-26 21:26:37,643 INFO ]: Interpolant automaton has 11 states. [2018-06-26 21:26:37,643 INFO ]: Start isEmpty. Operand 49 states and 114 transitions. [2018-06-26 21:26:37,644 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 21:26:37,644 INFO ]: Found error trace [2018-06-26 21:26:37,644 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:37,644 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:37,644 INFO ]: Analyzing trace with hash -1761050349, now seen corresponding path program 3 times [2018-06-26 21:26:37,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:37,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:37,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:37,645 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:37,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:37,672 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:37,790 INFO ]: Checked inductivity of 435 backedges. 236 proven. 102 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-26 21:26:37,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:37,790 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-26 21:26:37,805 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:26:37,911 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-26 21:26:37,911 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:37,917 INFO ]: Computing forward predicates... [2018-06-26 21:26:37,951 INFO ]: Checked inductivity of 435 backedges. 236 proven. 102 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-26 21:26:37,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:37,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:26:37,984 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:26:37,984 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:26:37,984 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:26:37,984 INFO ]: Start difference. First operand 49 states and 114 transitions. Second operand 6 states. [2018-06-26 21:26:38,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:38,149 INFO ]: Finished difference Result 88 states and 199 transitions. [2018-06-26 21:26:38,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:26:38,149 INFO ]: Start accepts. Automaton has 6 states. Word has length 34 [2018-06-26 21:26:38,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:38,150 INFO ]: With dead ends: 88 [2018-06-26 21:26:38,150 INFO ]: Without dead ends: 58 [2018-06-26 21:26:38,150 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:26:38,150 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 21:26:38,152 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-06-26 21:26:38,152 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 21:26:38,152 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 125 transitions. [2018-06-26 21:26:38,152 INFO ]: Start accepts. Automaton has 55 states and 125 transitions. Word has length 34 [2018-06-26 21:26:38,153 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:38,153 INFO ]: Abstraction has 55 states and 125 transitions. [2018-06-26 21:26:38,153 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:26:38,153 INFO ]: Start isEmpty. Operand 55 states and 125 transitions. [2018-06-26 21:26:38,153 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 21:26:38,153 INFO ]: Found error trace [2018-06-26 21:26:38,153 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:38,153 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:38,154 INFO ]: Analyzing trace with hash -1185942927, now seen corresponding path program 4 times [2018-06-26 21:26:38,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:38,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:38,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:38,154 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:38,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:38,182 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:39,203 INFO ]: Checked inductivity of 630 backedges. 153 proven. 418 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-26 21:26:39,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:39,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:26:39,217 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:26:39,350 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 21:26:39,350 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:39,357 INFO ]: Computing forward predicates... [2018-06-26 21:26:39,508 INFO ]: Checked inductivity of 630 backedges. 233 proven. 341 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-26 21:26:39,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:39,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2018-06-26 21:26:39,540 INFO ]: Interpolant automaton has 14 states [2018-06-26 21:26:39,540 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 21:26:39,540 INFO ]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-26 21:26:39,540 INFO ]: Start difference. First operand 55 states and 125 transitions. Second operand 14 states. [2018-06-26 21:26:40,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:40,451 INFO ]: Finished difference Result 111 states and 263 transitions. [2018-06-26 21:26:40,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 21:26:40,451 INFO ]: Start accepts. Automaton has 14 states. Word has length 40 [2018-06-26 21:26:40,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:40,452 INFO ]: With dead ends: 111 [2018-06-26 21:26:40,452 INFO ]: Without dead ends: 111 [2018-06-26 21:26:40,452 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2018-06-26 21:26:40,452 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-26 21:26:40,454 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 63. [2018-06-26 21:26:40,454 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 21:26:40,455 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 145 transitions. [2018-06-26 21:26:40,455 INFO ]: Start accepts. Automaton has 63 states and 145 transitions. Word has length 40 [2018-06-26 21:26:40,455 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:40,455 INFO ]: Abstraction has 63 states and 145 transitions. [2018-06-26 21:26:40,455 INFO ]: Interpolant automaton has 14 states. [2018-06-26 21:26:40,455 INFO ]: Start isEmpty. Operand 63 states and 145 transitions. [2018-06-26 21:26:40,457 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 21:26:40,457 INFO ]: Found error trace [2018-06-26 21:26:40,457 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:40,457 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:40,457 INFO ]: Analyzing trace with hash -697773933, now seen corresponding path program 5 times [2018-06-26 21:26:40,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:40,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:40,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:40,458 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:40,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:40,493 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:40,979 INFO ]: Checked inductivity of 780 backedges. 398 proven. 240 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-26 21:26:40,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:40,979 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) [2018-06-26 21:26:40,992 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:26:41,308 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-06-26 21:26:41,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:41,315 INFO ]: Computing forward predicates... [2018-06-26 21:26:41,340 INFO ]: Checked inductivity of 780 backedges. 398 proven. 240 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-26 21:26:41,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:41,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:26:41,373 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:26:41,373 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:26:41,373 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:26:41,373 INFO ]: Start difference. First operand 63 states and 145 transitions. Second operand 7 states. [2018-06-26 21:26:41,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:41,616 INFO ]: Finished difference Result 110 states and 250 transitions. [2018-06-26 21:26:41,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:26:41,617 INFO ]: Start accepts. Automaton has 7 states. Word has length 44 [2018-06-26 21:26:41,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:41,618 INFO ]: With dead ends: 110 [2018-06-26 21:26:41,618 INFO ]: Without dead ends: 72 [2018-06-26 21:26:41,618 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:26:41,618 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 21:26:41,620 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-06-26 21:26:41,620 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-26 21:26:41,621 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 156 transitions. [2018-06-26 21:26:41,621 INFO ]: Start accepts. Automaton has 69 states and 156 transitions. Word has length 44 [2018-06-26 21:26:41,622 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:41,622 INFO ]: Abstraction has 69 states and 156 transitions. [2018-06-26 21:26:41,622 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:26:41,622 INFO ]: Start isEmpty. Operand 69 states and 156 transitions. [2018-06-26 21:26:41,622 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 21:26:41,623 INFO ]: Found error trace [2018-06-26 21:26:41,623 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:41,623 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:41,623 INFO ]: Analyzing trace with hash -1429166991, now seen corresponding path program 6 times [2018-06-26 21:26:41,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:41,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:41,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:41,623 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:41,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:41,659 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:41,861 INFO ]: Checked inductivity of 1035 backedges. 255 proven. 700 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-26 21:26:41,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:41,861 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-26 21:26:41,868 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 21:26:42,031 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-06-26 21:26:42,032 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:42,040 INFO ]: Computing forward predicates... [2018-06-26 21:26:42,181 INFO ]: Checked inductivity of 1035 backedges. 377 proven. 578 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-26 21:26:42,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:42,216 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-26 21:26:42,216 INFO ]: Interpolant automaton has 16 states [2018-06-26 21:26:42,216 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 21:26:42,216 INFO ]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-26 21:26:42,217 INFO ]: Start difference. First operand 69 states and 156 transitions. Second operand 16 states. [2018-06-26 21:26:43,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:43,150 INFO ]: Finished difference Result 165 states and 385 transitions. [2018-06-26 21:26:43,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 21:26:43,151 INFO ]: Start accepts. Automaton has 16 states. Word has length 50 [2018-06-26 21:26:43,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:43,152 INFO ]: With dead ends: 165 [2018-06-26 21:26:43,152 INFO ]: Without dead ends: 165 [2018-06-26 21:26:43,152 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-06-26 21:26:43,152 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-26 21:26:43,155 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 105. [2018-06-26 21:26:43,155 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-26 21:26:43,155 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 223 transitions. [2018-06-26 21:26:43,155 INFO ]: Start accepts. Automaton has 105 states and 223 transitions. Word has length 50 [2018-06-26 21:26:43,156 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:43,156 INFO ]: Abstraction has 105 states and 223 transitions. [2018-06-26 21:26:43,156 INFO ]: Interpolant automaton has 16 states. [2018-06-26 21:26:43,156 INFO ]: Start isEmpty. Operand 105 states and 223 transitions. [2018-06-26 21:26:43,156 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 21:26:43,156 INFO ]: Found error trace [2018-06-26 21:26:43,156 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:43,156 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:43,157 INFO ]: Analyzing trace with hash 2137618593, now seen corresponding path program 1 times [2018-06-26 21:26:43,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:43,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:43,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:43,157 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:43,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:43,185 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:44,008 INFO ]: Checked inductivity of 1035 backedges. 377 proven. 581 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-26 21:26:44,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:44,008 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-26 21:26:44,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:44,131 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:44,138 INFO ]: Computing forward predicates... [2018-06-26 21:26:44,163 INFO ]: Checked inductivity of 1035 backedges. 377 proven. 581 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-26 21:26:44,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:44,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 21:26:44,193 INFO ]: Interpolant automaton has 13 states [2018-06-26 21:26:44,193 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 21:26:44,193 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-26 21:26:44,193 INFO ]: Start difference. First operand 105 states and 223 transitions. Second operand 13 states. [2018-06-26 21:26:44,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:44,665 INFO ]: Finished difference Result 145 states and 325 transitions. [2018-06-26 21:26:44,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 21:26:44,665 INFO ]: Start accepts. Automaton has 13 states. Word has length 50 [2018-06-26 21:26:44,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:44,666 INFO ]: With dead ends: 145 [2018-06-26 21:26:44,666 INFO ]: Without dead ends: 145 [2018-06-26 21:26:44,666 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2018-06-26 21:26:44,667 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-26 21:26:44,669 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 77. [2018-06-26 21:26:44,669 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 21:26:44,669 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 176 transitions. [2018-06-26 21:26:44,669 INFO ]: Start accepts. Automaton has 77 states and 176 transitions. Word has length 50 [2018-06-26 21:26:44,670 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:44,670 INFO ]: Abstraction has 77 states and 176 transitions. [2018-06-26 21:26:44,673 INFO ]: Interpolant automaton has 13 states. [2018-06-26 21:26:44,673 INFO ]: Start isEmpty. Operand 77 states and 176 transitions. [2018-06-26 21:26:44,673 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 21:26:44,673 INFO ]: Found error trace [2018-06-26 21:26:44,673 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:44,674 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:44,674 INFO ]: Analyzing trace with hash -733969773, now seen corresponding path program 7 times [2018-06-26 21:26:44,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:44,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:44,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:44,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:44,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:44,707 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:45,084 INFO ]: Checked inductivity of 1225 backedges. 600 proven. 438 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-26 21:26:45,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:45,085 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-26 21:26:45,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:45,236 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:45,244 INFO ]: Computing forward predicates... [2018-06-26 21:26:45,286 INFO ]: Checked inductivity of 1225 backedges. 600 proven. 438 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-26 21:26:45,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:45,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 21:26:45,315 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:26:45,315 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:26:45,315 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:26:45,315 INFO ]: Start difference. First operand 77 states and 176 transitions. Second operand 8 states. [2018-06-26 21:26:45,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:45,520 INFO ]: Finished difference Result 132 states and 301 transitions. [2018-06-26 21:26:45,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:26:45,520 INFO ]: Start accepts. Automaton has 8 states. Word has length 54 [2018-06-26 21:26:45,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:45,520 INFO ]: With dead ends: 132 [2018-06-26 21:26:45,520 INFO ]: Without dead ends: 86 [2018-06-26 21:26:45,521 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:26:45,521 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 21:26:45,523 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-06-26 21:26:45,523 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-26 21:26:45,523 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 187 transitions. [2018-06-26 21:26:45,523 INFO ]: Start accepts. Automaton has 83 states and 187 transitions. Word has length 54 [2018-06-26 21:26:45,524 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:45,524 INFO ]: Abstraction has 83 states and 187 transitions. [2018-06-26 21:26:45,524 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:26:45,524 INFO ]: Start isEmpty. Operand 83 states and 187 transitions. [2018-06-26 21:26:45,524 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-26 21:26:45,524 INFO ]: Found error trace [2018-06-26 21:26:45,524 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:45,524 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:45,524 INFO ]: Analyzing trace with hash 831494385, now seen corresponding path program 8 times [2018-06-26 21:26:45,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:45,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:45,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:45,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:45,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:45,563 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:45,833 INFO ]: Checked inductivity of 1540 backedges. 393 proven. 1046 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-26 21:26:45,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:45,833 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:26:45,839 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:26:46,016 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:26:46,016 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:46,025 INFO ]: Computing forward predicates... [2018-06-26 21:26:46,113 INFO ]: Checked inductivity of 1540 backedges. 557 proven. 885 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-26 21:26:46,136 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:46,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 20 [2018-06-26 21:26:46,136 INFO ]: Interpolant automaton has 20 states [2018-06-26 21:26:46,137 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 21:26:46,137 INFO ]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-06-26 21:26:46,137 INFO ]: Start difference. First operand 83 states and 187 transitions. Second operand 20 states. [2018-06-26 21:26:47,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:47,376 INFO ]: Finished difference Result 159 states and 371 transitions. [2018-06-26 21:26:47,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 21:26:47,377 INFO ]: Start accepts. Automaton has 20 states. Word has length 60 [2018-06-26 21:26:47,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:47,378 INFO ]: With dead ends: 159 [2018-06-26 21:26:47,378 INFO ]: Without dead ends: 159 [2018-06-26 21:26:47,379 INFO ]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1615, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 21:26:47,379 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-26 21:26:47,382 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 91. [2018-06-26 21:26:47,382 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-26 21:26:47,382 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 207 transitions. [2018-06-26 21:26:47,382 INFO ]: Start accepts. Automaton has 91 states and 207 transitions. Word has length 60 [2018-06-26 21:26:47,383 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:47,383 INFO ]: Abstraction has 91 states and 207 transitions. [2018-06-26 21:26:47,383 INFO ]: Interpolant automaton has 20 states. [2018-06-26 21:26:47,383 INFO ]: Start isEmpty. Operand 91 states and 207 transitions. [2018-06-26 21:26:47,383 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-26 21:26:47,383 INFO ]: Found error trace [2018-06-26 21:26:47,384 INFO ]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:47,384 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:47,384 INFO ]: Analyzing trace with hash 1097938707, now seen corresponding path program 9 times [2018-06-26 21:26:47,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:47,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:47,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:47,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:47,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:47,422 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:48,184 INFO ]: Checked inductivity of 1770 backedges. 842 proven. 696 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-26 21:26:48,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:48,184 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) [2018-06-26 21:26:48,200 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:26:48,494 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-06-26 21:26:48,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:48,503 INFO ]: Computing forward predicates... [2018-06-26 21:26:48,536 INFO ]: Checked inductivity of 1770 backedges. 842 proven. 696 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-26 21:26:48,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:48,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 21:26:48,570 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:26:48,570 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:26:48,570 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:26:48,570 INFO ]: Start difference. First operand 91 states and 207 transitions. Second operand 9 states. [2018-06-26 21:26:48,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:48,820 INFO ]: Finished difference Result 154 states and 352 transitions. [2018-06-26 21:26:48,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 21:26:48,821 INFO ]: Start accepts. Automaton has 9 states. Word has length 64 [2018-06-26 21:26:48,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:48,821 INFO ]: With dead ends: 154 [2018-06-26 21:26:48,821 INFO ]: Without dead ends: 100 [2018-06-26 21:26:48,821 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:26:48,821 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-26 21:26:48,824 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-06-26 21:26:48,824 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-26 21:26:48,825 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 218 transitions. [2018-06-26 21:26:48,825 INFO ]: Start accepts. Automaton has 97 states and 218 transitions. Word has length 64 [2018-06-26 21:26:48,825 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:48,825 INFO ]: Abstraction has 97 states and 218 transitions. [2018-06-26 21:26:48,825 INFO ]: Interpolant automaton has 9 states. [2018-06-26 21:26:48,825 INFO ]: Start isEmpty. Operand 97 states and 218 transitions. [2018-06-26 21:26:48,825 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-26 21:26:48,825 INFO ]: Found error trace [2018-06-26 21:26:48,826 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:48,826 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:48,826 INFO ]: Analyzing trace with hash -615092239, now seen corresponding path program 10 times [2018-06-26 21:26:48,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:48,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:48,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:48,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:48,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:48,864 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:49,414 INFO ]: Checked inductivity of 2145 backedges. 567 proven. 1456 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-26 21:26:49,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:49,414 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-26 21:26:49,421 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 21:26:49,600 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 21:26:49,600 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:49,609 INFO ]: Computing forward predicates... [2018-06-26 21:26:50,395 INFO ]: Checked inductivity of 2145 backedges. 773 proven. 1253 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-26 21:26:50,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:50,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 23 [2018-06-26 21:26:50,425 INFO ]: Interpolant automaton has 23 states [2018-06-26 21:26:50,425 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 21:26:50,425 INFO ]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-06-26 21:26:50,425 INFO ]: Start difference. First operand 97 states and 218 transitions. Second operand 23 states. [2018-06-26 21:26:51,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:51,578 INFO ]: Finished difference Result 183 states and 425 transitions. [2018-06-26 21:26:51,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 21:26:51,578 INFO ]: Start accepts. Automaton has 23 states. Word has length 70 [2018-06-26 21:26:51,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:51,579 INFO ]: With dead ends: 183 [2018-06-26 21:26:51,579 INFO ]: Without dead ends: 183 [2018-06-26 21:26:51,579 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=472, Invalid=2180, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 21:26:51,579 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-26 21:26:51,582 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 105. [2018-06-26 21:26:51,582 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-26 21:26:51,583 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 238 transitions. [2018-06-26 21:26:51,583 INFO ]: Start accepts. Automaton has 105 states and 238 transitions. Word has length 70 [2018-06-26 21:26:51,583 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:51,583 INFO ]: Abstraction has 105 states and 238 transitions. [2018-06-26 21:26:51,583 INFO ]: Interpolant automaton has 23 states. [2018-06-26 21:26:51,583 INFO ]: Start isEmpty. Operand 105 states and 238 transitions. [2018-06-26 21:26:51,584 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-26 21:26:51,584 INFO ]: Found error trace [2018-06-26 21:26:51,584 INFO ]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:51,584 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:51,584 INFO ]: Analyzing trace with hash 1844743699, now seen corresponding path program 11 times [2018-06-26 21:26:51,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:51,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:51,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:51,585 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:51,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:51,627 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:51,790 INFO ]: Checked inductivity of 2415 backedges. 1124 proven. 1014 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-26 21:26:51,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:51,790 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-26 21:26:51,795 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 21:26:52,107 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-06-26 21:26:52,107 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:52,117 INFO ]: Computing forward predicates... [2018-06-26 21:26:52,145 INFO ]: Checked inductivity of 2415 backedges. 1124 proven. 1014 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-26 21:26:52,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:52,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 21:26:52,165 INFO ]: Interpolant automaton has 10 states [2018-06-26 21:26:52,165 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 21:26:52,165 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 21:26:52,165 INFO ]: Start difference. First operand 105 states and 238 transitions. Second operand 10 states. [2018-06-26 21:26:52,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:52,464 INFO ]: Finished difference Result 176 states and 403 transitions. [2018-06-26 21:26:52,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 21:26:52,464 INFO ]: Start accepts. Automaton has 10 states. Word has length 74 [2018-06-26 21:26:52,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:52,465 INFO ]: With dead ends: 176 [2018-06-26 21:26:52,465 INFO ]: Without dead ends: 114 [2018-06-26 21:26:52,465 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 21:26:52,465 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-26 21:26:52,468 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-06-26 21:26:52,468 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-26 21:26:52,468 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 249 transitions. [2018-06-26 21:26:52,469 INFO ]: Start accepts. Automaton has 111 states and 249 transitions. Word has length 74 [2018-06-26 21:26:52,469 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:52,469 INFO ]: Abstraction has 111 states and 249 transitions. [2018-06-26 21:26:52,469 INFO ]: Interpolant automaton has 10 states. [2018-06-26 21:26:52,469 INFO ]: Start isEmpty. Operand 111 states and 249 transitions. [2018-06-26 21:26:52,469 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-26 21:26:52,469 INFO ]: Found error trace [2018-06-26 21:26:52,469 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:52,469 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:52,470 INFO ]: Analyzing trace with hash -754529935, now seen corresponding path program 12 times [2018-06-26 21:26:52,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:52,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:52,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:52,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:52,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:52,508 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:53,014 INFO ]: Checked inductivity of 2850 backedges. 777 proven. 1930 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-26 21:26:53,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:53,014 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-26 21:26:53,020 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 21:26:53,335 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-06-26 21:26:53,335 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:53,352 INFO ]: Computing forward predicates... [2018-06-26 21:26:53,772 INFO ]: Checked inductivity of 2850 backedges. 1025 proven. 1682 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-26 21:26:53,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:53,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-06-26 21:26:53,793 INFO ]: Interpolant automaton has 25 states [2018-06-26 21:26:53,793 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 21:26:53,793 INFO ]: CoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-26 21:26:53,793 INFO ]: Start difference. First operand 111 states and 249 transitions. Second operand 25 states. [2018-06-26 21:26:55,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:55,127 INFO ]: Finished difference Result 549 states and 1289 transitions. [2018-06-26 21:26:55,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 21:26:55,132 INFO ]: Start accepts. Automaton has 25 states. Word has length 80 [2018-06-26 21:26:55,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:55,135 INFO ]: With dead ends: 549 [2018-06-26 21:26:55,135 INFO ]: Without dead ends: 549 [2018-06-26 21:26:55,136 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=580, Invalid=2282, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 21:26:55,136 INFO ]: Start minimizeSevpa. Operand 549 states. [2018-06-26 21:26:55,144 INFO ]: Finished minimizeSevpa. Reduced states from 549 to 195. [2018-06-26 21:26:55,144 INFO ]: Start removeUnreachable. Operand 195 states. [2018-06-26 21:26:55,145 INFO ]: Finished removeUnreachable. Reduced from 195 states to 195 states and 403 transitions. [2018-06-26 21:26:55,145 INFO ]: Start accepts. Automaton has 195 states and 403 transitions. Word has length 80 [2018-06-26 21:26:55,145 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:55,145 INFO ]: Abstraction has 195 states and 403 transitions. [2018-06-26 21:26:55,145 INFO ]: Interpolant automaton has 25 states. [2018-06-26 21:26:55,145 INFO ]: Start isEmpty. Operand 195 states and 403 transitions. [2018-06-26 21:26:55,146 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-26 21:26:55,146 INFO ]: Found error trace [2018-06-26 21:26:55,146 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:55,146 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:55,146 INFO ]: Analyzing trace with hash 1058679201, now seen corresponding path program 1 times [2018-06-26 21:26:55,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:55,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:55,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:55,147 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:26:55,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:55,183 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:55,486 INFO ]: Checked inductivity of 2850 backedges. 561 proven. 2146 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-26 21:26:55,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:55,513 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-26 21:26:55,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:55,718 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:55,729 INFO ]: Computing forward predicates... [2018-06-26 21:26:55,856 INFO ]: Checked inductivity of 2850 backedges. 1025 proven. 1685 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-06-26 21:26:55,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:55,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 22 [2018-06-26 21:26:55,876 INFO ]: Interpolant automaton has 22 states [2018-06-26 21:26:55,876 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 21:26:55,876 INFO ]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-06-26 21:26:55,876 INFO ]: Start difference. First operand 195 states and 403 transitions. Second operand 22 states. [2018-06-26 21:26:57,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:57,636 INFO ]: Finished difference Result 347 states and 802 transitions. [2018-06-26 21:26:57,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 21:26:57,636 INFO ]: Start accepts. Automaton has 22 states. Word has length 80 [2018-06-26 21:26:57,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:57,638 INFO ]: With dead ends: 347 [2018-06-26 21:26:57,638 INFO ]: Without dead ends: 347 [2018-06-26 21:26:57,639 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=2041, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 21:26:57,639 INFO ]: Start minimizeSevpa. Operand 347 states. [2018-06-26 21:26:57,643 INFO ]: Finished minimizeSevpa. Reduced states from 347 to 119. [2018-06-26 21:26:57,643 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-26 21:26:57,644 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 269 transitions. [2018-06-26 21:26:57,644 INFO ]: Start accepts. Automaton has 119 states and 269 transitions. Word has length 80 [2018-06-26 21:26:57,644 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:57,644 INFO ]: Abstraction has 119 states and 269 transitions. [2018-06-26 21:26:57,644 INFO ]: Interpolant automaton has 22 states. [2018-06-26 21:26:57,644 INFO ]: Start isEmpty. Operand 119 states and 269 transitions. [2018-06-26 21:26:57,645 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-26 21:26:57,645 INFO ]: Found error trace [2018-06-26 21:26:57,645 INFO ]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:57,645 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:57,645 INFO ]: Analyzing trace with hash -86235245, now seen corresponding path program 13 times [2018-06-26 21:26:57,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:57,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:57,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:57,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:57,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:57,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:58,311 INFO ]: Checked inductivity of 3160 backedges. 1446 proven. 1392 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-06-26 21:26:58,311 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:58,311 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-26 21:26:58,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:58,521 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:58,533 INFO ]: Computing forward predicates... [2018-06-26 21:26:58,568 INFO ]: Checked inductivity of 3160 backedges. 1446 proven. 1392 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-06-26 21:26:58,593 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:26:58,593 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 21:26:58,593 INFO ]: Interpolant automaton has 11 states [2018-06-26 21:26:58,593 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 21:26:58,594 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 21:26:58,594 INFO ]: Start difference. First operand 119 states and 269 transitions. Second operand 11 states. [2018-06-26 21:26:59,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:26:59,024 INFO ]: Finished difference Result 198 states and 454 transitions. [2018-06-26 21:26:59,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 21:26:59,024 INFO ]: Start accepts. Automaton has 11 states. Word has length 84 [2018-06-26 21:26:59,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:26:59,025 INFO ]: With dead ends: 198 [2018-06-26 21:26:59,025 INFO ]: Without dead ends: 128 [2018-06-26 21:26:59,025 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 21:26:59,025 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 21:26:59,027 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-06-26 21:26:59,027 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-26 21:26:59,028 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 280 transitions. [2018-06-26 21:26:59,028 INFO ]: Start accepts. Automaton has 125 states and 280 transitions. Word has length 84 [2018-06-26 21:26:59,028 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:26:59,028 INFO ]: Abstraction has 125 states and 280 transitions. [2018-06-26 21:26:59,028 INFO ]: Interpolant automaton has 11 states. [2018-06-26 21:26:59,028 INFO ]: Start isEmpty. Operand 125 states and 280 transitions. [2018-06-26 21:26:59,029 INFO ]: Finished isEmpty. Found accepting run of length 91 [2018-06-26 21:26:59,029 INFO ]: Found error trace [2018-06-26 21:26:59,029 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:26:59,029 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:26:59,030 INFO ]: Analyzing trace with hash 312100209, now seen corresponding path program 14 times [2018-06-26 21:26:59,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:26:59,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:26:59,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:59,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:26:59,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:26:59,072 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:26:59,825 INFO ]: Checked inductivity of 3655 backedges. 1023 proven. 2468 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-26 21:26:59,825 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:26:59,825 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-26 21:26:59,833 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:27:00,101 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:27:00,101 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:00,117 INFO ]: Computing forward predicates... [2018-06-26 21:27:00,462 INFO ]: Checked inductivity of 3655 backedges. 1313 proven. 2181 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-06-26 21:27:00,496 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:27:00,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 29 [2018-06-26 21:27:00,496 INFO ]: Interpolant automaton has 29 states [2018-06-26 21:27:00,497 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 21:27:00,497 INFO ]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2018-06-26 21:27:00,497 INFO ]: Start difference. First operand 125 states and 280 transitions. Second operand 29 states. [2018-06-26 21:27:02,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:27:02,050 INFO ]: Finished difference Result 231 states and 533 transitions. [2018-06-26 21:27:02,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-26 21:27:02,050 INFO ]: Start accepts. Automaton has 29 states. Word has length 90 [2018-06-26 21:27:02,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:27:02,051 INFO ]: With dead ends: 231 [2018-06-26 21:27:02,051 INFO ]: Without dead ends: 231 [2018-06-26 21:27:02,055 INFO ]: 0 DeclaredPredicates, 211 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=3562, Unknown=0, NotChecked=0, Total=4290 [2018-06-26 21:27:02,055 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-26 21:27:02,062 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 133. [2018-06-26 21:27:02,062 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 21:27:02,062 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 300 transitions. [2018-06-26 21:27:02,062 INFO ]: Start accepts. Automaton has 133 states and 300 transitions. Word has length 90 [2018-06-26 21:27:02,062 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:27:02,062 INFO ]: Abstraction has 133 states and 300 transitions. [2018-06-26 21:27:02,062 INFO ]: Interpolant automaton has 29 states. [2018-06-26 21:27:02,062 INFO ]: Start isEmpty. Operand 133 states and 300 transitions. [2018-06-26 21:27:02,063 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-26 21:27:02,063 INFO ]: Found error trace [2018-06-26 21:27:02,063 INFO ]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:27:02,063 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:27:02,064 INFO ]: Analyzing trace with hash 206676883, now seen corresponding path program 15 times [2018-06-26 21:27:02,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:27:02,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:27:02,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:27:02,064 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:27:02,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:27:02,150 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:02,918 INFO ]: Checked inductivity of 4005 backedges. 1808 proven. 1830 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-06-26 21:27:02,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:27:02,918 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-26 21:27:02,924 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:27:03,410 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-06-26 21:27:03,411 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:03,423 INFO ]: Computing forward predicates... [2018-06-26 21:27:03,461 INFO ]: Checked inductivity of 4005 backedges. 1808 proven. 1830 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-06-26 21:27:03,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:27:03,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 21:27:03,483 INFO ]: Interpolant automaton has 12 states [2018-06-26 21:27:03,483 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 21:27:03,483 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 21:27:03,483 INFO ]: Start difference. First operand 133 states and 300 transitions. Second operand 12 states. [2018-06-26 21:27:03,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:27:03,879 INFO ]: Finished difference Result 220 states and 505 transitions. [2018-06-26 21:27:03,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 21:27:03,879 INFO ]: Start accepts. Automaton has 12 states. Word has length 94 [2018-06-26 21:27:03,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:27:03,879 INFO ]: With dead ends: 220 [2018-06-26 21:27:03,879 INFO ]: Without dead ends: 142 [2018-06-26 21:27:03,880 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 21:27:03,880 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-26 21:27:03,882 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 139. [2018-06-26 21:27:03,882 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-26 21:27:03,882 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 311 transitions. [2018-06-26 21:27:03,883 INFO ]: Start accepts. Automaton has 139 states and 311 transitions. Word has length 94 [2018-06-26 21:27:03,883 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:27:03,883 INFO ]: Abstraction has 139 states and 311 transitions. [2018-06-26 21:27:03,883 INFO ]: Interpolant automaton has 12 states. [2018-06-26 21:27:03,883 INFO ]: Start isEmpty. Operand 139 states and 311 transitions. [2018-06-26 21:27:03,884 INFO ]: Finished isEmpty. Found accepting run of length 101 [2018-06-26 21:27:03,884 INFO ]: Found error trace [2018-06-26 21:27:03,884 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:27:03,884 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:27:03,884 INFO ]: Analyzing trace with hash 354583537, now seen corresponding path program 16 times [2018-06-26 21:27:03,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:27:03,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:27:03,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:27:03,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:27:03,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:27:03,934 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:04,250 INFO ]: Checked inductivity of 4560 backedges. 1305 proven. 3070 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-06-26 21:27:04,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:27:04,250 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-26 21:27:04,258 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 21:27:04,503 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 21:27:04,503 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:04,517 INFO ]: Computing forward predicates... [2018-06-26 21:27:04,823 INFO ]: Checked inductivity of 4560 backedges. 1637 proven. 2741 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-26 21:27:04,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:27:04,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 32 [2018-06-26 21:27:04,844 INFO ]: Interpolant automaton has 32 states [2018-06-26 21:27:04,844 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 21:27:04,844 INFO ]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2018-06-26 21:27:04,844 INFO ]: Start difference. First operand 139 states and 311 transitions. Second operand 32 states. [2018-06-26 21:27:06,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:27:06,500 INFO ]: Finished difference Result 255 states and 587 transitions. [2018-06-26 21:27:06,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-26 21:27:06,500 INFO ]: Start accepts. Automaton has 32 states. Word has length 100 [2018-06-26 21:27:06,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:27:06,501 INFO ]: With dead ends: 255 [2018-06-26 21:27:06,501 INFO ]: Without dead ends: 255 [2018-06-26 21:27:06,502 INFO ]: 0 DeclaredPredicates, 235 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=877, Invalid=4379, Unknown=0, NotChecked=0, Total=5256 [2018-06-26 21:27:06,502 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-26 21:27:06,506 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 147. [2018-06-26 21:27:06,506 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-26 21:27:06,506 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 331 transitions. [2018-06-26 21:27:06,506 INFO ]: Start accepts. Automaton has 147 states and 331 transitions. Word has length 100 [2018-06-26 21:27:06,507 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:27:06,507 INFO ]: Abstraction has 147 states and 331 transitions. [2018-06-26 21:27:06,507 INFO ]: Interpolant automaton has 32 states. [2018-06-26 21:27:06,507 INFO ]: Start isEmpty. Operand 147 states and 331 transitions. [2018-06-26 21:27:06,507 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-26 21:27:06,507 INFO ]: Found error trace [2018-06-26 21:27:06,508 INFO ]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:27:06,508 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:27:06,508 INFO ]: Analyzing trace with hash -74014189, now seen corresponding path program 17 times [2018-06-26 21:27:06,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:27:06,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:27:06,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:27:06,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:27:06,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:27:06,556 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:06,743 INFO ]: Checked inductivity of 4950 backedges. 2210 proven. 2328 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-06-26 21:27:06,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:27:06,743 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-26 21:27:06,749 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 21:27:07,299 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-06-26 21:27:07,299 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:27:07,316 INFO ]: Computing forward predicates... [2018-06-26 21:27:07,358 INFO ]: Checked inductivity of 4950 backedges. 2210 proven. 2328 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-06-26 21:27:07,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:27:07,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 21:27:07,392 INFO ]: Interpolant automaton has 13 states [2018-06-26 21:27:07,392 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 21:27:07,393 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 21:27:07,393 INFO ]: Start difference. First operand 147 states and 331 transitions. Second operand 13 states. Received shutdown request... [2018-06-26 21:27:10,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 21:27:10,579 WARN ]: Verification canceled [2018-06-26 21:27:10,583 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:27:10,584 WARN ]: Timeout [2018-06-26 21:27:10,584 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:27:10 BasicIcfg [2018-06-26 21:27:10,584 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:27:10,587 INFO ]: Toolchain (without parser) took 53707.67 ms. Allocated memory was 308.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 263.3 MB in the beginning and 1.2 GB in the end (delta: -896.0 MB). Peak memory consumption was 681.6 MB. Max. memory is 3.6 GB. [2018-06-26 21:27:10,588 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:27:10,588 INFO ]: ChcToBoogie took 55.64 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:27:10,588 INFO ]: Boogie Preprocessor took 45.89 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 259.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-26 21:27:10,589 INFO ]: RCFGBuilder took 218.69 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 250.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:27:10,589 INFO ]: BlockEncodingV2 took 10217.58 ms. Allocated memory was 308.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 250.3 MB in the beginning and 1.1 GB in the end (delta: -849.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 21:27:10,589 INFO ]: TraceAbstraction took 43156.37 ms. Allocated memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.5 MB). Peak memory consumption was 33.3 MB. Max. memory is 3.6 GB. [2018-06-26 21:27:10,593 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 86 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.64 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.89 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 259.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 218.69 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 250.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 10217.58 ms. Allocated memory was 308.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 250.3 MB in the beginning and 1.1 GB in the end (delta: -849.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. * TraceAbstraction took 43156.37 ms. Allocated memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.5 MB). Peak memory consumption was 33.3 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 Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 12 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 43.0s OverallTime, 32 OverallIterations, 10 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 221 SDtfs, 70 SDslu, 1079 SDs, 0 SdLazy, 18175 SolverSat, 8724 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2713 GetRequests, 2178 SyntacticMatches, 0 SemanticMatches, 535 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6519 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 1452 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2653 NumberOfCodeBlocks, 2638 NumberOfCodeBlocksAsserted, 309 NumberOfCheckSat, 2600 ConstructedInterpolants, 0 QuantifiedInterpolants, 597704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 33777 ConjunctsInSsa, 2373 ConjunctsInUnsatCore, 53 InterpolantComputations, 11 PerfectInterpolantSequences, 37616/79974 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/down.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-27-10-609.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/down.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-27-10-609.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/down.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-27-10-609.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/down.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-27-10-609.csv Completed graceful shutdown