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/s3_clnt_3.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:00:48,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:00:48,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:00:48,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:00:48,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:00:48,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:00:48,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:00:48,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:00:48,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:00:48,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:00:48,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:00:48,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:00:48,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:00:48,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:00:48,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:00:48,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:00:48,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:00:48,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:00:48,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:00:48,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:00:48,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:00:48,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:00:48,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:00:48,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:00:48,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:00:48,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:00:48,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:00:48,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:00:48,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:00:48,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:00:48,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:00:48,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:00:48,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:00:48,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:00:48,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:00:48,362 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:00:48,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:00:48,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:00:48,377 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:00:48,377 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:00:48,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:00:48,378 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:00:48,378 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:00:48,378 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:00:48,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:00:48,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:00:48,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:00:48,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:00:48,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:00:48,380 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:00:48,380 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:00:48,380 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:00:48,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:00:48,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:00:48,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:00:48,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:00:48,382 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:00:48,383 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:00:48,383 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:00:48,431 INFO ]: Repository-Root is: /tmp [2018-06-25 00:00:48,449 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:00:48,454 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:00:48,455 INFO ]: Initializing SmtParser... [2018-06-25 00:00:48,456 INFO ]: SmtParser initialized [2018-06-25 00:00:48,456 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_3.cil.smt2 [2018-06-25 00:00:48,457 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-25 00:00:48,541 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_3.cil.smt2 unknown [2018-06-25 00:00:49,001 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_3.cil.smt2 [2018-06-25 00:00:49,005 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:00:49,021 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:00:49,022 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:00:49,022 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:00:49,022 INFO ]: ChcToBoogie initialized [2018-06-25 00:00:49,031 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,129 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49 Unit [2018-06-25 00:00:49,129 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:00:49,130 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:00:49,130 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:00:49,130 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:00:49,151 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,151 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,172 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,172 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,184 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,185 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,189 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,198 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:00:49,199 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:00:49,199 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:00:49,199 INFO ]: RCFGBuilder initialized [2018-06-25 00:00:49,200 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (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-25 00:00:49,214 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:00:49,214 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:00:49,214 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:00:49,214 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:00:49,214 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:00:49,214 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-25 00:00:49,619 INFO ]: Using library mode [2018-06-25 00:00:49,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:00:49 BoogieIcfgContainer [2018-06-25 00:00:49,622 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:00:49,622 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:00:49,622 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:00:49,623 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:00:49,624 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:00:49" (1/1) ... [2018-06-25 00:00:49,642 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:00:49,644 INFO ]: Using Remove infeasible edges [2018-06-25 00:00:49,644 INFO ]: Using Maximize final states [2018-06-25 00:00:49,645 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:00:49,645 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:00:49,647 INFO ]: Using Remove sink states [2018-06-25 00:00:49,648 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:00:49,648 INFO ]: Using Use SBE [2018-06-25 00:00:56,682 INFO ]: SBE split 1 edges [2018-06-25 00:00:56,733 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:00:56,736 INFO ]: 0 new accepting states [2018-06-25 00:00:56,794 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:00:56,796 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:00:56,839 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:00:56,840 INFO ]: 0 new accepting states [2018-06-25 00:00:56,840 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:00:56,841 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:00:56,897 INFO ]: Encoded RCFG 6 locations, 540 edges [2018-06-25 00:00:56,898 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:00:56 BasicIcfg [2018-06-25 00:00:56,898 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:00:56,899 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:00:56,899 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:00:56,906 INFO ]: TraceAbstraction initialized [2018-06-25 00:00:56,906 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:00:49" (1/4) ... [2018-06-25 00:00:56,908 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1817731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:00:56, skipping insertion in model container [2018-06-25 00:00:56,908 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:00:49" (2/4) ... [2018-06-25 00:00:56,908 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1817731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:00:56, skipping insertion in model container [2018-06-25 00:00:56,908 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:00:49" (3/4) ... [2018-06-25 00:00:56,909 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1817731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:00:56, skipping insertion in model container [2018-06-25 00:00:56,909 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:00:56" (4/4) ... [2018-06-25 00:00:56,914 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:00:56,924 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:00:56,933 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:00:56,991 INFO ]: Using default assertion order modulation [2018-06-25 00:00:56,991 INFO ]: Interprodecural is true [2018-06-25 00:00:56,991 INFO ]: Hoare is false [2018-06-25 00:00:56,991 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:00:56,991 INFO ]: Backedges is TWOTRACK [2018-06-25 00:00:56,991 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:00:56,991 INFO ]: Difference is false [2018-06-25 00:00:56,991 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:00:56,991 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:00:57,011 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:00:57,033 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:00:57,033 INFO ]: Found error trace [2018-06-25 00:00:57,034 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:00:57,034 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:57,039 INFO ]: Analyzing trace with hash 51854882, now seen corresponding path program 1 times [2018-06-25 00:00:57,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:57,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:57,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:57,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:57,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:57,147 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:57,285 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:00:57,289 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:57,289 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:57,291 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:57,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:57,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:57,311 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:01:01,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:01,255 INFO ]: Finished difference Result 7 states and 406 transitions. [2018-06-25 00:01:01,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:01,257 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:01:01,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:01,267 INFO ]: With dead ends: 7 [2018-06-25 00:01:01,267 INFO ]: Without dead ends: 7 [2018-06-25 00:01:01,269 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-25 00:01:01,285 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:01:01,308 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:01:01,309 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:01:01,311 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 406 transitions. [2018-06-25 00:01:01,312 INFO ]: Start accepts. Automaton has 7 states and 406 transitions. Word has length 5 [2018-06-25 00:01:01,312 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:01,312 INFO ]: Abstraction has 7 states and 406 transitions. [2018-06-25 00:01:01,312 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:01,312 INFO ]: Start isEmpty. Operand 7 states and 406 transitions. [2018-06-25 00:01:01,313 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:01:01,313 INFO ]: Found error trace [2018-06-25 00:01:01,313 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:01:01,313 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:01,313 INFO ]: Analyzing trace with hash 1595862830, now seen corresponding path program 1 times [2018-06-25 00:01:01,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:01,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:01,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:01,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:01,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:01,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:01,402 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:01:01,402 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:01,402 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:01,404 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:01,404 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:01,404 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:01,404 INFO ]: Start difference. First operand 7 states and 406 transitions. Second operand 3 states. [2018-06-25 00:01:03,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:03,871 INFO ]: Finished difference Result 8 states and 408 transitions. [2018-06-25 00:01:03,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:03,871 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:01:03,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:03,872 INFO ]: With dead ends: 8 [2018-06-25 00:01:03,872 INFO ]: Without dead ends: 8 [2018-06-25 00:01:03,872 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-25 00:01:03,873 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:01:03,879 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:01:03,879 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:01:03,880 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 408 transitions. [2018-06-25 00:01:03,880 INFO ]: Start accepts. Automaton has 8 states and 408 transitions. Word has length 6 [2018-06-25 00:01:03,880 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:03,880 INFO ]: Abstraction has 8 states and 408 transitions. [2018-06-25 00:01:03,880 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:03,880 INFO ]: Start isEmpty. Operand 8 states and 408 transitions. [2018-06-25 00:01:03,880 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:01:03,880 INFO ]: Found error trace [2018-06-25 00:01:03,881 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:03,881 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:03,881 INFO ]: Analyzing trace with hash -2081553913, now seen corresponding path program 1 times [2018-06-25 00:01:03,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:03,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:03,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:03,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:03,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:03,930 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:03,983 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:01:03,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:03,983 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:03,983 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:03,984 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:03,984 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:03,984 INFO ]: Start difference. First operand 8 states and 408 transitions. Second operand 3 states. [2018-06-25 00:01:05,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:05,719 INFO ]: Finished difference Result 9 states and 803 transitions. [2018-06-25 00:01:05,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:05,720 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 00:01:05,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:05,721 INFO ]: With dead ends: 9 [2018-06-25 00:01:05,721 INFO ]: Without dead ends: 9 [2018-06-25 00:01:05,721 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-25 00:01:05,721 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:01:05,727 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:01:05,727 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:01:05,729 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 803 transitions. [2018-06-25 00:01:05,729 INFO ]: Start accepts. Automaton has 9 states and 803 transitions. Word has length 7 [2018-06-25 00:01:05,730 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:05,730 INFO ]: Abstraction has 9 states and 803 transitions. [2018-06-25 00:01:05,730 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:05,730 INFO ]: Start isEmpty. Operand 9 states and 803 transitions. [2018-06-25 00:01:05,730 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:01:05,730 INFO ]: Found error trace [2018-06-25 00:01:05,730 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:05,731 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:05,732 INFO ]: Analyzing trace with hash -117504909, now seen corresponding path program 1 times [2018-06-25 00:01:05,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:05,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:05,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:05,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:05,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:05,791 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:05,883 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:01:05,884 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:05,884 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:05,884 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:05,884 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:05,884 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:05,884 INFO ]: Start difference. First operand 9 states and 803 transitions. Second operand 3 states. [2018-06-25 00:01:08,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:08,213 INFO ]: Finished difference Result 10 states and 1195 transitions. [2018-06-25 00:01:08,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:08,213 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:01:08,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:08,214 INFO ]: With dead ends: 10 [2018-06-25 00:01:08,214 INFO ]: Without dead ends: 10 [2018-06-25 00:01:08,214 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-25 00:01:08,214 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:01:08,218 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 00:01:08,218 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:01:08,220 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1195 transitions. [2018-06-25 00:01:08,220 INFO ]: Start accepts. Automaton has 10 states and 1195 transitions. Word has length 8 [2018-06-25 00:01:08,220 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:08,220 INFO ]: Abstraction has 10 states and 1195 transitions. [2018-06-25 00:01:08,220 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:08,220 INFO ]: Start isEmpty. Operand 10 states and 1195 transitions. [2018-06-25 00:01:08,221 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:01:08,221 INFO ]: Found error trace [2018-06-25 00:01:08,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:08,221 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:08,221 INFO ]: Analyzing trace with hash 650477844, now seen corresponding path program 1 times [2018-06-25 00:01:08,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:08,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:08,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:08,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:08,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:08,265 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:08,375 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:01:08,375 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:08,375 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:08,375 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:08,375 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:08,375 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:08,375 INFO ]: Start difference. First operand 10 states and 1195 transitions. Second operand 3 states. [2018-06-25 00:01:10,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:10,345 INFO ]: Finished difference Result 11 states and 1139 transitions. [2018-06-25 00:01:10,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:10,346 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:01:10,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:10,348 INFO ]: With dead ends: 11 [2018-06-25 00:01:10,348 INFO ]: Without dead ends: 11 [2018-06-25 00:01:10,348 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-25 00:01:10,348 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:01:10,355 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:01:10,355 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:01:10,358 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1139 transitions. [2018-06-25 00:01:10,358 INFO ]: Start accepts. Automaton has 11 states and 1139 transitions. Word has length 9 [2018-06-25 00:01:10,358 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:10,358 INFO ]: Abstraction has 11 states and 1139 transitions. [2018-06-25 00:01:10,358 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:10,358 INFO ]: Start isEmpty. Operand 11 states and 1139 transitions. [2018-06-25 00:01:10,359 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:01:10,359 INFO ]: Found error trace [2018-06-25 00:01:10,359 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:10,359 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:10,359 INFO ]: Analyzing trace with hash 1479533931, now seen corresponding path program 1 times [2018-06-25 00:01:10,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:10,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:10,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:10,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:10,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:10,387 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:10,468 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:01:10,468 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:10,468 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:10,468 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:10,468 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:10,468 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:10,469 INFO ]: Start difference. First operand 11 states and 1139 transitions. Second operand 3 states. [2018-06-25 00:01:12,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:12,421 INFO ]: Finished difference Result 12 states and 1331 transitions. [2018-06-25 00:01:12,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:12,421 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:01:12,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:12,422 INFO ]: With dead ends: 12 [2018-06-25 00:01:12,422 INFO ]: Without dead ends: 12 [2018-06-25 00:01:12,423 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-25 00:01:12,423 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:01:12,428 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 00:01:12,428 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:01:12,432 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1331 transitions. [2018-06-25 00:01:12,432 INFO ]: Start accepts. Automaton has 12 states and 1331 transitions. Word has length 9 [2018-06-25 00:01:12,432 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:12,432 INFO ]: Abstraction has 12 states and 1331 transitions. [2018-06-25 00:01:12,432 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:12,432 INFO ]: Start isEmpty. Operand 12 states and 1331 transitions. [2018-06-25 00:01:12,433 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:01:12,433 INFO ]: Found error trace [2018-06-25 00:01:12,433 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:12,433 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:12,433 INFO ]: Analyzing trace with hash -310434950, now seen corresponding path program 1 times [2018-06-25 00:01:12,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:12,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:12,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:12,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:12,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:12,470 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:12,552 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:01:12,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:12,552 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:12,552 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:12,552 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:12,552 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:12,552 INFO ]: Start difference. First operand 12 states and 1331 transitions. Second operand 3 states. [2018-06-25 00:01:14,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:14,203 INFO ]: Finished difference Result 13 states and 1355 transitions. [2018-06-25 00:01:14,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:14,204 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:01:14,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:14,206 INFO ]: With dead ends: 13 [2018-06-25 00:01:14,206 INFO ]: Without dead ends: 13 [2018-06-25 00:01:14,206 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-25 00:01:14,207 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:01:14,211 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:01:14,211 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:01:14,212 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1355 transitions. [2018-06-25 00:01:14,212 INFO ]: Start accepts. Automaton has 13 states and 1355 transitions. Word has length 10 [2018-06-25 00:01:14,212 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:14,213 INFO ]: Abstraction has 13 states and 1355 transitions. [2018-06-25 00:01:14,213 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:14,213 INFO ]: Start isEmpty. Operand 13 states and 1355 transitions. [2018-06-25 00:01:14,213 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:01:14,214 INFO ]: Found error trace [2018-06-25 00:01:14,214 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:14,214 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:14,214 INFO ]: Analyzing trace with hash 376664674, now seen corresponding path program 1 times [2018-06-25 00:01:14,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:14,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:14,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:14,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:14,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:14,244 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:14,333 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:01:14,333 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:14,333 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:14,333 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:14,333 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:14,333 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:14,333 INFO ]: Start difference. First operand 13 states and 1355 transitions. Second operand 3 states. [2018-06-25 00:01:16,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:16,074 INFO ]: Finished difference Result 14 states and 1419 transitions. [2018-06-25 00:01:16,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:16,074 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:01:16,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:16,076 INFO ]: With dead ends: 14 [2018-06-25 00:01:16,076 INFO ]: Without dead ends: 14 [2018-06-25 00:01:16,076 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-25 00:01:16,076 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:01:16,080 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 00:01:16,081 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:01:16,082 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1419 transitions. [2018-06-25 00:01:16,082 INFO ]: Start accepts. Automaton has 14 states and 1419 transitions. Word has length 10 [2018-06-25 00:01:16,082 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:16,082 INFO ]: Abstraction has 14 states and 1419 transitions. [2018-06-25 00:01:16,082 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:16,082 INFO ]: Start isEmpty. Operand 14 states and 1419 transitions. [2018-06-25 00:01:16,083 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:01:16,083 INFO ]: Found error trace [2018-06-25 00:01:16,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:16,083 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:16,083 INFO ]: Analyzing trace with hash -1783517720, now seen corresponding path program 1 times [2018-06-25 00:01:16,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:16,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:16,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:16,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:16,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:16,112 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:16,208 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:01:16,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:16,208 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:16,209 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:16,209 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:16,209 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:16,209 INFO ]: Start difference. First operand 14 states and 1419 transitions. Second operand 3 states. [2018-06-25 00:01:17,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:17,764 INFO ]: Finished difference Result 15 states and 1603 transitions. [2018-06-25 00:01:17,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:17,764 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:01:17,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:17,766 INFO ]: With dead ends: 15 [2018-06-25 00:01:17,766 INFO ]: Without dead ends: 15 [2018-06-25 00:01:17,766 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-25 00:01:17,766 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:01:17,770 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 00:01:17,771 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:01:17,772 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1603 transitions. [2018-06-25 00:01:17,772 INFO ]: Start accepts. Automaton has 15 states and 1603 transitions. Word has length 10 [2018-06-25 00:01:17,772 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:17,772 INFO ]: Abstraction has 15 states and 1603 transitions. [2018-06-25 00:01:17,772 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:17,772 INFO ]: Start isEmpty. Operand 15 states and 1603 transitions. [2018-06-25 00:01:17,773 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:01:17,773 INFO ]: Found error trace [2018-06-25 00:01:17,773 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:17,773 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:17,773 INFO ]: Analyzing trace with hash -1868690883, now seen corresponding path program 1 times [2018-06-25 00:01:17,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:17,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:17,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:17,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:17,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:17,806 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:17,889 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:01:17,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:17,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:17,890 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:17,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:17,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:17,890 INFO ]: Start difference. First operand 15 states and 1603 transitions. Second operand 3 states. [2018-06-25 00:01:19,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:19,992 INFO ]: Finished difference Result 16 states and 1519 transitions. [2018-06-25 00:01:19,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:19,992 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:01:19,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:19,993 INFO ]: With dead ends: 16 [2018-06-25 00:01:19,993 INFO ]: Without dead ends: 16 [2018-06-25 00:01:19,994 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-25 00:01:19,994 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:01:19,998 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 00:01:19,998 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:01:20,000 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1519 transitions. [2018-06-25 00:01:20,000 INFO ]: Start accepts. Automaton has 16 states and 1519 transitions. Word has length 11 [2018-06-25 00:01:20,000 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:20,000 INFO ]: Abstraction has 16 states and 1519 transitions. [2018-06-25 00:01:20,000 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:20,000 INFO ]: Start isEmpty. Operand 16 states and 1519 transitions. [2018-06-25 00:01:20,001 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:01:20,001 INFO ]: Found error trace [2018-06-25 00:01:20,001 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:20,001 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:20,001 INFO ]: Analyzing trace with hash 1487855592, now seen corresponding path program 1 times [2018-06-25 00:01:20,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:20,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:20,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:20,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:20,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:20,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:20,124 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:01:20,124 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:20,125 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:20,125 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:20,125 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:20,125 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:20,125 INFO ]: Start difference. First operand 16 states and 1519 transitions. Second operand 3 states. [2018-06-25 00:01:22,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:22,080 INFO ]: Finished difference Result 24 states and 2606 transitions. [2018-06-25 00:01:22,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:22,080 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:01:22,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:22,083 INFO ]: With dead ends: 24 [2018-06-25 00:01:22,084 INFO ]: Without dead ends: 24 [2018-06-25 00:01:22,084 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-25 00:01:22,084 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 00:01:22,092 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 00:01:22,092 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:01:22,094 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2606 transitions. [2018-06-25 00:01:22,095 INFO ]: Start accepts. Automaton has 24 states and 2606 transitions. Word has length 11 [2018-06-25 00:01:22,095 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:22,095 INFO ]: Abstraction has 24 states and 2606 transitions. [2018-06-25 00:01:22,095 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:22,095 INFO ]: Start isEmpty. Operand 24 states and 2606 transitions. [2018-06-25 00:01:22,096 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:01:22,096 INFO ]: Found error trace [2018-06-25 00:01:22,096 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:22,096 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:22,097 INFO ]: Analyzing trace with hash -1174060805, now seen corresponding path program 1 times [2018-06-25 00:01:22,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:22,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:22,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:22,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:22,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:22,137 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:22,227 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:01:22,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:22,227 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:22,228 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:22,228 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:22,228 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:22,228 INFO ]: Start difference. First operand 24 states and 2606 transitions. Second operand 3 states. [2018-06-25 00:01:23,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:23,793 INFO ]: Finished difference Result 26 states and 2962 transitions. [2018-06-25 00:01:23,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:23,793 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:01:23,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:23,796 INFO ]: With dead ends: 26 [2018-06-25 00:01:23,796 INFO ]: Without dead ends: 26 [2018-06-25 00:01:23,796 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-25 00:01:23,796 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 00:01:23,805 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 00:01:23,805 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 00:01:23,810 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2962 transitions. [2018-06-25 00:01:23,810 INFO ]: Start accepts. Automaton has 26 states and 2962 transitions. Word has length 11 [2018-06-25 00:01:23,810 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:23,810 INFO ]: Abstraction has 26 states and 2962 transitions. [2018-06-25 00:01:23,810 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:23,810 INFO ]: Start isEmpty. Operand 26 states and 2962 transitions. [2018-06-25 00:01:23,812 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:23,812 INFO ]: Found error trace [2018-06-25 00:01:23,812 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:23,812 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:23,812 INFO ]: Analyzing trace with hash -1594723379, now seen corresponding path program 1 times [2018-06-25 00:01:23,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:23,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:23,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:23,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:23,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:23,842 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:23,939 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:01:23,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:23,939 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:23,939 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:23,939 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:23,939 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:23,940 INFO ]: Start difference. First operand 26 states and 2962 transitions. Second operand 3 states. [2018-06-25 00:01:25,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:25,617 INFO ]: Finished difference Result 44 states and 3398 transitions. [2018-06-25 00:01:25,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:25,618 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:25,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:25,620 INFO ]: With dead ends: 44 [2018-06-25 00:01:25,620 INFO ]: Without dead ends: 44 [2018-06-25 00:01:25,620 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-25 00:01:25,620 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 00:01:25,628 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-25 00:01:25,628 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 00:01:25,634 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3398 transitions. [2018-06-25 00:01:25,634 INFO ]: Start accepts. Automaton has 44 states and 3398 transitions. Word has length 12 [2018-06-25 00:01:25,634 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:25,634 INFO ]: Abstraction has 44 states and 3398 transitions. [2018-06-25 00:01:25,634 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:25,634 INFO ]: Start isEmpty. Operand 44 states and 3398 transitions. [2018-06-25 00:01:25,635 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:25,635 INFO ]: Found error trace [2018-06-25 00:01:25,635 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:25,636 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:25,636 INFO ]: Analyzing trace with hash -1208173414, now seen corresponding path program 1 times [2018-06-25 00:01:25,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:25,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:25,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:25,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:25,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:25,664 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:25,742 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:01:25,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:25,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:25,742 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:25,743 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:25,743 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:25,743 INFO ]: Start difference. First operand 44 states and 3398 transitions. Second operand 3 states. [2018-06-25 00:01:27,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:27,307 INFO ]: Finished difference Result 48 states and 3434 transitions. [2018-06-25 00:01:27,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:27,308 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:27,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:27,311 INFO ]: With dead ends: 48 [2018-06-25 00:01:27,311 INFO ]: Without dead ends: 48 [2018-06-25 00:01:27,311 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-25 00:01:27,311 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 00:01:27,318 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-25 00:01:27,318 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 00:01:27,321 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3434 transitions. [2018-06-25 00:01:27,321 INFO ]: Start accepts. Automaton has 48 states and 3434 transitions. Word has length 12 [2018-06-25 00:01:27,321 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:27,321 INFO ]: Abstraction has 48 states and 3434 transitions. [2018-06-25 00:01:27,321 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:27,321 INFO ]: Start isEmpty. Operand 48 states and 3434 transitions. [2018-06-25 00:01:27,324 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:27,324 INFO ]: Found error trace [2018-06-25 00:01:27,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:27,324 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:27,324 INFO ]: Analyzing trace with hash -781389872, now seen corresponding path program 1 times [2018-06-25 00:01:27,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:27,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:27,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:27,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:27,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:27,354 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:27,434 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:01:27,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:27,434 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:27,434 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:27,434 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:27,434 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:27,434 INFO ]: Start difference. First operand 48 states and 3434 transitions. Second operand 3 states. [2018-06-25 00:01:29,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:29,294 INFO ]: Finished difference Result 88 states and 5604 transitions. [2018-06-25 00:01:29,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:29,294 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:29,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:29,298 INFO ]: With dead ends: 88 [2018-06-25 00:01:29,298 INFO ]: Without dead ends: 88 [2018-06-25 00:01:29,298 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-25 00:01:29,298 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-25 00:01:29,311 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 68. [2018-06-25 00:01:29,311 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-25 00:01:29,315 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 5164 transitions. [2018-06-25 00:01:29,315 INFO ]: Start accepts. Automaton has 68 states and 5164 transitions. Word has length 12 [2018-06-25 00:01:29,315 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:29,315 INFO ]: Abstraction has 68 states and 5164 transitions. [2018-06-25 00:01:29,315 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:29,315 INFO ]: Start isEmpty. Operand 68 states and 5164 transitions. [2018-06-25 00:01:29,317 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:29,317 INFO ]: Found error trace [2018-06-25 00:01:29,317 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:29,317 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:29,317 INFO ]: Analyzing trace with hash 1896754253, now seen corresponding path program 1 times [2018-06-25 00:01:29,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:29,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:29,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:29,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:29,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:29,346 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:29,426 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:01:29,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:29,426 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:29,427 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:29,427 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:29,427 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:29,427 INFO ]: Start difference. First operand 68 states and 5164 transitions. Second operand 3 states. [2018-06-25 00:01:31,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:31,232 INFO ]: Finished difference Result 70 states and 4512 transitions. [2018-06-25 00:01:31,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:31,232 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:31,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:31,235 INFO ]: With dead ends: 70 [2018-06-25 00:01:31,235 INFO ]: Without dead ends: 70 [2018-06-25 00:01:31,235 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-25 00:01:31,235 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-25 00:01:31,244 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-25 00:01:31,244 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 00:01:31,247 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 4512 transitions. [2018-06-25 00:01:31,247 INFO ]: Start accepts. Automaton has 70 states and 4512 transitions. Word has length 12 [2018-06-25 00:01:31,247 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:31,247 INFO ]: Abstraction has 70 states and 4512 transitions. [2018-06-25 00:01:31,248 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:31,248 INFO ]: Start isEmpty. Operand 70 states and 4512 transitions. [2018-06-25 00:01:31,249 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:31,249 INFO ]: Found error trace [2018-06-25 00:01:31,249 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:31,249 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:31,250 INFO ]: Analyzing trace with hash -1587690480, now seen corresponding path program 1 times [2018-06-25 00:01:31,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:31,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:31,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:31,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:31,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:31,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:31,365 INFO ]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:01:31,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:31,365 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:31,365 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:31,365 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:31,365 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:31,365 INFO ]: Start difference. First operand 70 states and 4512 transitions. Second operand 3 states. [2018-06-25 00:01:33,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:33,587 INFO ]: Finished difference Result 127 states and 8070 transitions. [2018-06-25 00:01:33,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:33,587 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:33,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:33,593 INFO ]: With dead ends: 127 [2018-06-25 00:01:33,593 INFO ]: Without dead ends: 127 [2018-06-25 00:01:33,593 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:33,594 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-25 00:01:33,613 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-06-25 00:01:33,613 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-25 00:01:33,619 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 8070 transitions. [2018-06-25 00:01:33,619 INFO ]: Start accepts. Automaton has 127 states and 8070 transitions. Word has length 12 [2018-06-25 00:01:33,619 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:33,619 INFO ]: Abstraction has 127 states and 8070 transitions. [2018-06-25 00:01:33,619 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:33,619 INFO ]: Start isEmpty. Operand 127 states and 8070 transitions. [2018-06-25 00:01:33,623 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:33,623 INFO ]: Found error trace [2018-06-25 00:01:33,623 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:33,623 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:33,623 INFO ]: Analyzing trace with hash 614970209, now seen corresponding path program 1 times [2018-06-25 00:01:33,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:33,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:33,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:33,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:33,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:33,646 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:33,722 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:01:33,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:33,722 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:33,722 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:33,722 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:33,722 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:33,722 INFO ]: Start difference. First operand 127 states and 8070 transitions. Second operand 3 states. [2018-06-25 00:01:35,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:35,523 INFO ]: Finished difference Result 139 states and 9102 transitions. [2018-06-25 00:01:35,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:35,524 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:35,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:35,529 INFO ]: With dead ends: 139 [2018-06-25 00:01:35,529 INFO ]: Without dead ends: 139 [2018-06-25 00:01:35,529 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-25 00:01:35,529 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-25 00:01:35,556 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 127. [2018-06-25 00:01:35,556 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-25 00:01:35,563 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 8070 transitions. [2018-06-25 00:01:35,563 INFO ]: Start accepts. Automaton has 127 states and 8070 transitions. Word has length 12 [2018-06-25 00:01:35,563 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:35,563 INFO ]: Abstraction has 127 states and 8070 transitions. [2018-06-25 00:01:35,563 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:35,563 INFO ]: Start isEmpty. Operand 127 states and 8070 transitions. [2018-06-25 00:01:35,565 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:01:35,565 INFO ]: Found error trace [2018-06-25 00:01:35,565 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:35,565 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:35,565 INFO ]: Analyzing trace with hash 758115964, now seen corresponding path program 1 times [2018-06-25 00:01:35,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:35,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:35,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:35,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:35,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:35,588 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:35,668 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:01:35,668 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:35,668 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:35,669 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:35,669 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:35,669 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:35,669 INFO ]: Start difference. First operand 127 states and 8070 transitions. Second operand 3 states. [2018-06-25 00:01:37,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:37,205 INFO ]: Finished difference Result 139 states and 9246 transitions. [2018-06-25 00:01:37,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:37,205 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:01:37,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:37,213 INFO ]: With dead ends: 139 [2018-06-25 00:01:37,213 INFO ]: Without dead ends: 139 [2018-06-25 00:01:37,214 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-25 00:01:37,219 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-25 00:01:37,234 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-06-25 00:01:37,234 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-25 00:01:37,241 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 9246 transitions. [2018-06-25 00:01:37,241 INFO ]: Start accepts. Automaton has 139 states and 9246 transitions. Word has length 12 [2018-06-25 00:01:37,241 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:37,241 INFO ]: Abstraction has 139 states and 9246 transitions. [2018-06-25 00:01:37,241 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:37,241 INFO ]: Start isEmpty. Operand 139 states and 9246 transitions. [2018-06-25 00:01:37,243 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:01:37,243 INFO ]: Found error trace [2018-06-25 00:01:37,243 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:37,244 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:37,244 INFO ]: Analyzing trace with hash 278542920, now seen corresponding path program 1 times [2018-06-25 00:01:37,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:37,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:37,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:37,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:37,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:37,268 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:37,373 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:01:37,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:37,374 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:37,374 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:37,374 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:37,374 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:37,374 INFO ]: Start difference. First operand 139 states and 9246 transitions. Second operand 3 states. [2018-06-25 00:01:38,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:38,968 INFO ]: Finished difference Result 225 states and 9246 transitions. [2018-06-25 00:01:38,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:38,968 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:01:38,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:38,981 INFO ]: With dead ends: 225 [2018-06-25 00:01:38,981 INFO ]: Without dead ends: 139 [2018-06-25 00:01:38,982 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-25 00:01:38,982 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-25 00:01:38,999 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-06-25 00:01:38,999 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-25 00:01:39,004 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 7274 transitions. [2018-06-25 00:01:39,004 INFO ]: Start accepts. Automaton has 139 states and 7274 transitions. Word has length 13 [2018-06-25 00:01:39,005 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:39,005 INFO ]: Abstraction has 139 states and 7274 transitions. [2018-06-25 00:01:39,005 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:39,005 INFO ]: Start isEmpty. Operand 139 states and 7274 transitions. [2018-06-25 00:01:39,007 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:01:39,008 INFO ]: Found error trace [2018-06-25 00:01:39,008 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:39,009 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:39,010 INFO ]: Analyzing trace with hash -71278556, now seen corresponding path program 1 times [2018-06-25 00:01:39,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:39,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:39,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:39,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:39,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:39,035 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:39,137 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 00:01:39,138 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:39,138 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:39,138 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:39,138 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:39,138 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:39,138 INFO ]: Start difference. First operand 139 states and 7274 transitions. Second operand 3 states. [2018-06-25 00:01:40,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:40,576 INFO ]: Finished difference Result 225 states and 10150 transitions. [2018-06-25 00:01:40,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:40,576 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:01:40,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:40,582 INFO ]: With dead ends: 225 [2018-06-25 00:01:40,582 INFO ]: Without dead ends: 225 [2018-06-25 00:01:40,583 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-25 00:01:40,583 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-25 00:01:40,604 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-06-25 00:01:40,604 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-25 00:01:40,610 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 10150 transitions. [2018-06-25 00:01:40,610 INFO ]: Start accepts. Automaton has 225 states and 10150 transitions. Word has length 13 [2018-06-25 00:01:40,610 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:40,610 INFO ]: Abstraction has 225 states and 10150 transitions. [2018-06-25 00:01:40,610 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:40,610 INFO ]: Start isEmpty. Operand 225 states and 10150 transitions. [2018-06-25 00:01:40,613 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:01:40,613 INFO ]: Found error trace [2018-06-25 00:01:40,613 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:40,613 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:40,613 INFO ]: Analyzing trace with hash 937435753, now seen corresponding path program 1 times [2018-06-25 00:01:40,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:40,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:40,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:40,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:40,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:40,637 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:40,725 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:01:40,726 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:40,726 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:40,726 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:40,726 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:40,726 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:40,726 INFO ]: Start difference. First operand 225 states and 10150 transitions. Second operand 3 states. [2018-06-25 00:01:42,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:42,118 INFO ]: Finished difference Result 245 states and 11470 transitions. [2018-06-25 00:01:42,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:42,119 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:01:42,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:42,126 INFO ]: With dead ends: 245 [2018-06-25 00:01:42,126 INFO ]: Without dead ends: 245 [2018-06-25 00:01:42,126 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-25 00:01:42,126 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-25 00:01:42,147 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 225. [2018-06-25 00:01:42,147 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-25 00:01:42,155 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 10150 transitions. [2018-06-25 00:01:42,155 INFO ]: Start accepts. Automaton has 225 states and 10150 transitions. Word has length 13 [2018-06-25 00:01:42,155 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:42,155 INFO ]: Abstraction has 225 states and 10150 transitions. [2018-06-25 00:01:42,155 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:42,155 INFO ]: Start isEmpty. Operand 225 states and 10150 transitions. [2018-06-25 00:01:42,159 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:01:42,159 INFO ]: Found error trace [2018-06-25 00:01:42,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:42,159 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:42,159 INFO ]: Analyzing trace with hash 1053141649, now seen corresponding path program 1 times [2018-06-25 00:01:42,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:42,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:42,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:42,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:42,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:42,181 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:42,262 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:01:42,262 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:42,262 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:42,262 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:42,262 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:42,262 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:42,262 INFO ]: Start difference. First operand 225 states and 10150 transitions. Second operand 3 states. [2018-06-25 00:01:43,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:43,813 INFO ]: Finished difference Result 400 states and 17480 transitions. [2018-06-25 00:01:43,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:43,814 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:01:43,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:43,823 INFO ]: With dead ends: 400 [2018-06-25 00:01:43,823 INFO ]: Without dead ends: 400 [2018-06-25 00:01:43,823 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-25 00:01:43,823 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-25 00:01:43,849 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 220. [2018-06-25 00:01:43,849 INFO ]: Start removeUnreachable. Operand 220 states. [2018-06-25 00:01:43,857 INFO ]: Finished removeUnreachable. Reduced from 220 states to 220 states and 10264 transitions. [2018-06-25 00:01:43,857 INFO ]: Start accepts. Automaton has 220 states and 10264 transitions. Word has length 13 [2018-06-25 00:01:43,857 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:43,857 INFO ]: Abstraction has 220 states and 10264 transitions. [2018-06-25 00:01:43,857 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:43,857 INFO ]: Start isEmpty. Operand 220 states and 10264 transitions. [2018-06-25 00:01:43,860 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:01:43,861 INFO ]: Found error trace [2018-06-25 00:01:43,861 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:43,861 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:43,861 INFO ]: Analyzing trace with hash 1826128726, now seen corresponding path program 1 times [2018-06-25 00:01:43,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:43,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:43,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:43,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:43,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:43,885 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:43,967 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:01:43,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:43,968 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:43,968 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:43,968 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:43,968 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:43,968 INFO ]: Start difference. First operand 220 states and 10264 transitions. Second operand 3 states. [2018-06-25 00:01:45,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:45,786 INFO ]: Finished difference Result 380 states and 16952 transitions. [2018-06-25 00:01:45,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:45,787 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:01:45,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:45,794 INFO ]: With dead ends: 380 [2018-06-25 00:01:45,794 INFO ]: Without dead ends: 380 [2018-06-25 00:01:45,794 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-25 00:01:45,794 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-25 00:01:45,820 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 240. [2018-06-25 00:01:45,820 INFO ]: Start removeUnreachable. Operand 240 states. [2018-06-25 00:01:45,829 INFO ]: Finished removeUnreachable. Reduced from 240 states to 240 states and 11696 transitions. [2018-06-25 00:01:45,829 INFO ]: Start accepts. Automaton has 240 states and 11696 transitions. Word has length 13 [2018-06-25 00:01:45,829 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:45,829 INFO ]: Abstraction has 240 states and 11696 transitions. [2018-06-25 00:01:45,829 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:45,829 INFO ]: Start isEmpty. Operand 240 states and 11696 transitions. [2018-06-25 00:01:45,832 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:01:45,832 INFO ]: Found error trace [2018-06-25 00:01:45,832 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:45,832 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:45,832 INFO ]: Analyzing trace with hash 401814378, now seen corresponding path program 1 times [2018-06-25 00:01:45,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:45,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:45,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:45,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:45,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:45,849 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:45,914 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:01:45,915 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:45,915 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:45,915 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:45,915 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:45,915 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:45,915 INFO ]: Start difference. First operand 240 states and 11696 transitions. Second operand 3 states. [2018-06-25 00:01:47,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:47,553 INFO ]: Finished difference Result 390 states and 17228 transitions. [2018-06-25 00:01:47,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:47,553 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:01:47,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:47,559 INFO ]: With dead ends: 390 [2018-06-25 00:01:47,559 INFO ]: Without dead ends: 390 [2018-06-25 00:01:47,559 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-25 00:01:47,560 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-25 00:01:47,595 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-06-25 00:01:47,595 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-25 00:01:47,607 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 17228 transitions. [2018-06-25 00:01:47,607 INFO ]: Start accepts. Automaton has 390 states and 17228 transitions. Word has length 13 [2018-06-25 00:01:47,607 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:47,607 INFO ]: Abstraction has 390 states and 17228 transitions. [2018-06-25 00:01:47,608 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:47,608 INFO ]: Start isEmpty. Operand 390 states and 17228 transitions. [2018-06-25 00:01:47,612 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 00:01:47,612 INFO ]: Found error trace [2018-06-25 00:01:47,612 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:47,612 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:47,612 INFO ]: Analyzing trace with hash 141843977, now seen corresponding path program 1 times [2018-06-25 00:01:47,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:47,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:47,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:47,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:47,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:47,639 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:47,721 INFO ]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 00:01:47,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:47,721 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:47,721 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:47,721 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:47,721 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:47,722 INFO ]: Start difference. First operand 390 states and 17228 transitions. Second operand 3 states. [2018-06-25 00:01:49,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:49,388 INFO ]: Finished difference Result 390 states and 16468 transitions. [2018-06-25 00:01:49,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:49,388 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-25 00:01:49,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:49,396 INFO ]: With dead ends: 390 [2018-06-25 00:01:49,396 INFO ]: Without dead ends: 390 [2018-06-25 00:01:49,396 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-25 00:01:49,396 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-25 00:01:49,432 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-06-25 00:01:49,432 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-25 00:01:49,443 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 16468 transitions. [2018-06-25 00:01:49,443 INFO ]: Start accepts. Automaton has 390 states and 16468 transitions. Word has length 16 [2018-06-25 00:01:49,443 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:49,443 INFO ]: Abstraction has 390 states and 16468 transitions. [2018-06-25 00:01:49,443 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:49,443 INFO ]: Start isEmpty. Operand 390 states and 16468 transitions. [2018-06-25 00:01:49,448 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:01:49,448 INFO ]: Found error trace [2018-06-25 00:01:49,448 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:49,448 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:49,448 INFO ]: Analyzing trace with hash 349422034, now seen corresponding path program 1 times [2018-06-25 00:01:49,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:49,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:49,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:49,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:49,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:49,474 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:49,549 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 00:01:49,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:49,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:49,549 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:49,549 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:49,549 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:49,549 INFO ]: Start difference. First operand 390 states and 16468 transitions. Second operand 3 states. [2018-06-25 00:01:51,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:51,306 INFO ]: Finished difference Result 407 states and 12772 transitions. [2018-06-25 00:01:51,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:51,307 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:01:51,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:51,314 INFO ]: With dead ends: 407 [2018-06-25 00:01:51,314 INFO ]: Without dead ends: 407 [2018-06-25 00:01:51,314 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-25 00:01:51,314 INFO ]: Start minimizeSevpa. Operand 407 states. [2018-06-25 00:01:51,333 INFO ]: Finished minimizeSevpa. Reduced states from 407 to 267. [2018-06-25 00:01:51,333 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-25 00:01:51,339 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 8684 transitions. [2018-06-25 00:01:51,339 INFO ]: Start accepts. Automaton has 267 states and 8684 transitions. Word has length 17 [2018-06-25 00:01:51,339 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:51,339 INFO ]: Abstraction has 267 states and 8684 transitions. [2018-06-25 00:01:51,339 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:51,339 INFO ]: Start isEmpty. Operand 267 states and 8684 transitions. [2018-06-25 00:01:51,342 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 00:01:51,342 INFO ]: Found error trace [2018-06-25 00:01:51,342 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:51,342 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:51,342 INFO ]: Analyzing trace with hash 2132273172, now seen corresponding path program 1 times [2018-06-25 00:01:51,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:51,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:51,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:51,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:51,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:51,373 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:51,429 INFO ]: Checked inductivity of 105 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-25 00:01:51,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:01:51,429 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-25 00:01:51,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:51,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:51,878 INFO ]: Computing forward predicates... [2018-06-25 00:01:51,904 INFO ]: Checked inductivity of 105 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-25 00:01:51,933 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 00:01:51,933 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-25 00:01:51,933 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:01:51,933 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:01:51,933 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:01:51,934 INFO ]: Start difference. First operand 267 states and 8684 transitions. Second operand 6 states. Received shutdown request... [2018-06-25 00:01:54,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 00:01:54,156 WARN ]: Verification canceled [2018-06-25 00:01:54,159 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:01:54,160 WARN ]: Timeout [2018-06-25 00:01:54,161 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:01:54 BasicIcfg [2018-06-25 00:01:54,161 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:01:54,162 INFO ]: Toolchain (without parser) took 65156.74 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 710.4 MB). Free memory was 245.1 MB in the beginning and 890.5 MB in the end (delta: -645.4 MB). Peak memory consumption was 65.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:01:54,163 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:01:54,163 INFO ]: ChcToBoogie took 108.19 ms. Allocated memory is still 306.7 MB. Free memory was 245.1 MB in the beginning and 242.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:01:54,164 INFO ]: Boogie Preprocessor took 68.30 ms. Allocated memory is still 306.7 MB. Free memory was 242.1 MB in the beginning and 240.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:01:54,164 INFO ]: RCFGBuilder took 422.93 ms. Allocated memory is still 306.7 MB. Free memory was 240.0 MB in the beginning and 212.5 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 3.6 GB. [2018-06-25 00:01:54,164 INFO ]: BlockEncodingV2 took 7276.01 ms. Allocated memory was 306.7 MB in the beginning and 354.4 MB in the end (delta: 47.7 MB). Free memory was 212.5 MB in the beginning and 243.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 61.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:01:54,165 INFO ]: TraceAbstraction took 57261.95 ms. Allocated memory was 354.4 MB in the beginning and 1.0 GB in the end (delta: 662.7 MB). Free memory was 240.8 MB in the beginning and 890.5 MB in the end (delta: -649.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:01:54,167 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, 540 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 108.19 ms. Allocated memory is still 306.7 MB. Free memory was 245.1 MB in the beginning and 242.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 68.30 ms. Allocated memory is still 306.7 MB. Free memory was 242.1 MB in the beginning and 240.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 422.93 ms. Allocated memory is still 306.7 MB. Free memory was 240.0 MB in the beginning and 212.5 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 7276.01 ms. Allocated memory was 306.7 MB in the beginning and 354.4 MB in the end (delta: 47.7 MB). Free memory was 212.5 MB in the beginning and 243.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 61.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57261.95 ms. Allocated memory was 354.4 MB in the beginning and 1.0 GB in the end (delta: 662.7 MB). Free memory was 240.8 MB in the beginning and 890.5 MB in the end (delta: -649.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 7 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (86 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.1s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 52.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 0 SDslu, 109 SDs, 0 SdLazy, 16441 SolverSat, 14784 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=25, 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.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 512 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 4571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2681 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 901/904 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/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-01-54-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-01-54-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-01-54-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-01-54-177.csv Completed graceful shutdown