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/cav12/mem_slave_tlm.5.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:54:38,136 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:54:38,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:54:38,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:54:38,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:54:38,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:54:38,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:54:38,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:54:38,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:54:38,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:54:38,157 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:54:38,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:54:38,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:54:38,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:54:38,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:54:38,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:54:38,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:54:38,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:54:38,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:54:38,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:54:38,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:54:38,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:54:38,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:54:38,187 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:54:38,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:54:38,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:54:38,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:54:38,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:54:38,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:54:38,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:54:38,197 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:54:38,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:54:38,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:54:38,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:54:38,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:54:38,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 23:54:38,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:54:38,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:54:38,226 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:54:38,226 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:54:38,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:54:38,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:54:38,228 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:54:38,228 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:54:38,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:54:38,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:54:38,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:54:38,229 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:54:38,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:54:38,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:54:38,230 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:54:38,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:54:38,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:54:38,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:54:38,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:54:38,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:54:38,232 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:54:38,233 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:54:38,233 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:54:38,278 INFO ]: Repository-Root is: /tmp [2018-06-24 23:54:38,293 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:54:38,299 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:54:38,300 INFO ]: Initializing SmtParser... [2018-06-24 23:54:38,301 INFO ]: SmtParser initialized [2018-06-24 23:54:38,301 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 [2018-06-24 23:54:38,302 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-24 23:54:38,388 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 unknown [2018-06-24 23:54:39,423 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.5.smt2 [2018-06-24 23:54:39,428 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:54:39,433 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:54:39,434 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:54:39,434 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:54:39,434 INFO ]: ChcToBoogie initialized [2018-06-24 23:54:39,437 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,526 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39 Unit [2018-06-24 23:54:39,526 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:54:39,527 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:54:39,527 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:54:39,527 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:54:39,543 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,543 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,559 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,559 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,587 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,589 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,600 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... [2018-06-24 23:54:39,616 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:54:39,616 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:54:39,616 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:54:39,616 INFO ]: RCFGBuilder initialized [2018-06-24 23:54:39,617 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 23:54:39,635 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:54:39,635 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:54:39,635 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:54:39,635 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:54:39,635 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:54:39,635 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:54:40,352 INFO ]: Using library mode [2018-06-24 23:54:40,353 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:54:40 BoogieIcfgContainer [2018-06-24 23:54:40,353 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:54:40,353 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:54:40,353 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:54:40,354 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:54:40,355 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:54:40" (1/1) ... [2018-06-24 23:54:40,374 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:54:40,375 INFO ]: Using Remove infeasible edges [2018-06-24 23:54:40,376 INFO ]: Using Maximize final states [2018-06-24 23:54:40,376 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:54:40,376 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:54:40,380 INFO ]: Using Remove sink states [2018-06-24 23:54:40,380 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:54:40,380 INFO ]: Using Use SBE [2018-06-24 23:54:40,441 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 23:54:48,286 INFO ]: SBE split 1 edges [2018-06-24 23:54:48,296 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:54:48,297 INFO ]: 0 new accepting states [2018-06-24 23:54:48,354 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:54:48,356 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:54:48,366 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:54:48,367 INFO ]: 0 new accepting states [2018-06-24 23:54:48,367 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:54:48,367 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:54:48,375 INFO ]: Encoded RCFG 6 locations, 117 edges [2018-06-24 23:54:48,375 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:54:48 BasicIcfg [2018-06-24 23:54:48,375 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:54:48,377 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:54:48,377 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:54:48,380 INFO ]: TraceAbstraction initialized [2018-06-24 23:54:48,381 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:54:39" (1/4) ... [2018-06-24 23:54:48,381 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3b230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:54:48, skipping insertion in model container [2018-06-24 23:54:48,381 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:39" (2/4) ... [2018-06-24 23:54:48,382 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3b230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:54:48, skipping insertion in model container [2018-06-24 23:54:48,382 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:54:40" (3/4) ... [2018-06-24 23:54:48,383 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3b230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:54:48, skipping insertion in model container [2018-06-24 23:54:48,383 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:54:48" (4/4) ... [2018-06-24 23:54:48,384 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:54:48,393 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:54:48,400 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:54:48,442 INFO ]: Using default assertion order modulation [2018-06-24 23:54:48,443 INFO ]: Interprodecural is true [2018-06-24 23:54:48,443 INFO ]: Hoare is false [2018-06-24 23:54:48,443 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:54:48,443 INFO ]: Backedges is TWOTRACK [2018-06-24 23:54:48,443 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:54:48,443 INFO ]: Difference is false [2018-06-24 23:54:48,443 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:54:48,443 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:54:48,454 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:54:48,467 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:54:48,467 INFO ]: Found error trace [2018-06-24 23:54:48,468 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:54:48,468 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:48,473 INFO ]: Analyzing trace with hash 38846786, now seen corresponding path program 1 times [2018-06-24 23:54:48,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:48,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:48,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:48,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:48,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:48,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:48,726 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:48,730 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:48,730 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:48,731 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:48,746 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:48,746 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:48,749 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:54:50,547 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:50,547 INFO ]: Finished difference Result 7 states and 180 transitions. [2018-06-24 23:54:50,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:50,549 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:54:50,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:50,559 INFO ]: With dead ends: 7 [2018-06-24 23:54:50,559 INFO ]: Without dead ends: 7 [2018-06-24 23:54:50,561 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-24 23:54:50,578 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:54:50,596 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:54:50,597 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:54:50,599 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2018-06-24 23:54:50,600 INFO ]: Start accepts. Automaton has 7 states and 180 transitions. Word has length 5 [2018-06-24 23:54:50,600 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:50,601 INFO ]: Abstraction has 7 states and 180 transitions. [2018-06-24 23:54:50,601 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:50,601 INFO ]: Start isEmpty. Operand 7 states and 180 transitions. [2018-06-24 23:54:50,601 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:54:50,601 INFO ]: Found error trace [2018-06-24 23:54:50,601 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:54:50,601 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:50,601 INFO ]: Analyzing trace with hash 1201232024, now seen corresponding path program 1 times [2018-06-24 23:54:50,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:50,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:50,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:50,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:50,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:50,642 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:50,730 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:50,730 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:50,731 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:50,732 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:50,732 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:50,732 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:50,732 INFO ]: Start difference. First operand 7 states and 180 transitions. Second operand 3 states. [2018-06-24 23:54:51,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:51,530 INFO ]: Finished difference Result 9 states and 297 transitions. [2018-06-24 23:54:51,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:51,531 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:54:51,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:51,532 INFO ]: With dead ends: 9 [2018-06-24 23:54:51,532 INFO ]: Without dead ends: 9 [2018-06-24 23:54:51,533 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-24 23:54:51,533 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:54:51,538 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:54:51,538 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:54:51,539 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 297 transitions. [2018-06-24 23:54:51,539 INFO ]: Start accepts. Automaton has 9 states and 297 transitions. Word has length 6 [2018-06-24 23:54:51,539 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:51,539 INFO ]: Abstraction has 9 states and 297 transitions. [2018-06-24 23:54:51,539 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:51,539 INFO ]: Start isEmpty. Operand 9 states and 297 transitions. [2018-06-24 23:54:51,540 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:54:51,540 INFO ]: Found error trace [2018-06-24 23:54:51,540 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:54:51,540 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:51,540 INFO ]: Analyzing trace with hash 1202900320, now seen corresponding path program 1 times [2018-06-24 23:54:51,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:51,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:51,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:51,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:51,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:51,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:51,637 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:51,637 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:51,637 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:51,637 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:51,637 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:51,637 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:51,637 INFO ]: Start difference. First operand 9 states and 297 transitions. Second operand 3 states. [2018-06-24 23:54:52,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:52,352 INFO ]: Finished difference Result 13 states and 369 transitions. [2018-06-24 23:54:52,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:52,352 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:54:52,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:52,353 INFO ]: With dead ends: 13 [2018-06-24 23:54:52,353 INFO ]: Without dead ends: 13 [2018-06-24 23:54:52,354 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-24 23:54:52,354 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:54:52,360 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:54:52,360 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:54:52,361 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 369 transitions. [2018-06-24 23:54:52,361 INFO ]: Start accepts. Automaton has 13 states and 369 transitions. Word has length 6 [2018-06-24 23:54:52,361 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:52,361 INFO ]: Abstraction has 13 states and 369 transitions. [2018-06-24 23:54:52,361 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:52,361 INFO ]: Start isEmpty. Operand 13 states and 369 transitions. [2018-06-24 23:54:52,362 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:54:52,362 INFO ]: Found error trace [2018-06-24 23:54:52,362 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:52,362 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:52,362 INFO ]: Analyzing trace with hash -1391855423, now seen corresponding path program 1 times [2018-06-24 23:54:52,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:52,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:52,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:52,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:52,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:52,408 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:52,490 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:52,490 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:52,490 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:52,490 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:52,491 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:52,491 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:52,491 INFO ]: Start difference. First operand 13 states and 369 transitions. Second operand 3 states. [2018-06-24 23:54:53,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:53,155 INFO ]: Finished difference Result 20 states and 628 transitions. [2018-06-24 23:54:53,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:53,155 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:54:53,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:53,156 INFO ]: With dead ends: 20 [2018-06-24 23:54:53,156 INFO ]: Without dead ends: 20 [2018-06-24 23:54:53,156 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-24 23:54:53,156 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:54:53,162 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:54:53,162 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:54:53,163 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 628 transitions. [2018-06-24 23:54:53,163 INFO ]: Start accepts. Automaton has 20 states and 628 transitions. Word has length 7 [2018-06-24 23:54:53,163 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:53,163 INFO ]: Abstraction has 20 states and 628 transitions. [2018-06-24 23:54:53,163 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:53,163 INFO ]: Start isEmpty. Operand 20 states and 628 transitions. [2018-06-24 23:54:53,163 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:54:53,164 INFO ]: Found error trace [2018-06-24 23:54:53,164 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:53,164 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:53,164 INFO ]: Analyzing trace with hash -1367843877, now seen corresponding path program 1 times [2018-06-24 23:54:53,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:53,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:53,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:53,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:53,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:53,224 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:53,324 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:53,324 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:53,324 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:53,324 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:53,324 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:53,324 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:53,325 INFO ]: Start difference. First operand 20 states and 628 transitions. Second operand 3 states. [2018-06-24 23:54:53,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:53,885 INFO ]: Finished difference Result 20 states and 372 transitions. [2018-06-24 23:54:53,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:53,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:54:53,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:53,903 INFO ]: With dead ends: 20 [2018-06-24 23:54:53,903 INFO ]: Without dead ends: 20 [2018-06-24 23:54:53,904 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-24 23:54:53,904 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:54:53,909 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:54:53,910 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:54:53,911 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 372 transitions. [2018-06-24 23:54:53,911 INFO ]: Start accepts. Automaton has 20 states and 372 transitions. Word has length 7 [2018-06-24 23:54:53,911 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:53,911 INFO ]: Abstraction has 20 states and 372 transitions. [2018-06-24 23:54:53,911 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:53,911 INFO ]: Start isEmpty. Operand 20 states and 372 transitions. [2018-06-24 23:54:53,911 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:54:53,911 INFO ]: Found error trace [2018-06-24 23:54:53,911 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:53,911 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:53,912 INFO ]: Analyzing trace with hash 790044747, now seen corresponding path program 1 times [2018-06-24 23:54:53,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:53,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:53,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:53,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:53,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:53,960 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:54,025 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:54:54,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:54,025 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:54,025 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:54,025 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:54,025 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:54,025 INFO ]: Start difference. First operand 20 states and 372 transitions. Second operand 3 states. [2018-06-24 23:54:54,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:54,754 INFO ]: Finished difference Result 31 states and 527 transitions. [2018-06-24 23:54:54,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:54,754 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:54:54,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:54,755 INFO ]: With dead ends: 31 [2018-06-24 23:54:54,755 INFO ]: Without dead ends: 31 [2018-06-24 23:54:54,756 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-24 23:54:54,756 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:54:54,760 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:54:54,760 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:54:54,761 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 527 transitions. [2018-06-24 23:54:54,761 INFO ]: Start accepts. Automaton has 31 states and 527 transitions. Word has length 8 [2018-06-24 23:54:54,761 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:54,761 INFO ]: Abstraction has 31 states and 527 transitions. [2018-06-24 23:54:54,761 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:54,761 INFO ]: Start isEmpty. Operand 31 states and 527 transitions. [2018-06-24 23:54:54,762 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:54:54,762 INFO ]: Found error trace [2018-06-24 23:54:54,762 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:54,762 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:54,762 INFO ]: Analyzing trace with hash 639540615, now seen corresponding path program 1 times [2018-06-24 23:54:54,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:54,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:54,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:54,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:54,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:54,793 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:54,878 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:54:54,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:54,879 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:54,879 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:54,879 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:54,879 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:54,879 INFO ]: Start difference. First operand 31 states and 527 transitions. Second operand 3 states. [2018-06-24 23:54:55,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:55,539 INFO ]: Finished difference Result 31 states and 343 transitions. [2018-06-24 23:54:55,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:55,541 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:54:55,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:55,542 INFO ]: With dead ends: 31 [2018-06-24 23:54:55,542 INFO ]: Without dead ends: 31 [2018-06-24 23:54:55,542 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-24 23:54:55,542 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:54:55,546 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:54:55,546 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:54:55,547 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 343 transitions. [2018-06-24 23:54:55,547 INFO ]: Start accepts. Automaton has 31 states and 343 transitions. Word has length 8 [2018-06-24 23:54:55,548 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:55,548 INFO ]: Abstraction has 31 states and 343 transitions. [2018-06-24 23:54:55,548 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:55,548 INFO ]: Start isEmpty. Operand 31 states and 343 transitions. [2018-06-24 23:54:55,548 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:54:55,548 INFO ]: Found error trace [2018-06-24 23:54:55,548 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:55,548 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:55,548 INFO ]: Analyzing trace with hash 896999775, now seen corresponding path program 1 times [2018-06-24 23:54:55,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:55,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:55,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:55,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,585 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:55,639 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:54:55,639 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:55,639 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:55,639 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:55,639 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:55,639 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,639 INFO ]: Start difference. First operand 31 states and 343 transitions. Second operand 3 states. [2018-06-24 23:54:56,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:56,508 INFO ]: Finished difference Result 31 states and 223 transitions. [2018-06-24 23:54:56,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:56,508 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:54:56,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:56,509 INFO ]: With dead ends: 31 [2018-06-24 23:54:56,509 INFO ]: Without dead ends: 31 [2018-06-24 23:54:56,509 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-24 23:54:56,509 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:54:56,512 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:54:56,512 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:54:56,513 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 223 transitions. [2018-06-24 23:54:56,513 INFO ]: Start accepts. Automaton has 31 states and 223 transitions. Word has length 9 [2018-06-24 23:54:56,513 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:56,513 INFO ]: Abstraction has 31 states and 223 transitions. [2018-06-24 23:54:56,513 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:56,513 INFO ]: Start isEmpty. Operand 31 states and 223 transitions. [2018-06-24 23:54:56,514 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:54:56,514 INFO ]: Found error trace [2018-06-24 23:54:56,514 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:56,514 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:56,514 INFO ]: Analyzing trace with hash 1282091540, now seen corresponding path program 1 times [2018-06-24 23:54:56,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:56,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:56,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:56,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:56,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:56,559 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:56,742 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 23:54:56,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:56,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:56,742 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:56,742 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:56,742 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:56,742 INFO ]: Start difference. First operand 31 states and 223 transitions. Second operand 3 states. [2018-06-24 23:54:57,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:57,684 INFO ]: Finished difference Result 55 states and 426 transitions. [2018-06-24 23:54:57,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:57,685 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:54:57,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:57,686 INFO ]: With dead ends: 55 [2018-06-24 23:54:57,686 INFO ]: Without dead ends: 55 [2018-06-24 23:54:57,686 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,686 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 23:54:57,692 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-24 23:54:57,692 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 23:54:57,694 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 426 transitions. [2018-06-24 23:54:57,694 INFO ]: Start accepts. Automaton has 55 states and 426 transitions. Word has length 10 [2018-06-24 23:54:57,695 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:57,695 INFO ]: Abstraction has 55 states and 426 transitions. [2018-06-24 23:54:57,695 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:57,695 INFO ]: Start isEmpty. Operand 55 states and 426 transitions. [2018-06-24 23:54:57,695 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:54:57,695 INFO ]: Found error trace [2018-06-24 23:54:57,696 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:57,696 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:57,696 INFO ]: Analyzing trace with hash -1640202017, now seen corresponding path program 1 times [2018-06-24 23:54:57,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:57,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:57,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:57,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:57,797 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:54:57,797 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:57,797 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:57,797 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:57,797 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:57,797 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,797 INFO ]: Start difference. First operand 55 states and 426 transitions. Second operand 3 states. [2018-06-24 23:54:58,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:58,395 INFO ]: Finished difference Result 55 states and 288 transitions. [2018-06-24 23:54:58,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:58,396 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:54:58,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:58,397 INFO ]: With dead ends: 55 [2018-06-24 23:54:58,397 INFO ]: Without dead ends: 55 [2018-06-24 23:54:58,397 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-24 23:54:58,398 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 23:54:58,405 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-06-24 23:54:58,405 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 23:54:58,410 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 282 transitions. [2018-06-24 23:54:58,411 INFO ]: Start accepts. Automaton has 54 states and 282 transitions. Word has length 10 [2018-06-24 23:54:58,411 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:58,411 INFO ]: Abstraction has 54 states and 282 transitions. [2018-06-24 23:54:58,411 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:58,411 INFO ]: Start isEmpty. Operand 54 states and 282 transitions. [2018-06-24 23:54:58,412 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:54:58,412 INFO ]: Found error trace [2018-06-24 23:54:58,412 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:58,412 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:58,412 INFO ]: Analyzing trace with hash 1382156419, now seen corresponding path program 1 times [2018-06-24 23:54:58,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:58,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:58,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:58,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:58,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:58,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:58,586 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 23:54:58,586 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:58,586 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:58,586 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:58,586 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:58,586 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:58,587 INFO ]: Start difference. First operand 54 states and 282 transitions. Second operand 3 states. [2018-06-24 23:54:59,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:59,649 INFO ]: Finished difference Result 101 states and 463 transitions. [2018-06-24 23:54:59,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:59,652 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:54:59,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:59,654 INFO ]: With dead ends: 101 [2018-06-24 23:54:59,654 INFO ]: Without dead ends: 101 [2018-06-24 23:54:59,654 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-24 23:54:59,654 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-24 23:54:59,667 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-06-24 23:54:59,667 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-24 23:54:59,669 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 461 transitions. [2018-06-24 23:54:59,669 INFO ]: Start accepts. Automaton has 100 states and 461 transitions. Word has length 11 [2018-06-24 23:54:59,669 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:59,669 INFO ]: Abstraction has 100 states and 461 transitions. [2018-06-24 23:54:59,669 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:59,669 INFO ]: Start isEmpty. Operand 100 states and 461 transitions. [2018-06-24 23:54:59,670 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 23:54:59,670 INFO ]: Found error trace [2018-06-24 23:54:59,670 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:59,670 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:59,670 INFO ]: Analyzing trace with hash 1271683694, now seen corresponding path program 1 times [2018-06-24 23:54:59,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:59,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:59,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:59,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:59,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:59,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:59,850 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 23:54:59,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:59,850 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:59,850 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:59,850 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:59,850 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:59,850 INFO ]: Start difference. First operand 100 states and 461 transitions. Second operand 3 states. [2018-06-24 23:55:00,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:00,716 INFO ]: Finished difference Result 184 states and 754 transitions. [2018-06-24 23:55:00,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:00,716 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 23:55:00,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:00,718 INFO ]: With dead ends: 184 [2018-06-24 23:55:00,718 INFO ]: Without dead ends: 176 [2018-06-24 23:55:00,718 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-24 23:55:00,719 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-24 23:55:00,731 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-06-24 23:55:00,731 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-24 23:55:00,733 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 740 transitions. [2018-06-24 23:55:00,733 INFO ]: Start accepts. Automaton has 175 states and 740 transitions. Word has length 12 [2018-06-24 23:55:00,733 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:00,733 INFO ]: Abstraction has 175 states and 740 transitions. [2018-06-24 23:55:00,733 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:00,734 INFO ]: Start isEmpty. Operand 175 states and 740 transitions. [2018-06-24 23:55:00,735 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 23:55:00,735 INFO ]: Found error trace [2018-06-24 23:55:00,735 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:00,735 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:00,735 INFO ]: Analyzing trace with hash 2134516026, now seen corresponding path program 1 times [2018-06-24 23:55:00,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:00,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:00,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:00,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:00,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:00,774 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:00,872 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 23:55:00,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:00,872 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:00,873 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:00,873 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:00,873 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:00,873 INFO ]: Start difference. First operand 175 states and 740 transitions. Second operand 3 states. [2018-06-24 23:55:01,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:01,422 INFO ]: Finished difference Result 294 states and 1138 transitions. [2018-06-24 23:55:01,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:01,423 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 23:55:01,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:01,425 INFO ]: With dead ends: 294 [2018-06-24 23:55:01,425 INFO ]: Without dead ends: 294 [2018-06-24 23:55:01,425 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-24 23:55:01,425 INFO ]: Start minimizeSevpa. Operand 294 states. [2018-06-24 23:55:01,453 INFO ]: Finished minimizeSevpa. Reduced states from 294 to 290. [2018-06-24 23:55:01,453 INFO ]: Start removeUnreachable. Operand 290 states. [2018-06-24 23:55:01,463 INFO ]: Finished removeUnreachable. Reduced from 290 states to 290 states and 1134 transitions. [2018-06-24 23:55:01,463 INFO ]: Start accepts. Automaton has 290 states and 1134 transitions. Word has length 13 [2018-06-24 23:55:01,463 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:01,463 INFO ]: Abstraction has 290 states and 1134 transitions. [2018-06-24 23:55:01,463 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:01,463 INFO ]: Start isEmpty. Operand 290 states and 1134 transitions. [2018-06-24 23:55:01,472 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 23:55:01,472 INFO ]: Found error trace [2018-06-24 23:55:01,472 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:01,473 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:01,473 INFO ]: Analyzing trace with hash 450883923, now seen corresponding path program 1 times [2018-06-24 23:55:01,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:01,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:01,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:01,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:01,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:01,512 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:01,599 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 23:55:01,599 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:01,599 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:01,599 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:01,599 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:01,599 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:01,599 INFO ]: Start difference. First operand 290 states and 1134 transitions. Second operand 3 states. [2018-06-24 23:55:02,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:02,116 INFO ]: Finished difference Result 264 states and 748 transitions. [2018-06-24 23:55:02,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:02,117 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 23:55:02,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:02,119 INFO ]: With dead ends: 264 [2018-06-24 23:55:02,119 INFO ]: Without dead ends: 249 [2018-06-24 23:55:02,119 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-24 23:55:02,119 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-24 23:55:02,129 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-06-24 23:55:02,129 INFO ]: Start removeUnreachable. Operand 249 states. [2018-06-24 23:55:02,131 INFO ]: Finished removeUnreachable. Reduced from 249 states to 249 states and 733 transitions. [2018-06-24 23:55:02,131 INFO ]: Start accepts. Automaton has 249 states and 733 transitions. Word has length 13 [2018-06-24 23:55:02,131 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:02,131 INFO ]: Abstraction has 249 states and 733 transitions. [2018-06-24 23:55:02,131 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:02,131 INFO ]: Start isEmpty. Operand 249 states and 733 transitions. [2018-06-24 23:55:02,133 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 23:55:02,133 INFO ]: Found error trace [2018-06-24 23:55:02,133 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:02,133 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:02,133 INFO ]: Analyzing trace with hash 659936970, now seen corresponding path program 1 times [2018-06-24 23:55:02,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:02,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:02,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:02,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:02,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:02,177 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:02,289 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 23:55:02,289 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:02,289 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:02,289 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:02,289 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:02,289 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:02,290 INFO ]: Start difference. First operand 249 states and 733 transitions. Second operand 3 states. [2018-06-24 23:55:03,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:03,483 INFO ]: Finished difference Result 347 states and 1013 transitions. [2018-06-24 23:55:03,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:03,484 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 23:55:03,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:03,485 INFO ]: With dead ends: 347 [2018-06-24 23:55:03,485 INFO ]: Without dead ends: 347 [2018-06-24 23:55:03,485 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-24 23:55:03,486 INFO ]: Start minimizeSevpa. Operand 347 states. [2018-06-24 23:55:03,497 INFO ]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-06-24 23:55:03,497 INFO ]: Start removeUnreachable. Operand 347 states. [2018-06-24 23:55:03,499 INFO ]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1013 transitions. [2018-06-24 23:55:03,500 INFO ]: Start accepts. Automaton has 347 states and 1013 transitions. Word has length 13 [2018-06-24 23:55:03,500 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:03,500 INFO ]: Abstraction has 347 states and 1013 transitions. [2018-06-24 23:55:03,500 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:03,500 INFO ]: Start isEmpty. Operand 347 states and 1013 transitions. [2018-06-24 23:55:03,501 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 23:55:03,501 INFO ]: Found error trace [2018-06-24 23:55:03,501 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:03,501 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:03,502 INFO ]: Analyzing trace with hash 999002225, now seen corresponding path program 1 times [2018-06-24 23:55:03,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:03,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:03,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:03,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:03,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:03,546 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:03,667 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:55:03,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:03,667 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:03,667 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:03,667 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:03,667 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:03,667 INFO ]: Start difference. First operand 347 states and 1013 transitions. Second operand 3 states. [2018-06-24 23:55:04,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:04,591 INFO ]: Finished difference Result 349 states and 1000 transitions. [2018-06-24 23:55:04,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:04,594 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 23:55:04,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:04,597 INFO ]: With dead ends: 349 [2018-06-24 23:55:04,597 INFO ]: Without dead ends: 349 [2018-06-24 23:55:04,597 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-24 23:55:04,597 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-24 23:55:04,609 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 341. [2018-06-24 23:55:04,609 INFO ]: Start removeUnreachable. Operand 341 states. [2018-06-24 23:55:04,611 INFO ]: Finished removeUnreachable. Reduced from 341 states to 341 states and 976 transitions. [2018-06-24 23:55:04,611 INFO ]: Start accepts. Automaton has 341 states and 976 transitions. Word has length 14 [2018-06-24 23:55:04,611 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:04,611 INFO ]: Abstraction has 341 states and 976 transitions. [2018-06-24 23:55:04,611 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:04,611 INFO ]: Start isEmpty. Operand 341 states and 976 transitions. [2018-06-24 23:55:04,613 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:55:04,613 INFO ]: Found error trace [2018-06-24 23:55:04,613 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:04,613 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:04,613 INFO ]: Analyzing trace with hash -1750860997, now seen corresponding path program 1 times [2018-06-24 23:55:04,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:04,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:04,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:04,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:04,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:04,666 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:04,765 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 23:55:04,766 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:04,766 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:04,766 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:04,766 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:04,766 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:04,766 INFO ]: Start difference. First operand 341 states and 976 transitions. Second operand 3 states. [2018-06-24 23:55:05,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:05,605 INFO ]: Finished difference Result 517 states and 1292 transitions. [2018-06-24 23:55:05,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:05,605 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:55:05,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:05,608 INFO ]: With dead ends: 517 [2018-06-24 23:55:05,608 INFO ]: Without dead ends: 517 [2018-06-24 23:55:05,608 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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-24 23:55:05,608 INFO ]: Start minimizeSevpa. Operand 517 states. [2018-06-24 23:55:05,627 INFO ]: Finished minimizeSevpa. Reduced states from 517 to 459. [2018-06-24 23:55:05,627 INFO ]: Start removeUnreachable. Operand 459 states. [2018-06-24 23:55:05,630 INFO ]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1201 transitions. [2018-06-24 23:55:05,630 INFO ]: Start accepts. Automaton has 459 states and 1201 transitions. Word has length 17 [2018-06-24 23:55:05,630 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:05,630 INFO ]: Abstraction has 459 states and 1201 transitions. [2018-06-24 23:55:05,630 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:05,630 INFO ]: Start isEmpty. Operand 459 states and 1201 transitions. [2018-06-24 23:55:05,635 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:55:05,635 INFO ]: Found error trace [2018-06-24 23:55:05,635 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:05,635 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:05,635 INFO ]: Analyzing trace with hash -1992235227, now seen corresponding path program 1 times [2018-06-24 23:55:05,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:05,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:05,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:05,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:05,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:05,698 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:05,858 INFO ]: Checked inductivity of 78 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 23:55:05,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:05,858 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:05,858 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:05,858 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:05,858 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:05,858 INFO ]: Start difference. First operand 459 states and 1201 transitions. Second operand 3 states. [2018-06-24 23:55:06,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:06,529 INFO ]: Finished difference Result 666 states and 1613 transitions. [2018-06-24 23:55:06,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:06,530 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:55:06,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:06,533 INFO ]: With dead ends: 666 [2018-06-24 23:55:06,533 INFO ]: Without dead ends: 655 [2018-06-24 23:55:06,533 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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-24 23:55:06,533 INFO ]: Start minimizeSevpa. Operand 655 states. [2018-06-24 23:55:06,551 INFO ]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-06-24 23:55:06,551 INFO ]: Start removeUnreachable. Operand 655 states. [2018-06-24 23:55:06,555 INFO ]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1602 transitions. [2018-06-24 23:55:06,555 INFO ]: Start accepts. Automaton has 655 states and 1602 transitions. Word has length 17 [2018-06-24 23:55:06,555 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:06,555 INFO ]: Abstraction has 655 states and 1602 transitions. [2018-06-24 23:55:06,555 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:06,555 INFO ]: Start isEmpty. Operand 655 states and 1602 transitions. [2018-06-24 23:55:06,557 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:55:06,557 INFO ]: Found error trace [2018-06-24 23:55:06,557 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:06,557 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:06,557 INFO ]: Analyzing trace with hash -1351739623, now seen corresponding path program 1 times [2018-06-24 23:55:06,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:06,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:06,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:06,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:06,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:06,595 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:06,694 INFO ]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 23:55:06,695 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:06,695 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:06,695 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:06,695 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:06,695 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:06,695 INFO ]: Start difference. First operand 655 states and 1602 transitions. Second operand 3 states. [2018-06-24 23:55:07,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:07,307 INFO ]: Finished difference Result 792 states and 1836 transitions. [2018-06-24 23:55:07,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:07,308 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:55:07,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:07,312 INFO ]: With dead ends: 792 [2018-06-24 23:55:07,312 INFO ]: Without dead ends: 786 [2018-06-24 23:55:07,312 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-24 23:55:07,313 INFO ]: Start minimizeSevpa. Operand 786 states. [2018-06-24 23:55:07,336 INFO ]: Finished minimizeSevpa. Reduced states from 786 to 774. [2018-06-24 23:55:07,337 INFO ]: Start removeUnreachable. Operand 774 states. [2018-06-24 23:55:07,341 INFO ]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1814 transitions. [2018-06-24 23:55:07,341 INFO ]: Start accepts. Automaton has 774 states and 1814 transitions. Word has length 17 [2018-06-24 23:55:07,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:07,341 INFO ]: Abstraction has 774 states and 1814 transitions. [2018-06-24 23:55:07,341 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:07,341 INFO ]: Start isEmpty. Operand 774 states and 1814 transitions. [2018-06-24 23:55:07,343 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:55:07,343 INFO ]: Found error trace [2018-06-24 23:55:07,343 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:07,343 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:07,343 INFO ]: Analyzing trace with hash 415434548, now seen corresponding path program 1 times [2018-06-24 23:55:07,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:07,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:07,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:07,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:07,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:07,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:07,465 INFO ]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 23:55:07,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:07,465 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:07,466 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:07,466 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:07,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:07,466 INFO ]: Start difference. First operand 774 states and 1814 transitions. Second operand 3 states. [2018-06-24 23:55:08,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:08,231 INFO ]: Finished difference Result 908 states and 2041 transitions. [2018-06-24 23:55:08,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:08,232 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:55:08,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:08,235 INFO ]: With dead ends: 908 [2018-06-24 23:55:08,235 INFO ]: Without dead ends: 884 [2018-06-24 23:55:08,236 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-24 23:55:08,236 INFO ]: Start minimizeSevpa. Operand 884 states. [2018-06-24 23:55:08,257 INFO ]: Finished minimizeSevpa. Reduced states from 884 to 875. [2018-06-24 23:55:08,257 INFO ]: Start removeUnreachable. Operand 875 states. [2018-06-24 23:55:08,260 INFO ]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1974 transitions. [2018-06-24 23:55:08,261 INFO ]: Start accepts. Automaton has 875 states and 1974 transitions. Word has length 17 [2018-06-24 23:55:08,261 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:08,261 INFO ]: Abstraction has 875 states and 1974 transitions. [2018-06-24 23:55:08,261 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:08,261 INFO ]: Start isEmpty. Operand 875 states and 1974 transitions. [2018-06-24 23:55:08,263 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:55:08,263 INFO ]: Found error trace [2018-06-24 23:55:08,263 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:08,263 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:08,263 INFO ]: Analyzing trace with hash -1105803360, now seen corresponding path program 1 times [2018-06-24 23:55:08,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:08,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:08,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:08,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:08,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:08,305 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:08,473 INFO ]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:55:08,473 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:08,473 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:08,473 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:08,473 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:08,473 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:08,474 INFO ]: Start difference. First operand 875 states and 1974 transitions. Second operand 3 states. [2018-06-24 23:55:09,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:09,308 INFO ]: Finished difference Result 956 states and 2105 transitions. [2018-06-24 23:55:09,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:09,308 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:55:09,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:09,312 INFO ]: With dead ends: 956 [2018-06-24 23:55:09,312 INFO ]: Without dead ends: 956 [2018-06-24 23:55:09,313 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:09,313 INFO ]: Start minimizeSevpa. Operand 956 states. [2018-06-24 23:55:09,337 INFO ]: Finished minimizeSevpa. Reduced states from 956 to 923. [2018-06-24 23:55:09,337 INFO ]: Start removeUnreachable. Operand 923 states. [2018-06-24 23:55:09,340 INFO ]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2044 transitions. [2018-06-24 23:55:09,340 INFO ]: Start accepts. Automaton has 923 states and 2044 transitions. Word has length 17 [2018-06-24 23:55:09,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:09,341 INFO ]: Abstraction has 923 states and 2044 transitions. [2018-06-24 23:55:09,341 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:09,341 INFO ]: Start isEmpty. Operand 923 states and 2044 transitions. [2018-06-24 23:55:09,343 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:55:09,343 INFO ]: Found error trace [2018-06-24 23:55:09,343 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:09,344 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:09,344 INFO ]: Analyzing trace with hash -414195129, now seen corresponding path program 1 times [2018-06-24 23:55:09,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:09,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:09,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:09,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:09,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:09,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:09,669 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 23:55:09,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:09,670 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-24 23:55:09,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:10,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:10,318 INFO ]: Computing forward predicates... [2018-06-24 23:55:10,363 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 23:55:10,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:55:10,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 23:55:10,387 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:55:10,388 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:55:10,388 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:55:10,388 INFO ]: Start difference. First operand 923 states and 2044 transitions. Second operand 5 states. [2018-06-24 23:55:11,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:11,911 INFO ]: Finished difference Result 1344 states and 2852 transitions. [2018-06-24 23:55:11,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 23:55:11,912 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 23:55:11,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:11,925 INFO ]: With dead ends: 1344 [2018-06-24 23:55:11,925 INFO ]: Without dead ends: 1344 [2018-06-24 23:55:11,926 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:55:11,926 INFO ]: Start minimizeSevpa. Operand 1344 states. [2018-06-24 23:55:11,963 INFO ]: Finished minimizeSevpa. Reduced states from 1344 to 1257. [2018-06-24 23:55:11,963 INFO ]: Start removeUnreachable. Operand 1257 states. [2018-06-24 23:55:11,968 INFO ]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2721 transitions. [2018-06-24 23:55:11,968 INFO ]: Start accepts. Automaton has 1257 states and 2721 transitions. Word has length 18 [2018-06-24 23:55:11,968 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:11,968 INFO ]: Abstraction has 1257 states and 2721 transitions. [2018-06-24 23:55:11,969 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:55:11,969 INFO ]: Start isEmpty. Operand 1257 states and 2721 transitions. [2018-06-24 23:55:11,972 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:55:11,972 INFO ]: Found error trace [2018-06-24 23:55:11,973 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:11,973 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:11,974 INFO ]: Analyzing trace with hash -1323383199, now seen corresponding path program 1 times [2018-06-24 23:55:11,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:11,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:11,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:11,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:11,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:12,021 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:12,128 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-24 23:55:12,128 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:12,128 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:12,129 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:12,129 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:12,129 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:12,129 INFO ]: Start difference. First operand 1257 states and 2721 transitions. Second operand 3 states. [2018-06-24 23:55:13,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:13,059 INFO ]: Finished difference Result 2236 states and 4538 transitions. [2018-06-24 23:55:13,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:13,059 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 23:55:13,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:13,063 INFO ]: With dead ends: 2236 [2018-06-24 23:55:13,063 INFO ]: Without dead ends: 912 [2018-06-24 23:55:13,063 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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-24 23:55:13,064 INFO ]: Start minimizeSevpa. Operand 912 states. [2018-06-24 23:55:13,082 INFO ]: Finished minimizeSevpa. Reduced states from 912 to 622. [2018-06-24 23:55:13,082 INFO ]: Start removeUnreachable. Operand 622 states. [2018-06-24 23:55:13,085 INFO ]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1287 transitions. [2018-06-24 23:55:13,085 INFO ]: Start accepts. Automaton has 622 states and 1287 transitions. Word has length 18 [2018-06-24 23:55:13,085 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:13,085 INFO ]: Abstraction has 622 states and 1287 transitions. [2018-06-24 23:55:13,085 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:13,085 INFO ]: Start isEmpty. Operand 622 states and 1287 transitions. [2018-06-24 23:55:13,087 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 23:55:13,087 INFO ]: Found error trace [2018-06-24 23:55:13,087 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:13,087 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:13,087 INFO ]: Analyzing trace with hash -425228996, now seen corresponding path program 1 times [2018-06-24 23:55:13,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:13,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:13,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:13,088 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:13,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:13,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:13,292 INFO ]: Checked inductivity of 190 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-24 23:55:13,292 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:13,292 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:13,292 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:13,292 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:13,292 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:13,292 INFO ]: Start difference. First operand 622 states and 1287 transitions. Second operand 3 states. [2018-06-24 23:55:13,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:13,782 INFO ]: Finished difference Result 730 states and 1333 transitions. [2018-06-24 23:55:13,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:13,783 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 23:55:13,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:13,785 INFO ]: With dead ends: 730 [2018-06-24 23:55:13,785 INFO ]: Without dead ends: 655 [2018-06-24 23:55:13,785 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 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-24 23:55:13,785 INFO ]: Start minimizeSevpa. Operand 655 states. [2018-06-24 23:55:13,798 INFO ]: Finished minimizeSevpa. Reduced states from 655 to 472. [2018-06-24 23:55:13,798 INFO ]: Start removeUnreachable. Operand 472 states. [2018-06-24 23:55:13,800 INFO ]: Finished removeUnreachable. Reduced from 472 states to 472 states and 907 transitions. [2018-06-24 23:55:13,800 INFO ]: Start accepts. Automaton has 472 states and 907 transitions. Word has length 24 [2018-06-24 23:55:13,800 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:13,800 INFO ]: Abstraction has 472 states and 907 transitions. [2018-06-24 23:55:13,800 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:13,800 INFO ]: Start isEmpty. Operand 472 states and 907 transitions. [2018-06-24 23:55:13,802 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 23:55:13,802 INFO ]: Found error trace [2018-06-24 23:55:13,802 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:13,802 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:13,802 INFO ]: Analyzing trace with hash 1709323517, now seen corresponding path program 1 times [2018-06-24 23:55:13,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:13,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:13,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:13,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:13,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:13,870 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:13,994 INFO ]: Checked inductivity of 210 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-24 23:55:13,994 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:13,994 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:13,996 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:13,996 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:13,996 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:13,996 INFO ]: Start difference. First operand 472 states and 907 transitions. Second operand 3 states. [2018-06-24 23:55:15,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:15,426 INFO ]: Finished difference Result 728 states and 1368 transitions. [2018-06-24 23:55:15,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:15,520 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-24 23:55:15,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:15,522 INFO ]: With dead ends: 728 [2018-06-24 23:55:15,522 INFO ]: Without dead ends: 513 [2018-06-24 23:55:15,522 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 8 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-24 23:55:15,522 INFO ]: Start minimizeSevpa. Operand 513 states. [2018-06-24 23:55:15,532 INFO ]: Finished minimizeSevpa. Reduced states from 513 to 399. [2018-06-24 23:55:15,532 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 23:55:15,534 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 735 transitions. [2018-06-24 23:55:15,534 INFO ]: Start accepts. Automaton has 399 states and 735 transitions. Word has length 25 [2018-06-24 23:55:15,534 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:15,534 INFO ]: Abstraction has 399 states and 735 transitions. [2018-06-24 23:55:15,534 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:15,534 INFO ]: Start isEmpty. Operand 399 states and 735 transitions. [2018-06-24 23:55:15,536 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 23:55:15,536 INFO ]: Found error trace [2018-06-24 23:55:15,536 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:15,536 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:15,536 INFO ]: Analyzing trace with hash 1044270020, now seen corresponding path program 1 times [2018-06-24 23:55:15,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:15,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:15,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:15,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:15,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:15,606 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:15,816 INFO ]: Checked inductivity of 231 backedges. 151 proven. 28 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-24 23:55:15,816 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:15,816 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) [2018-06-24 23:55:15,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:55:16,612 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:16,642 INFO ]: Computing forward predicates... [2018-06-24 23:55:16,689 INFO ]: Checked inductivity of 231 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-24 23:55:16,727 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:55:16,727 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 23:55:16,727 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:55:16,728 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:55:16,728 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:55:16,728 INFO ]: Start difference. First operand 399 states and 735 transitions. Second operand 5 states. [2018-06-24 23:55:17,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:17,435 INFO ]: Finished difference Result 639 states and 1078 transitions. [2018-06-24 23:55:17,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 23:55:17,435 INFO ]: Start accepts. Automaton has 5 states. Word has length 26 [2018-06-24 23:55:17,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:17,436 INFO ]: With dead ends: 639 [2018-06-24 23:55:17,436 INFO ]: Without dead ends: 273 [2018-06-24 23:55:17,437 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:55:17,437 INFO ]: Start minimizeSevpa. Operand 273 states. [2018-06-24 23:55:17,444 INFO ]: Finished minimizeSevpa. Reduced states from 273 to 177. [2018-06-24 23:55:17,444 INFO ]: Start removeUnreachable. Operand 177 states. [2018-06-24 23:55:17,445 INFO ]: Finished removeUnreachable. Reduced from 177 states to 177 states and 362 transitions. [2018-06-24 23:55:17,445 INFO ]: Start accepts. Automaton has 177 states and 362 transitions. Word has length 26 [2018-06-24 23:55:17,445 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:17,445 INFO ]: Abstraction has 177 states and 362 transitions. [2018-06-24 23:55:17,445 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:55:17,445 INFO ]: Start isEmpty. Operand 177 states and 362 transitions. [2018-06-24 23:55:17,446 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 23:55:17,446 INFO ]: Found error trace [2018-06-24 23:55:17,446 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:17,446 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:17,446 INFO ]: Analyzing trace with hash -1109919615, now seen corresponding path program 1 times [2018-06-24 23:55:17,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:17,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:17,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:17,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:17,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:17,502 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:17,822 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-24 23:55:18,106 INFO ]: Checked inductivity of 231 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-24 23:55:18,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:18,106 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:18,106 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:18,106 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:18,106 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:18,106 INFO ]: Start difference. First operand 177 states and 362 transitions. Second operand 3 states. [2018-06-24 23:55:18,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:18,755 INFO ]: Finished difference Result 240 states and 442 transitions. [2018-06-24 23:55:18,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:18,755 INFO ]: Start accepts. Automaton has 3 states. Word has length 26 [2018-06-24 23:55:18,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:18,755 INFO ]: With dead ends: 240 [2018-06-24 23:55:18,755 INFO ]: Without dead ends: 236 [2018-06-24 23:55:18,756 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:18,756 INFO ]: Start minimizeSevpa. Operand 236 states. [2018-06-24 23:55:18,760 INFO ]: Finished minimizeSevpa. Reduced states from 236 to 229. [2018-06-24 23:55:18,760 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-24 23:55:18,761 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 413 transitions. [2018-06-24 23:55:18,761 INFO ]: Start accepts. Automaton has 229 states and 413 transitions. Word has length 26 [2018-06-24 23:55:18,761 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:18,761 INFO ]: Abstraction has 229 states and 413 transitions. [2018-06-24 23:55:18,761 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:18,761 INFO ]: Start isEmpty. Operand 229 states and 413 transitions. [2018-06-24 23:55:18,761 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 23:55:18,761 INFO ]: Found error trace [2018-06-24 23:55:18,762 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:18,762 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:18,762 INFO ]: Analyzing trace with hash 637845811, now seen corresponding path program 1 times [2018-06-24 23:55:18,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:18,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:18,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:18,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:18,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:18,809 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:19,023 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-24 23:55:19,036 INFO ]: Checked inductivity of 231 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-24 23:55:19,036 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:19,036 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:19,036 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:19,036 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:19,036 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:19,036 INFO ]: Start difference. First operand 229 states and 413 transitions. Second operand 3 states. [2018-06-24 23:55:19,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:19,449 INFO ]: Finished difference Result 291 states and 519 transitions. [2018-06-24 23:55:19,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:19,449 INFO ]: Start accepts. Automaton has 3 states. Word has length 26 [2018-06-24 23:55:19,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:19,450 INFO ]: With dead ends: 291 [2018-06-24 23:55:19,450 INFO ]: Without dead ends: 285 [2018-06-24 23:55:19,450 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:19,451 INFO ]: Start minimizeSevpa. Operand 285 states. [2018-06-24 23:55:19,455 INFO ]: Finished minimizeSevpa. Reduced states from 285 to 274. [2018-06-24 23:55:19,455 INFO ]: Start removeUnreachable. Operand 274 states. [2018-06-24 23:55:19,456 INFO ]: Finished removeUnreachable. Reduced from 274 states to 274 states and 488 transitions. [2018-06-24 23:55:19,456 INFO ]: Start accepts. Automaton has 274 states and 488 transitions. Word has length 26 [2018-06-24 23:55:19,456 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:19,456 INFO ]: Abstraction has 274 states and 488 transitions. [2018-06-24 23:55:19,456 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:19,456 INFO ]: Start isEmpty. Operand 274 states and 488 transitions. [2018-06-24 23:55:19,457 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:55:19,457 INFO ]: Found error trace [2018-06-24 23:55:19,457 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:19,457 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:19,457 INFO ]: Analyzing trace with hash 390232260, now seen corresponding path program 1 times [2018-06-24 23:55:19,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:19,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:19,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:19,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:19,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:19,557 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:19,775 INFO ]: Checked inductivity of 435 backedges. 152 proven. 233 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 23:55:19,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:19,775 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-24 23:55:19,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:20,800 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:20,844 INFO ]: Computing forward predicates... [2018-06-24 23:55:20,954 INFO ]: Checked inductivity of 435 backedges. 131 proven. 213 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-24 23:55:20,981 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:55:20,981 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2018-06-24 23:55:20,981 INFO ]: Interpolant automaton has 10 states [2018-06-24 23:55:20,981 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 23:55:20,982 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 23:55:20,982 INFO ]: Start difference. First operand 274 states and 488 transitions. Second operand 10 states. [2018-06-24 23:55:22,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:22,996 INFO ]: Finished difference Result 772 states and 1271 transitions. [2018-06-24 23:55:22,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 23:55:22,996 INFO ]: Start accepts. Automaton has 10 states. Word has length 34 [2018-06-24 23:55:22,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:22,998 INFO ]: With dead ends: 772 [2018-06-24 23:55:22,998 INFO ]: Without dead ends: 746 [2018-06-24 23:55:22,998 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-24 23:55:22,999 INFO ]: Start minimizeSevpa. Operand 746 states. [2018-06-24 23:55:23,008 INFO ]: Finished minimizeSevpa. Reduced states from 746 to 454. [2018-06-24 23:55:23,008 INFO ]: Start removeUnreachable. Operand 454 states. [2018-06-24 23:55:23,010 INFO ]: Finished removeUnreachable. Reduced from 454 states to 454 states and 836 transitions. [2018-06-24 23:55:23,010 INFO ]: Start accepts. Automaton has 454 states and 836 transitions. Word has length 34 [2018-06-24 23:55:23,010 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:23,010 INFO ]: Abstraction has 454 states and 836 transitions. [2018-06-24 23:55:23,010 INFO ]: Interpolant automaton has 10 states. [2018-06-24 23:55:23,010 INFO ]: Start isEmpty. Operand 454 states and 836 transitions. [2018-06-24 23:55:23,012 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 23:55:23,012 INFO ]: Found error trace [2018-06-24 23:55:23,012 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:23,012 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:23,012 INFO ]: Analyzing trace with hash 1907343762, now seen corresponding path program 1 times [2018-06-24 23:55:23,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:23,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:23,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:23,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:23,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:23,173 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:24,011 INFO ]: Checked inductivity of 1035 backedges. 571 proven. 214 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-24 23:55:24,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:24,011 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-24 23:55:24,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:25,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:25,643 INFO ]: Computing forward predicates... [2018-06-24 23:55:25,929 INFO ]: Checked inductivity of 1035 backedges. 631 proven. 154 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-24 23:55:25,975 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:55:25,975 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 23:55:25,975 INFO ]: Interpolant automaton has 13 states [2018-06-24 23:55:25,975 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 23:55:25,975 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-24 23:55:25,976 INFO ]: Start difference. First operand 454 states and 836 transitions. Second operand 13 states. [2018-06-24 23:55:27,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:27,693 INFO ]: Finished difference Result 1317 states and 2271 transitions. [2018-06-24 23:55:27,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 23:55:27,694 INFO ]: Start accepts. Automaton has 13 states. Word has length 50 [2018-06-24 23:55:27,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:27,696 INFO ]: With dead ends: 1317 [2018-06-24 23:55:27,696 INFO ]: Without dead ends: 1314 [2018-06-24 23:55:27,697 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-06-24 23:55:27,697 INFO ]: Start minimizeSevpa. Operand 1314 states. [2018-06-24 23:55:27,708 INFO ]: Finished minimizeSevpa. Reduced states from 1314 to 540. [2018-06-24 23:55:27,708 INFO ]: Start removeUnreachable. Operand 540 states. [2018-06-24 23:55:27,710 INFO ]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1012 transitions. [2018-06-24 23:55:27,710 INFO ]: Start accepts. Automaton has 540 states and 1012 transitions. Word has length 50 [2018-06-24 23:55:27,710 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:27,710 INFO ]: Abstraction has 540 states and 1012 transitions. [2018-06-24 23:55:27,710 INFO ]: Interpolant automaton has 13 states. [2018-06-24 23:55:27,710 INFO ]: Start isEmpty. Operand 540 states and 1012 transitions. [2018-06-24 23:55:27,711 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 23:55:27,711 INFO ]: Found error trace [2018-06-24 23:55:27,711 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:27,711 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:27,712 INFO ]: Analyzing trace with hash -1069791838, now seen corresponding path program 1 times [2018-06-24 23:55:27,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:27,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:27,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:27,712 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:27,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:27,813 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:28,041 INFO ]: Checked inductivity of 1035 backedges. 651 proven. 10 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-06-24 23:55:28,041 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:28,041 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-24 23:55:28,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:29,620 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:29,672 INFO ]: Computing forward predicates... [2018-06-24 23:55:29,695 INFO ]: Checked inductivity of 1035 backedges. 651 proven. 10 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-06-24 23:55:29,725 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:55:29,725 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 23:55:29,725 INFO ]: Interpolant automaton has 4 states [2018-06-24 23:55:29,725 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 23:55:29,725 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:55:29,725 INFO ]: Start difference. First operand 540 states and 1012 transitions. Second operand 4 states. [2018-06-24 23:55:30,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:30,156 INFO ]: Finished difference Result 853 states and 1463 transitions. [2018-06-24 23:55:30,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:55:30,156 INFO ]: Start accepts. Automaton has 4 states. Word has length 50 [2018-06-24 23:55:30,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:30,158 INFO ]: With dead ends: 853 [2018-06-24 23:55:30,158 INFO ]: Without dead ends: 829 [2018-06-24 23:55:30,158 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:55:30,158 INFO ]: Start minimizeSevpa. Operand 829 states. [2018-06-24 23:55:30,167 INFO ]: Finished minimizeSevpa. Reduced states from 829 to 489. [2018-06-24 23:55:30,167 INFO ]: Start removeUnreachable. Operand 489 states. [2018-06-24 23:55:30,168 INFO ]: Finished removeUnreachable. Reduced from 489 states to 489 states and 912 transitions. [2018-06-24 23:55:30,168 INFO ]: Start accepts. Automaton has 489 states and 912 transitions. Word has length 50 [2018-06-24 23:55:30,168 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:30,169 INFO ]: Abstraction has 489 states and 912 transitions. [2018-06-24 23:55:30,169 INFO ]: Interpolant automaton has 4 states. [2018-06-24 23:55:30,169 INFO ]: Start isEmpty. Operand 489 states and 912 transitions. [2018-06-24 23:55:30,170 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-24 23:55:30,170 INFO ]: Found error trace [2018-06-24 23:55:30,170 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:30,170 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:30,170 INFO ]: Analyzing trace with hash -1802529070, now seen corresponding path program 1 times [2018-06-24 23:55:30,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:30,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:30,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:30,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:30,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:30,364 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:30,882 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-24 23:55:31,049 INFO ]: Checked inductivity of 1891 backedges. 975 proven. 214 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-06-24 23:55:31,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:31,050 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:55:31,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:33,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:33,281 INFO ]: Computing forward predicates... [2018-06-24 23:55:33,887 INFO ]: Checked inductivity of 1891 backedges. 1031 proven. 154 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-06-24 23:55:33,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:55:33,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-06-24 23:55:33,925 INFO ]: Interpolant automaton has 14 states [2018-06-24 23:55:33,925 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 23:55:33,925 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-24 23:55:33,925 INFO ]: Start difference. First operand 489 states and 912 transitions. Second operand 14 states. [2018-06-24 23:55:35,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:35,986 INFO ]: Finished difference Result 1157 states and 2042 transitions. [2018-06-24 23:55:35,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 23:55:35,986 INFO ]: Start accepts. Automaton has 14 states. Word has length 66 [2018-06-24 23:55:35,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:35,989 INFO ]: With dead ends: 1157 [2018-06-24 23:55:35,989 INFO ]: Without dead ends: 1154 [2018-06-24 23:55:35,989 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2018-06-24 23:55:35,990 INFO ]: Start minimizeSevpa. Operand 1154 states. [2018-06-24 23:55:36,002 INFO ]: Finished minimizeSevpa. Reduced states from 1154 to 518. [2018-06-24 23:55:36,002 INFO ]: Start removeUnreachable. Operand 518 states. [2018-06-24 23:55:36,004 INFO ]: Finished removeUnreachable. Reduced from 518 states to 518 states and 977 transitions. [2018-06-24 23:55:36,005 INFO ]: Start accepts. Automaton has 518 states and 977 transitions. Word has length 66 [2018-06-24 23:55:36,005 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:36,005 INFO ]: Abstraction has 518 states and 977 transitions. [2018-06-24 23:55:36,005 INFO ]: Interpolant automaton has 14 states. [2018-06-24 23:55:36,005 INFO ]: Start isEmpty. Operand 518 states and 977 transitions. [2018-06-24 23:55:36,006 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-24 23:55:36,006 INFO ]: Found error trace [2018-06-24 23:55:36,006 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:36,006 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:36,007 INFO ]: Analyzing trace with hash -1475766726, now seen corresponding path program 1 times [2018-06-24 23:55:36,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:36,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:36,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:36,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:36,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:36,364 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:37,409 INFO ]: Checked inductivity of 3003 backedges. 1371 proven. 214 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2018-06-24 23:55:37,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:55:37,409 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:55:37,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY Received shutdown request... [2018-06-24 23:55:40,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:40,339 INFO ]: Computing forward predicates... [2018-06-24 23:55:40,341 INFO ]: Timeout while computing interpolants [2018-06-24 23:55:40,546 WARN ]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:55:40,546 WARN ]: Verification canceled [2018-06-24 23:55:40,548 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 23:55:40,549 WARN ]: Timeout [2018-06-24 23:55:40,551 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:55:40 BasicIcfg [2018-06-24 23:55:40,551 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 23:55:40,552 INFO ]: Toolchain (without parser) took 61123.80 ms. Allocated memory was 323.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 294.1 MB in the beginning and 1.3 GB in the end (delta: -992.7 MB). Peak memory consumption was 157.5 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:40,552 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 23:55:40,553 INFO ]: ChcToBoogie took 93.20 ms. Allocated memory is still 323.0 MB. Free memory was 294.1 MB in the beginning and 288.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:40,553 INFO ]: Boogie Preprocessor took 88.68 ms. Allocated memory is still 323.0 MB. Free memory was 288.4 MB in the beginning and 286.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:40,553 INFO ]: RCFGBuilder took 736.63 ms. Allocated memory is still 323.0 MB. Free memory was 286.1 MB in the beginning and 209.2 MB in the end (delta: 77.0 MB). Peak memory consumption was 77.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:40,553 INFO ]: BlockEncodingV2 took 8022.21 ms. Allocated memory was 323.0 MB in the beginning and 370.1 MB in the end (delta: 47.2 MB). Free memory was 209.2 MB in the beginning and 215.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 43.3 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:40,554 INFO ]: TraceAbstraction took 52174.38 ms. Allocated memory was 370.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 215.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 31.6 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:40,562 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, 117 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 93.20 ms. Allocated memory is still 323.0 MB. Free memory was 294.1 MB in the beginning and 288.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 88.68 ms. Allocated memory is still 323.0 MB. Free memory was 288.4 MB in the beginning and 286.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 3.6 GB. * RCFGBuilder took 736.63 ms. Allocated memory is still 323.0 MB. Free memory was 286.1 MB in the beginning and 209.2 MB in the end (delta: 77.0 MB). Peak memory consumption was 77.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 8022.21 ms. Allocated memory was 323.0 MB in the beginning and 370.1 MB in the end (delta: 47.2 MB). Free memory was 209.2 MB in the beginning and 215.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 43.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52174.38 ms. Allocated memory was 370.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 215.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 31.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 3 quantified variables from 4 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 52.1s OverallTime, 33 OverallIterations, 5 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 156 SDtfs, 4 SDslu, 222 SDs, 0 SdLazy, 12044 SolverSat, 3333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 515 GetRequests, 356 SyntacticMatches, 50 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1257occurred in iteration=22, 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.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 2957 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.0s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 844 NumberOfCodeBlocks, 844 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 61522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 62141 ConjunctsInSsa, 452 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 9771/11041 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/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_23-55-40-580.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_23-55-40-580.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_23-55-40-580.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_23-55-40-580.csv Completed graceful shutdown