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/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:51:45,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:51:45,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:51:45,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:51:45,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:51:45,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:51:45,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:51:45,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:51:45,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:51:45,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:51:45,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:51:45,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:51:45,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:51:45,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:51:45,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:51:45,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:51:45,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:51:45,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:51:45,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:51:45,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:51:45,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:51:45,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:51:45,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:51:45,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:51:45,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:51:45,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:51:45,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:51:45,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:51:45,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:51:45,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:51:45,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:51:45,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:51:45,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:51:45,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:51:45,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:51:45,648 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:51:45,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:51:45,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:51:45,668 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:51:45,668 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:51:45,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:51:45,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:51:45,669 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:51:45,670 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:51:45,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:51:45,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:51:45,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:51:45,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:51:45,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:51:45,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:51:45,671 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:51:45,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:51:45,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:51:45,672 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:51:45,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:51:45,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:51:45,672 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:51:45,674 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:51:45,674 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:51:45,719 INFO ]: Repository-Root is: /tmp [2018-06-24 20:51:45,736 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:51:45,741 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:51:45,742 INFO ]: Initializing SmtParser... [2018-06-24 20:51:45,742 INFO ]: SmtParser initialized [2018-06-24 20:51:45,743 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-24 20:51:45,744 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:51:45,831 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 unknown [2018-06-24 20:51:46,071 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-24 20:51:46,076 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:51:46,086 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:51:46,087 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:51:46,087 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:51:46,087 INFO ]: ChcToBoogie initialized [2018-06-24 20:51:46,090 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,156 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46 Unit [2018-06-24 20:51:46,156 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:51:46,157 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:51:46,157 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:51:46,157 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:51:46,179 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,179 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,190 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,190 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,198 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,208 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,209 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,211 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:51:46,212 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:51:46,212 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:51:46,212 INFO ]: RCFGBuilder initialized [2018-06-24 20:51:46,212 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:51:46,229 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:51:46,229 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:51:46,229 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:51:46,229 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:51:46,229 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:51:46,229 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:51:46,645 INFO ]: Using library mode [2018-06-24 20:51:46,646 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:51:46 BoogieIcfgContainer [2018-06-24 20:51:46,646 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:51:46,646 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:51:46,646 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:51:46,647 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:51:46,648 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:51:46" (1/1) ... [2018-06-24 20:51:46,666 INFO ]: Initial Icfg 16 locations, 24 edges [2018-06-24 20:51:46,668 INFO ]: Using Remove infeasible edges [2018-06-24 20:51:46,668 INFO ]: Using Maximize final states [2018-06-24 20:51:46,669 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:51:46,669 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:51:46,671 INFO ]: Using Remove sink states [2018-06-24 20:51:46,671 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:51:46,671 INFO ]: Using Use SBE [2018-06-24 20:51:46,694 INFO ]: SBE split 2 edges [2018-06-24 20:51:46,704 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:51:46,706 INFO ]: 0 new accepting states [2018-06-24 20:51:46,997 INFO ]: Removed 25 edges and 5 locations by large block encoding [2018-06-24 20:51:46,999 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:51:47,000 INFO ]: Removed 4 edges and 0 locations because of local infeasibility [2018-06-24 20:51:47,000 INFO ]: 0 new accepting states [2018-06-24 20:51:47,000 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:51:47,000 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:51:47,000 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:51:47,000 INFO ]: 0 new accepting states [2018-06-24 20:51:47,000 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:51:47,001 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:51:47,001 INFO ]: Encoded RCFG 9 locations, 20 edges [2018-06-24 20:51:47,001 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:51:47 BasicIcfg [2018-06-24 20:51:47,001 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:51:47,002 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:51:47,002 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:51:47,005 INFO ]: TraceAbstraction initialized [2018-06-24 20:51:47,005 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:51:46" (1/4) ... [2018-06-24 20:51:47,006 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd1cbf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:51:47, skipping insertion in model container [2018-06-24 20:51:47,006 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:46" (2/4) ... [2018-06-24 20:51:47,007 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd1cbf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:51:47, skipping insertion in model container [2018-06-24 20:51:47,007 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:51:46" (3/4) ... [2018-06-24 20:51:47,007 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd1cbf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:51:47, skipping insertion in model container [2018-06-24 20:51:47,007 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:51:47" (4/4) ... [2018-06-24 20:51:47,009 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:51:47,018 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:51:47,026 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:51:47,064 INFO ]: Using default assertion order modulation [2018-06-24 20:51:47,065 INFO ]: Interprodecural is true [2018-06-24 20:51:47,065 INFO ]: Hoare is false [2018-06-24 20:51:47,065 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:51:47,065 INFO ]: Backedges is TWOTRACK [2018-06-24 20:51:47,065 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:51:47,065 INFO ]: Difference is false [2018-06-24 20:51:47,065 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:51:47,065 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:51:47,073 INFO ]: Start isEmpty. Operand 9 states. [2018-06-24 20:51:47,083 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:51:47,083 INFO ]: Found error trace [2018-06-24 20:51:47,084 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:51:47,084 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:47,088 INFO ]: Analyzing trace with hash 31628204, now seen corresponding path program 1 times [2018-06-24 20:51:47,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:47,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:47,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:47,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:47,249 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:47,251 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:47,251 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:51:47,252 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:51:47,264 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:51:47,264 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:51:47,266 INFO ]: Start difference. First operand 9 states. Second operand 3 states. [2018-06-24 20:51:47,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:47,375 INFO ]: Finished difference Result 12 states and 25 transitions. [2018-06-24 20:51:47,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:51:47,377 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:51:47,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:47,391 INFO ]: With dead ends: 12 [2018-06-24 20:51:47,391 INFO ]: Without dead ends: 12 [2018-06-24 20:51:47,393 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:51:47,408 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:51:47,425 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:51:47,426 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:51:47,426 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-06-24 20:51:47,427 INFO ]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 5 [2018-06-24 20:51:47,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:47,428 INFO ]: Abstraction has 10 states and 21 transitions. [2018-06-24 20:51:47,428 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:51:47,428 INFO ]: Start isEmpty. Operand 10 states and 21 transitions. [2018-06-24 20:51:47,428 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:51:47,428 INFO ]: Found error trace [2018-06-24 20:51:47,428 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:51:47,429 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:47,429 INFO ]: Analyzing trace with hash 31687786, now seen corresponding path program 1 times [2018-06-24 20:51:47,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:47,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:47,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:47,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:47,467 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:47,467 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:47,467 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:51:47,468 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:51:47,468 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:51:47,468 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:51:47,468 INFO ]: Start difference. First operand 10 states and 21 transitions. Second operand 3 states. [2018-06-24 20:51:47,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:47,502 INFO ]: Finished difference Result 13 states and 26 transitions. [2018-06-24 20:51:47,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:51:47,502 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:51:47,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:47,503 INFO ]: With dead ends: 13 [2018-06-24 20:51:47,503 INFO ]: Without dead ends: 13 [2018-06-24 20:51:47,503 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:51:47,504 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:51:47,505 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:51:47,505 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:51:47,505 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-06-24 20:51:47,505 INFO ]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 5 [2018-06-24 20:51:47,505 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:47,506 INFO ]: Abstraction has 10 states and 21 transitions. [2018-06-24 20:51:47,506 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:51:47,506 INFO ]: Start isEmpty. Operand 10 states and 21 transitions. [2018-06-24 20:51:47,506 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:47,506 INFO ]: Found error trace [2018-06-24 20:51:47,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:47,506 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:47,506 INFO ]: Analyzing trace with hash 974900637, now seen corresponding path program 1 times [2018-06-24 20:51:47,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:47,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:47,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:47,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:47,575 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:47,575 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:47,575 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:47,575 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:47,575 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:47,575 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:47,576 INFO ]: Start difference. First operand 10 states and 21 transitions. Second operand 4 states. [2018-06-24 20:51:47,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:47,669 INFO ]: Finished difference Result 21 states and 42 transitions. [2018-06-24 20:51:47,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:51:47,670 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:47,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:47,670 INFO ]: With dead ends: 21 [2018-06-24 20:51:47,670 INFO ]: Without dead ends: 21 [2018-06-24 20:51:47,671 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:47,671 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:51:47,673 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 11. [2018-06-24 20:51:47,673 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:51:47,674 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-24 20:51:47,674 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 6 [2018-06-24 20:51:47,674 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:47,674 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-24 20:51:47,674 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:47,674 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-24 20:51:47,674 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:47,674 INFO ]: Found error trace [2018-06-24 20:51:47,674 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:47,674 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:47,675 INFO ]: Analyzing trace with hash 975824158, now seen corresponding path program 1 times [2018-06-24 20:51:47,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:47,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:47,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:47,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,684 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:47,766 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:47,766 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:47,766 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:47,766 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:47,766 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:47,767 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:47,767 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 4 states. [2018-06-24 20:51:47,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:47,922 INFO ]: Finished difference Result 19 states and 39 transitions. [2018-06-24 20:51:47,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:47,923 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:47,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:47,924 INFO ]: With dead ends: 19 [2018-06-24 20:51:47,924 INFO ]: Without dead ends: 19 [2018-06-24 20:51:47,924 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:47,924 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:51:47,926 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 11. [2018-06-24 20:51:47,926 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:51:47,930 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-24 20:51:47,930 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 6 [2018-06-24 20:51:47,930 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:47,930 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-24 20:51:47,931 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:47,931 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-24 20:51:47,931 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:47,931 INFO ]: Found error trace [2018-06-24 20:51:47,931 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:47,931 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:47,931 INFO ]: Analyzing trace with hash 979398117, now seen corresponding path program 1 times [2018-06-24 20:51:47,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:47,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:47,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:47,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,951 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,033 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:48,034 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:48,034 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:48,034 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:48,034 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:48,034 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 4 states. [2018-06-24 20:51:48,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:48,140 INFO ]: Finished difference Result 16 states and 32 transitions. [2018-06-24 20:51:48,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:51:48,140 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:48,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:48,141 INFO ]: With dead ends: 16 [2018-06-24 20:51:48,141 INFO ]: Without dead ends: 16 [2018-06-24 20:51:48,141 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:48,142 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:51:48,143 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 20:51:48,144 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:48,144 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-06-24 20:51:48,144 INFO ]: Start accepts. Automaton has 13 states and 26 transitions. Word has length 6 [2018-06-24 20:51:48,144 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:48,144 INFO ]: Abstraction has 13 states and 26 transitions. [2018-06-24 20:51:48,144 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:48,144 INFO ]: Start isEmpty. Operand 13 states and 26 transitions. [2018-06-24 20:51:48,145 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:48,145 INFO ]: Found error trace [2018-06-24 20:51:48,145 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:48,145 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:48,145 INFO ]: Analyzing trace with hash 982168680, now seen corresponding path program 1 times [2018-06-24 20:51:48,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:48,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:48,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:48,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,157 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,182 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:48,182 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:48,183 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:48,183 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:48,183 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:48,183 INFO ]: Start difference. First operand 13 states and 26 transitions. Second operand 4 states. [2018-06-24 20:51:48,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:48,321 INFO ]: Finished difference Result 17 states and 32 transitions. [2018-06-24 20:51:48,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:48,321 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:48,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:48,322 INFO ]: With dead ends: 17 [2018-06-24 20:51:48,322 INFO ]: Without dead ends: 14 [2018-06-24 20:51:48,322 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:48,322 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:51:48,324 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 20:51:48,324 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:48,325 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-06-24 20:51:48,325 INFO ]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 6 [2018-06-24 20:51:48,325 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:48,325 INFO ]: Abstraction has 13 states and 25 transitions. [2018-06-24 20:51:48,325 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:48,325 INFO ]: Start isEmpty. Operand 13 states and 25 transitions. [2018-06-24 20:51:48,325 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:48,325 INFO ]: Found error trace [2018-06-24 20:51:48,325 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:48,325 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:48,326 INFO ]: Analyzing trace with hash 987829931, now seen corresponding path program 1 times [2018-06-24 20:51:48,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:48,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:48,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:48,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,334 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,355 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:48,355 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:48,355 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:48,355 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:48,355 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:48,356 INFO ]: Start difference. First operand 13 states and 25 transitions. Second operand 4 states. [2018-06-24 20:51:48,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:48,518 INFO ]: Finished difference Result 22 states and 43 transitions. [2018-06-24 20:51:48,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:48,519 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:48,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:48,519 INFO ]: With dead ends: 22 [2018-06-24 20:51:48,519 INFO ]: Without dead ends: 22 [2018-06-24 20:51:48,520 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:48,520 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:51:48,521 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-06-24 20:51:48,521 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:51:48,522 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2018-06-24 20:51:48,522 INFO ]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 6 [2018-06-24 20:51:48,522 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:48,522 INFO ]: Abstraction has 12 states and 23 transitions. [2018-06-24 20:51:48,522 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:48,522 INFO ]: Start isEmpty. Operand 12 states and 23 transitions. [2018-06-24 20:51:48,522 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:48,522 INFO ]: Found error trace [2018-06-24 20:51:48,522 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:48,522 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:48,522 INFO ]: Analyzing trace with hash 156072468, now seen corresponding path program 1 times [2018-06-24 20:51:48,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:48,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:48,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:48,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,547 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,737 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 20:51:48,789 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,789 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:48,789 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:48,789 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:48,790 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:48,790 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:48,790 INFO ]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2018-06-24 20:51:48,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:48,886 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-24 20:51:48,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:48,886 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:51:48,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:48,887 INFO ]: With dead ends: 16 [2018-06-24 20:51:48,887 INFO ]: Without dead ends: 16 [2018-06-24 20:51:48,887 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:48,887 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:51:48,889 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 20:51:48,889 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:48,889 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-06-24 20:51:48,889 INFO ]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 7 [2018-06-24 20:51:48,889 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:48,889 INFO ]: Abstraction has 13 states and 25 transitions. [2018-06-24 20:51:48,889 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:48,890 INFO ]: Start isEmpty. Operand 13 states and 25 transitions. [2018-06-24 20:51:48,890 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:48,890 INFO ]: Found error trace [2018-06-24 20:51:48,890 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:48,890 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:48,890 INFO ]: Analyzing trace with hash 156907577, now seen corresponding path program 1 times [2018-06-24 20:51:48,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:48,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:48,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:48,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,909 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,991 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,991 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:48,991 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:51:48,991 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:51:48,991 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:51:48,991 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:48,991 INFO ]: Start difference. First operand 13 states and 25 transitions. Second operand 5 states. [2018-06-24 20:51:49,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:49,046 INFO ]: Finished difference Result 28 states and 53 transitions. [2018-06-24 20:51:49,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:51:49,047 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:51:49,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:49,048 INFO ]: With dead ends: 28 [2018-06-24 20:51:49,048 INFO ]: Without dead ends: 28 [2018-06-24 20:51:49,048 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:49,048 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:51:49,051 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-06-24 20:51:49,052 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:49,052 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2018-06-24 20:51:49,052 INFO ]: Start accepts. Automaton has 16 states and 31 transitions. Word has length 7 [2018-06-24 20:51:49,052 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:49,052 INFO ]: Abstraction has 16 states and 31 transitions. [2018-06-24 20:51:49,052 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:51:49,052 INFO ]: Start isEmpty. Operand 16 states and 31 transitions. [2018-06-24 20:51:49,053 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:49,053 INFO ]: Found error trace [2018-06-24 20:51:49,053 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:49,053 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:49,053 INFO ]: Analyzing trace with hash 185536728, now seen corresponding path program 1 times [2018-06-24 20:51:49,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:49,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:49,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:49,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:49,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:49,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:49,099 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:49,100 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:49,100 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:49,100 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:49,100 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:49,100 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:49,100 INFO ]: Start difference. First operand 16 states and 31 transitions. Second operand 4 states. [2018-06-24 20:51:49,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:49,125 INFO ]: Finished difference Result 21 states and 42 transitions. [2018-06-24 20:51:49,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:49,128 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:51:49,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:49,128 INFO ]: With dead ends: 21 [2018-06-24 20:51:49,128 INFO ]: Without dead ends: 21 [2018-06-24 20:51:49,129 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:49,129 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:51:49,130 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-06-24 20:51:49,130 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:49,131 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-24 20:51:49,131 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 7 [2018-06-24 20:51:49,131 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:49,131 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-24 20:51:49,131 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:49,131 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-24 20:51:49,131 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:49,131 INFO ]: Found error trace [2018-06-24 20:51:49,131 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:49,131 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:49,132 INFO ]: Analyzing trace with hash 296417869, now seen corresponding path program 1 times [2018-06-24 20:51:49,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:49,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:49,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:49,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:49,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:49,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:49,204 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:49,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:49,204 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:49,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:49,240 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:49,247 INFO ]: Computing forward predicates... [2018-06-24 20:51:49,318 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:49,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:49,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:51:49,350 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:51:49,351 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:51:49,351 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:51:49,351 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 7 states. [2018-06-24 20:51:49,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:49,936 INFO ]: Finished difference Result 19 states and 35 transitions. [2018-06-24 20:51:49,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:49,937 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:51:49,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:49,937 INFO ]: With dead ends: 19 [2018-06-24 20:51:49,937 INFO ]: Without dead ends: 9 [2018-06-24 20:51:49,937 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:49,937 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:51:49,938 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:51:49,938 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:51:49,939 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-06-24 20:51:49,939 INFO ]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 7 [2018-06-24 20:51:49,939 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:49,939 INFO ]: Abstraction has 9 states and 14 transitions. [2018-06-24 20:51:49,939 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:51:49,939 INFO ]: Start isEmpty. Operand 9 states and 14 transitions. [2018-06-24 20:51:49,939 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:49,939 INFO ]: Found error trace [2018-06-24 20:51:49,939 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:49,939 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:49,939 INFO ]: Analyzing trace with hash 568091384, now seen corresponding path program 1 times [2018-06-24 20:51:49,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:49,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:49,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:49,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:49,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:49,952 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,029 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,029 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:50,029 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:51:50,029 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:50,030 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:50,030 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:50,030 INFO ]: Start difference. First operand 9 states and 14 transitions. Second operand 6 states. [2018-06-24 20:51:50,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:50,145 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-24 20:51:50,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:50,147 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:51:50,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:50,148 INFO ]: With dead ends: 19 [2018-06-24 20:51:50,148 INFO ]: Without dead ends: 19 [2018-06-24 20:51:50,148 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:50,148 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:51:50,150 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-24 20:51:50,150 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:50,151 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-24 20:51:50,151 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 8 [2018-06-24 20:51:50,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:50,151 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-24 20:51:50,151 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:50,151 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-24 20:51:50,151 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:50,151 INFO ]: Found error trace [2018-06-24 20:51:50,151 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:50,151 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:50,152 INFO ]: Analyzing trace with hash 1455595065, now seen corresponding path program 1 times [2018-06-24 20:51:50,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:50,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:50,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,189 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,189 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:50,190 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:51:50,190 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:50,190 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:50,190 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:50,190 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. [2018-06-24 20:51:50,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:50,259 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-24 20:51:50,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:50,262 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:51:50,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:50,262 INFO ]: With dead ends: 17 [2018-06-24 20:51:50,262 INFO ]: Without dead ends: 13 [2018-06-24 20:51:50,262 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:50,262 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:51:50,263 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:51:50,263 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:50,264 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 20:51:50,264 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 8 [2018-06-24 20:51:50,264 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:50,264 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 20:51:50,264 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:50,264 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 20:51:50,264 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:50,264 INFO ]: Found error trace [2018-06-24 20:51:50,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:50,264 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:50,264 INFO ]: Analyzing trace with hash -34310079, now seen corresponding path program 1 times [2018-06-24 20:51:50,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:50,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:50,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,274 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,348 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:50,348 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:51:50,348 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:50,348 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:50,348 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:50,349 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 6 states. [2018-06-24 20:51:50,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:50,432 INFO ]: Finished difference Result 23 states and 35 transitions. [2018-06-24 20:51:50,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:50,433 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:51:50,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:50,433 INFO ]: With dead ends: 23 [2018-06-24 20:51:50,433 INFO ]: Without dead ends: 23 [2018-06-24 20:51:50,434 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:50,434 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:51:50,435 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-06-24 20:51:50,435 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:50,436 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 20:51:50,436 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 8 [2018-06-24 20:51:50,436 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:50,436 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 20:51:50,436 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:50,436 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 20:51:50,436 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:50,436 INFO ]: Found error trace [2018-06-24 20:51:50,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:50,436 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:50,436 INFO ]: Analyzing trace with hash 108241030, now seen corresponding path program 1 times [2018-06-24 20:51:50,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:50,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:50,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,443 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,483 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:50,483 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:51:50,483 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:50,483 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:50,483 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:50,484 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 6 states. [2018-06-24 20:51:50,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:50,525 INFO ]: Finished difference Result 20 states and 31 transitions. [2018-06-24 20:51:50,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:50,527 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:51:50,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:50,527 INFO ]: With dead ends: 20 [2018-06-24 20:51:50,527 INFO ]: Without dead ends: 18 [2018-06-24 20:51:50,527 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:50,528 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:51:50,529 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-24 20:51:50,529 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:51:50,529 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-24 20:51:50,529 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 8 [2018-06-24 20:51:50,529 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:50,529 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-24 20:51:50,529 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:50,529 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-24 20:51:50,530 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:50,530 INFO ]: Found error trace [2018-06-24 20:51:50,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:50,530 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:50,530 INFO ]: Analyzing trace with hash 430811034, now seen corresponding path program 1 times [2018-06-24 20:51:50,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:50,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:50,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,539 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,604 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,604 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:50,604 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:50,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,648 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,650 INFO ]: Computing forward predicates... [2018-06-24 20:51:50,738 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,758 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:51:50,758 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-24 20:51:50,758 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:51:50,758 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:51:50,758 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:51:50,758 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 7 states. [2018-06-24 20:51:50,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:50,813 INFO ]: Finished difference Result 20 states and 31 transitions. [2018-06-24 20:51:50,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:50,814 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:51:50,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:50,814 INFO ]: With dead ends: 20 [2018-06-24 20:51:50,814 INFO ]: Without dead ends: 17 [2018-06-24 20:51:50,815 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:50,815 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:51:50,816 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 20:51:50,816 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:51:50,816 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-24 20:51:50,816 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 9 [2018-06-24 20:51:50,816 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:50,816 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-24 20:51:50,816 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:51:50,817 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-24 20:51:50,817 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:50,817 INFO ]: Found error trace [2018-06-24 20:51:50,817 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:50,817 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:50,817 INFO ]: Analyzing trace with hash 455775892, now seen corresponding path program 1 times [2018-06-24 20:51:50,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:50,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:50,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,830 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:50,990 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:50,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:50,990 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:51:50,990 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:50,990 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:50,990 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:50,990 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 6 states. [2018-06-24 20:51:51,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:51,027 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-24 20:51:51,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:51,027 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 20:51:51,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:51,028 INFO ]: With dead ends: 18 [2018-06-24 20:51:51,028 INFO ]: Without dead ends: 17 [2018-06-24 20:51:51,028 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:51,028 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:51:51,029 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-24 20:51:51,029 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:51,030 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-06-24 20:51:51,030 INFO ]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-06-24 20:51:51,030 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:51,030 INFO ]: Abstraction has 16 states and 22 transitions. [2018-06-24 20:51:51,030 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:51,030 INFO ]: Start isEmpty. Operand 16 states and 22 transitions. [2018-06-24 20:51:51,030 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:51,030 INFO ]: Found error trace [2018-06-24 20:51:51,030 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:51,030 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:51,030 INFO ]: Analyzing trace with hash 484405043, now seen corresponding path program 1 times [2018-06-24 20:51:51,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:51,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:51,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:51,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:51,162 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:51,162 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:51,162 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:51,163 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:51,163 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:51,163 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:51,163 INFO ]: Start difference. First operand 16 states and 22 transitions. Second operand 4 states. [2018-06-24 20:51:51,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:51,188 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-24 20:51:51,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:51,188 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 20:51:51,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:51,188 INFO ]: With dead ends: 14 [2018-06-24 20:51:51,188 INFO ]: Without dead ends: 11 [2018-06-24 20:51:51,189 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:51,189 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:51:51,190 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:51:51,190 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:51:51,190 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 20:51:51,190 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-24 20:51:51,190 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:51,190 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 20:51:51,190 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:51,190 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 20:51:51,190 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:51:51,190 INFO ]: Found error trace [2018-06-24 20:51:51,190 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:51,190 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:51,190 INFO ]: Analyzing trace with hash 1243998078, now seen corresponding path program 1 times [2018-06-24 20:51:51,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:51,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:51,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:51,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,205 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:51,344 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:51,344 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:51,344 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:51,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:51,377 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:51,380 INFO ]: Computing forward predicates... [2018-06-24 20:51:51,489 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:51,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:51,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:51:51,509 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:51:51,509 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:51:51,509 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:51,509 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 10 states. [2018-06-24 20:51:51,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:51,781 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-24 20:51:51,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:51:51,781 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:51:51,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:51,781 INFO ]: With dead ends: 17 [2018-06-24 20:51:51,781 INFO ]: Without dead ends: 17 [2018-06-24 20:51:51,782 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:51:51,782 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:51:51,783 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-24 20:51:51,783 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:51:51,783 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-24 20:51:51,783 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2018-06-24 20:51:51,784 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:51,784 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-24 20:51:51,784 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:51:51,784 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-24 20:51:51,784 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:51:51,784 INFO ]: Found error trace [2018-06-24 20:51:51,784 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:51,784 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:51,784 INFO ]: Analyzing trace with hash -90917932, now seen corresponding path program 2 times [2018-06-24 20:51:51,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:51,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:51,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:51,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,795 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:52,107 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:52,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:52,107 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:52,114 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:52,152 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:52,152 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:52,155 INFO ]: Computing forward predicates... [2018-06-24 20:51:52,301 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:52,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:52,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:51:52,320 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:51:52,321 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:51:52,321 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:52,321 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2018-06-24 20:51:52,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:52,448 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:51:52,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:51:52,449 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:51:52,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:52,449 INFO ]: With dead ends: 16 [2018-06-24 20:51:52,449 INFO ]: Without dead ends: 12 [2018-06-24 20:51:52,449 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:51:52,449 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:51:52,450 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:51:52,450 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:51:52,450 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 20:51:52,450 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 11 [2018-06-24 20:51:52,450 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:52,450 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 20:51:52,450 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:51:52,450 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 20:51:52,450 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:51:52,450 INFO ]: Found error trace [2018-06-24 20:51:52,450 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:52,450 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:52,450 INFO ]: Analyzing trace with hash 682992666, now seen corresponding path program 3 times [2018-06-24 20:51:52,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:52,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:52,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:52,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:52,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:52,466 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:52,700 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:52,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:52,701 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:51:52,715 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:52,749 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:51:52,749 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:52,751 INFO ]: Computing forward predicates... [2018-06-24 20:51:52,805 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:52,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:52,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-06-24 20:51:52,825 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:51:52,825 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:51:52,825 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:52,825 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 10 states. [2018-06-24 20:51:52,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:52,873 INFO ]: Finished difference Result 13 states and 15 transitions. [2018-06-24 20:51:52,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:51:52,873 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:51:52,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:52,874 INFO ]: With dead ends: 13 [2018-06-24 20:51:52,874 INFO ]: Without dead ends: 13 [2018-06-24 20:51:52,874 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:51:52,874 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:51:52,875 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:51:52,875 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:52,875 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 20:51:52,875 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-24 20:51:52,875 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:52,875 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 20:51:52,875 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:51:52,875 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 20:51:52,876 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:51:52,876 INFO ]: Found error trace [2018-06-24 20:51:52,876 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:52,876 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:52,876 INFO ]: Analyzing trace with hash -302216520, now seen corresponding path program 4 times [2018-06-24 20:51:52,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:52,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:52,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:52,876 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:52,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:52,895 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:53,402 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:53,402 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:53,402 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:53,408 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:53,447 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:53,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:53,451 INFO ]: Computing forward predicates... [2018-06-24 20:51:53,705 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:53,729 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:53,729 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-24 20:51:53,729 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:51:53,729 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:51:53,729 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:51:53,729 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 14 states. [2018-06-24 20:51:53,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:53,991 INFO ]: Finished difference Result 20 states and 24 transitions. [2018-06-24 20:51:53,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:51:53,991 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-24 20:51:53,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:53,992 INFO ]: With dead ends: 20 [2018-06-24 20:51:53,992 INFO ]: Without dead ends: 20 [2018-06-24 20:51:53,992 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:51:53,992 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:51:53,994 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-24 20:51:53,994 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:53,994 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-24 20:51:53,994 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2018-06-24 20:51:53,994 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:53,994 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-24 20:51:53,994 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:51:53,994 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-24 20:51:53,994 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:51:53,994 INFO ]: Found error trace [2018-06-24 20:51:53,994 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:53,994 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:53,995 INFO ]: Analyzing trace with hash -778930214, now seen corresponding path program 5 times [2018-06-24 20:51:53,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:53,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:53,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:53,995 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:53,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,008 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,086 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:54,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:54,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:54,093 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:54,137 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:51:54,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,139 INFO ]: Computing forward predicates... [2018-06-24 20:51:54,382 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:54,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:54,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:51:54,414 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:51:54,414 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:51:54,414 INFO ]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:51:54,414 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 13 states. [2018-06-24 20:51:54,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:54,551 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 20:51:54,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:51:54,551 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-24 20:51:54,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:54,551 INFO ]: With dead ends: 19 [2018-06-24 20:51:54,551 INFO ]: Without dead ends: 14 [2018-06-24 20:51:54,551 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:51:54,552 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:51:54,552 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:51:54,552 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:51:54,553 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:51:54,553 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 13 [2018-06-24 20:51:54,553 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:54,553 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:51:54,553 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:51:54,553 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:51:54,553 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:51:54,553 INFO ]: Found error trace [2018-06-24 20:51:54,553 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:54,553 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:54,553 INFO ]: Analyzing trace with hash 1737461844, now seen corresponding path program 6 times [2018-06-24 20:51:54,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:54,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:54,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:54,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,625 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:54,626 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:54,626 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:54,631 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:54,659 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:51:54,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,661 INFO ]: Computing forward predicates... [2018-06-24 20:51:54,711 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:54,732 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:54,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-06-24 20:51:54,732 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:51:54,732 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:51:54,732 INFO ]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:51:54,732 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 13 states. [2018-06-24 20:51:54,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:54,815 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-24 20:51:54,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:54,816 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-24 20:51:54,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:54,816 INFO ]: With dead ends: 15 [2018-06-24 20:51:54,816 INFO ]: Without dead ends: 15 [2018-06-24 20:51:54,816 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:51:54,816 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:51:54,817 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:51:54,817 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:51:54,817 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-24 20:51:54,817 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-24 20:51:54,817 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:54,817 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-24 20:51:54,817 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:51:54,817 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-24 20:51:54,818 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:51:54,818 INFO ]: Found error trace [2018-06-24 20:51:54,818 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:54,818 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:54,818 INFO ]: Analyzing trace with hash -1973410370, now seen corresponding path program 7 times [2018-06-24 20:51:54,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:54,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:54,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,818 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:54,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,948 INFO ]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:51:54,948 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:54,948 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:54,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:54,984 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,988 INFO ]: Computing forward predicates... [2018-06-24 20:51:55,150 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:55,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:55,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 16 [2018-06-24 20:51:55,169 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:51:55,169 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:51:55,170 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:55,170 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 16 states. [2018-06-24 20:51:55,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:55,569 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 20:51:55,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:55,569 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:51:55,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:55,569 INFO ]: With dead ends: 19 [2018-06-24 20:51:55,569 INFO ]: Without dead ends: 0 [2018-06-24 20:51:55,570 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:51:55,570 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 20:51:55,570 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 20:51:55,570 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 20:51:55,570 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 20:51:55,570 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-06-24 20:51:55,570 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:55,570 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 20:51:55,570 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:51:55,570 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 20:51:55,570 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 20:51:55,572 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:51:55,573 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:51:55 BasicIcfg [2018-06-24 20:51:55,573 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:51:55,574 INFO ]: Toolchain (without parser) took 9497.93 ms. Allocated memory was 302.0 MB in the beginning and 420.5 MB in the end (delta: 118.5 MB). Free memory was 255.4 MB in the beginning and 367.0 MB in the end (delta: -111.6 MB). Peak memory consumption was 6.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:55,575 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:51:55,575 INFO ]: ChcToBoogie took 69.66 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 252.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:55,575 INFO ]: Boogie Preprocessor took 54.44 ms. Allocated memory is still 302.0 MB. Free memory was 252.3 MB in the beginning and 251.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:51:55,576 INFO ]: RCFGBuilder took 434.28 ms. Allocated memory is still 302.0 MB. Free memory was 251.3 MB in the beginning and 235.3 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:55,576 INFO ]: BlockEncodingV2 took 354.84 ms. Allocated memory is still 302.0 MB. Free memory was 235.3 MB in the beginning and 223.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:55,576 INFO ]: TraceAbstraction took 8571.43 ms. Allocated memory was 302.0 MB in the beginning and 420.5 MB in the end (delta: 118.5 MB). Free memory was 223.3 MB in the beginning and 367.0 MB in the end (delta: -143.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:51:55,579 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 16 locations, 24 edges - StatisticsResult: Encoded RCFG 9 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.66 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 252.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.44 ms. Allocated memory is still 302.0 MB. Free memory was 252.3 MB in the beginning and 251.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 434.28 ms. Allocated memory is still 302.0 MB. Free memory was 251.3 MB in the beginning and 235.3 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 354.84 ms. Allocated memory is still 302.0 MB. Free memory was 235.3 MB in the beginning and 223.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 8571.43 ms. Allocated memory was 302.0 MB in the beginning and 420.5 MB in the end (delta: 118.5 MB). Free memory was 223.3 MB in the beginning and 367.0 MB in the end (delta: -143.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 locations, 1 error locations. SAFE Result, 8.5s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 364 SDtfs, 259 SDslu, 903 SDs, 0 SdLazy, 750 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 107 SyntacticMatches, 12 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=9, 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.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 90 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 15598 SizeOfPredicates, 221 NumberOfNonLiveVariables, 2047 ConjunctsInSsa, 545 ConjunctsInUnsatCore, 34 InterpolantComputations, 17 PerfectInterpolantSequences, 43/98 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-51-55-589.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-51-55-589.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-51-55-589.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-51-55-589.csv Received shutdown request...