java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:38:23,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:38:23,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:38:23,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:38:23,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:38:23,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:38:23,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:38:23,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:38:23,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:38:23,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:38:23,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:38:23,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:38:23,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:38:23,237 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:38:23,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:38:23,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:38:23,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:38:23,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:38:23,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:38:23,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:38:23,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:38:23,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:38:23,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:38:23,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:38:23,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:38:23,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:38:23,251 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:38:23,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:38:23,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:38:23,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:38:23,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:38:23,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:38:23,254 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:38:23,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:38:23,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:38:23,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:38:23,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:38:23,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:38:23,271 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:38:23,271 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:38:23,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:38:23,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:38:23,273 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:38:23,273 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:38:23,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:38:23,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:38:23,274 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:38:23,274 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:38:23,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:38:23,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:38:23,274 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:38:23,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:38:23,275 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:38:23,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:38:23,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:38:23,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:38:23,276 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:38:23,277 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:38:23,277 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:38:23,325 INFO ]: Repository-Root is: /tmp [2018-06-25 06:38:23,345 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:38:23,351 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:38:23,355 INFO ]: Initializing SmtParser... [2018-06-25 06:38:23,355 INFO ]: SmtParser initialized [2018-06-25 06:38:23,356 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_1.smt2 [2018-06-25 06:38:23,357 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 06:38:23,459 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_1.smt2 unknown [2018-06-25 06:38:23,973 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMER_1.smt2 [2018-06-25 06:38:23,977 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:38:23,993 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:38:23,993 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:38:23,993 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:38:23,993 INFO ]: ChcToBoogie initialized [2018-06-25 06:38:23,996 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:38:23" (1/1) ... [2018-06-25 06:38:24,092 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24 Unit [2018-06-25 06:38:24,092 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:38:24,094 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:38:24,094 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:38:24,094 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:38:24,114 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,114 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,120 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,120 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,125 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,127 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,129 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,131 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:38:24,132 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:38:24,132 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:38:24,132 INFO ]: RCFGBuilder initialized [2018-06-25 06:38:24,133 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 06:38:24,157 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:38:24,157 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:38:24,157 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:38:24,158 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:38:24,158 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:38:24,158 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:38:24,433 INFO ]: Using library mode [2018-06-25 06:38:24,434 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:38:24 BoogieIcfgContainer [2018-06-25 06:38:24,434 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:38:24,435 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:38:24,435 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:38:24,438 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:38:24,439 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:38:24" (1/1) ... [2018-06-25 06:38:24,457 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:38:24,459 INFO ]: Using Remove infeasible edges [2018-06-25 06:38:24,459 INFO ]: Using Maximize final states [2018-06-25 06:38:24,461 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:38:24,462 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:38:24,463 INFO ]: Using Remove sink states [2018-06-25 06:38:24,464 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:38:24,464 INFO ]: Using Use SBE [2018-06-25 06:38:24,474 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:38:26,033 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:38:26,204 WARN ]: Simplifying disjunction of 9600 conjuctions. This might take some time... [2018-06-25 06:38:34,350 INFO ]: Simplified to disjunction of 5400 conjuctions. [2018-06-25 06:38:34,518 WARN ]: aborting because of expected exponential blowup for input size 47 [2018-06-25 06:38:34,702 WARN ]: aborting because of expected exponential blowup for input size 47 [2018-06-25 06:38:34,770 INFO ]: SBE split 2 edges [2018-06-25 06:38:34,865 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:38:34,870 INFO ]: 0 new accepting states [2018-06-25 06:38:50,432 INFO ]: Removed 1578 edges and 2 locations by large block encoding [2018-06-25 06:38:50,434 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:38:50,555 INFO ]: Removed 306 edges and 0 locations because of local infeasibility [2018-06-25 06:38:50,556 INFO ]: 0 new accepting states [2018-06-25 06:38:50,557 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:38:50,558 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:38:50,597 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:38:50,598 INFO ]: 0 new accepting states [2018-06-25 06:38:50,600 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:38:50,600 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:38:50,662 INFO ]: Encoded RCFG 6 locations, 1274 edges [2018-06-25 06:38:50,662 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:38:50 BasicIcfg [2018-06-25 06:38:50,662 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:38:50,664 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:38:50,664 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:38:51,077 INFO ]: TraceAbstraction initialized [2018-06-25 06:38:51,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:38:23" (1/4) ... [2018-06-25 06:38:51,085 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bff16dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:38:51, skipping insertion in model container [2018-06-25 06:38:51,085 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:38:24" (2/4) ... [2018-06-25 06:38:51,085 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bff16dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:38:51, skipping insertion in model container [2018-06-25 06:38:51,085 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:38:24" (3/4) ... [2018-06-25 06:38:51,086 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bff16dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:38:51, skipping insertion in model container [2018-06-25 06:38:51,086 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:38:50" (4/4) ... [2018-06-25 06:38:51,087 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:38:51,101 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:38:51,190 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:38:52,407 INFO ]: Using default assertion order modulation [2018-06-25 06:38:52,407 INFO ]: Interprodecural is true [2018-06-25 06:38:52,407 INFO ]: Hoare is false [2018-06-25 06:38:52,407 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:38:52,407 INFO ]: Backedges is TWOTRACK [2018-06-25 06:38:52,407 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:38:52,407 INFO ]: Difference is false [2018-06-25 06:38:52,407 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:38:52,407 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:38:52,563 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:38:52,710 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:38:52,710 INFO ]: Found error trace [2018-06-25 06:38:52,725 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:38:52,726 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:38:52,752 INFO ]: Analyzing trace with hash 99060163, now seen corresponding path program 1 times [2018-06-25 06:38:52,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:38:52,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:38:52,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:38:52,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:38:52,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:38:53,027 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:38:53,166 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:38:53,213 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:38:53,214 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:38:53,215 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:38:53,262 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:38:53,262 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:38:53,328 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:38:56,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:38:56,253 INFO ]: Finished difference Result 8 states and 1294 transitions. [2018-06-25 06:38:56,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:38:56,255 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:38:56,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:38:56,354 INFO ]: With dead ends: 8 [2018-06-25 06:38:56,354 INFO ]: Without dead ends: 8 [2018-06-25 06:38:56,356 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:38:56,499 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:38:56,671 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:38:56,698 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:38:56,701 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1293 transitions. [2018-06-25 06:38:56,702 INFO ]: Start accepts. Automaton has 7 states and 1293 transitions. Word has length 5 [2018-06-25 06:38:56,704 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:38:56,704 INFO ]: Abstraction has 7 states and 1293 transitions. [2018-06-25 06:38:56,704 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:38:56,704 INFO ]: Start isEmpty. Operand 7 states and 1293 transitions. [2018-06-25 06:38:56,705 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:38:56,705 INFO ]: Found error trace [2018-06-25 06:38:56,705 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:38:56,705 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:38:56,705 INFO ]: Analyzing trace with hash 98842977, now seen corresponding path program 1 times [2018-06-25 06:38:56,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:38:56,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:38:56,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:38:56,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:38:56,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:38:56,745 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:38:56,784 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:38:56,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:38:56,785 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:38:56,786 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:38:56,786 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:38:56,786 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:38:56,786 INFO ]: Start difference. First operand 7 states and 1293 transitions. Second operand 3 states. [2018-06-25 06:38:59,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:38:59,394 INFO ]: Finished difference Result 8 states and 1276 transitions. [2018-06-25 06:38:59,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:38:59,419 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:38:59,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:38:59,420 INFO ]: With dead ends: 8 [2018-06-25 06:38:59,420 INFO ]: Without dead ends: 8 [2018-06-25 06:38:59,421 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:38:59,421 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:38:59,429 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:38:59,429 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:38:59,432 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1275 transitions. [2018-06-25 06:38:59,432 INFO ]: Start accepts. Automaton has 7 states and 1275 transitions. Word has length 5 [2018-06-25 06:38:59,432 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:38:59,432 INFO ]: Abstraction has 7 states and 1275 transitions. [2018-06-25 06:38:59,432 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:38:59,432 INFO ]: Start isEmpty. Operand 7 states and 1275 transitions. [2018-06-25 06:38:59,433 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:38:59,433 INFO ]: Found error trace [2018-06-25 06:38:59,433 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:38:59,433 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:38:59,433 INFO ]: Analyzing trace with hash -1312674571, now seen corresponding path program 1 times [2018-06-25 06:38:59,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:38:59,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:38:59,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:38:59,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:38:59,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:38:59,480 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:38:59,525 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:38:59,525 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:38:59,525 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:38:59,526 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:38:59,526 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:38:59,526 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:38:59,526 INFO ]: Start difference. First operand 7 states and 1275 transitions. Second operand 3 states. [2018-06-25 06:39:01,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:01,015 INFO ]: Finished difference Result 9 states and 1276 transitions. [2018-06-25 06:39:01,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:01,015 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:01,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:01,016 INFO ]: With dead ends: 9 [2018-06-25 06:39:01,016 INFO ]: Without dead ends: 8 [2018-06-25 06:39:01,017 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:01,017 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:01,024 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:39:01,025 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:01,026 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2018-06-25 06:39:01,026 INFO ]: Start accepts. Automaton has 7 states and 763 transitions. Word has length 6 [2018-06-25 06:39:01,026 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:01,026 INFO ]: Abstraction has 7 states and 763 transitions. [2018-06-25 06:39:01,026 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:01,026 INFO ]: Start isEmpty. Operand 7 states and 763 transitions. [2018-06-25 06:39:01,027 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:01,027 INFO ]: Found error trace [2018-06-25 06:39:01,027 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:01,027 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:01,027 INFO ]: Analyzing trace with hash -1311751050, now seen corresponding path program 1 times [2018-06-25 06:39:01,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:01,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:01,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:01,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:01,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:01,058 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:01,136 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:01,136 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:01,136 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:01,136 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:01,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:01,136 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:01,136 INFO ]: Start difference. First operand 7 states and 763 transitions. Second operand 3 states. [2018-06-25 06:39:01,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:01,935 INFO ]: Finished difference Result 8 states and 763 transitions. [2018-06-25 06:39:01,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:01,938 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:01,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:01,939 INFO ]: With dead ends: 8 [2018-06-25 06:39:01,939 INFO ]: Without dead ends: 7 [2018-06-25 06:39:01,939 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:01,939 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:01,943 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:01,943 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:01,944 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 507 transitions. [2018-06-25 06:39:01,944 INFO ]: Start accepts. Automaton has 7 states and 507 transitions. Word has length 6 [2018-06-25 06:39:01,944 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:01,944 INFO ]: Abstraction has 7 states and 507 transitions. [2018-06-25 06:39:01,944 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:01,944 INFO ]: Start isEmpty. Operand 7 states and 507 transitions. [2018-06-25 06:39:01,944 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:01,944 INFO ]: Found error trace [2018-06-25 06:39:01,944 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:01,944 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:01,944 INFO ]: Analyzing trace with hash -839831819, now seen corresponding path program 1 times [2018-06-25 06:39:01,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:01,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:01,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:01,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:01,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:01,984 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:02,029 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:02,030 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:02,030 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:02,030 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:02,030 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:02,030 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:02,030 INFO ]: Start difference. First operand 7 states and 507 transitions. Second operand 3 states. [2018-06-25 06:39:03,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:03,003 INFO ]: Finished difference Result 8 states and 507 transitions. [2018-06-25 06:39:03,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:03,003 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:03,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:03,004 INFO ]: With dead ends: 8 [2018-06-25 06:39:03,004 INFO ]: Without dead ends: 7 [2018-06-25 06:39:03,004 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:03,004 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:03,006 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:03,006 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:03,007 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 379 transitions. [2018-06-25 06:39:03,007 INFO ]: Start accepts. Automaton has 7 states and 379 transitions. Word has length 6 [2018-06-25 06:39:03,007 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:03,007 INFO ]: Abstraction has 7 states and 379 transitions. [2018-06-25 06:39:03,007 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:03,007 INFO ]: Start isEmpty. Operand 7 states and 379 transitions. [2018-06-25 06:39:03,008 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:03,008 INFO ]: Found error trace [2018-06-25 06:39:03,008 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:03,008 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:03,008 INFO ]: Analyzing trace with hash -1075329674, now seen corresponding path program 1 times [2018-06-25 06:39:03,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:03,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:03,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:03,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:03,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:03,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:03,083 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:03,083 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:03,083 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:39:03,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:03,214 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:03,221 INFO ]: Computing forward predicates... [2018-06-25 06:39:03,313 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:03,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:03,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:39:03,348 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:39:03,348 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:39:03,348 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:39:03,348 INFO ]: Start difference. First operand 7 states and 379 transitions. Second operand 4 states. [2018-06-25 06:39:04,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:04,942 INFO ]: Finished difference Result 8 states and 292 transitions. [2018-06-25 06:39:05,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:39:05,130 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:39:05,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:05,131 INFO ]: With dead ends: 8 [2018-06-25 06:39:05,131 INFO ]: Without dead ends: 8 [2018-06-25 06:39:05,131 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 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-25 06:39:05,131 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:05,134 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:39:05,134 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:05,135 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 291 transitions. [2018-06-25 06:39:05,135 INFO ]: Start accepts. Automaton has 7 states and 291 transitions. Word has length 6 [2018-06-25 06:39:05,135 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:05,135 INFO ]: Abstraction has 7 states and 291 transitions. [2018-06-25 06:39:05,135 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:39:05,135 INFO ]: Start isEmpty. Operand 7 states and 291 transitions. [2018-06-25 06:39:05,135 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:05,135 INFO ]: Found error trace [2018-06-25 06:39:05,135 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:05,136 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:05,136 INFO ]: Analyzing trace with hash -1075576651, now seen corresponding path program 1 times [2018-06-25 06:39:05,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:05,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:05,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:05,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:05,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:05,158 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:05,313 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:05,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:05,313 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-25 06:39:05,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:05,398 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:05,401 INFO ]: Computing forward predicates... [2018-06-25 06:39:05,486 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:05,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:05,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 06:39:05,507 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:39:05,507 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:39:05,507 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:39:05,507 INFO ]: Start difference. First operand 7 states and 291 transitions. Second operand 5 states. [2018-06-25 06:39:06,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:06,342 INFO ]: Finished difference Result 9 states and 293 transitions. [2018-06-25 06:39:06,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:39:06,342 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:39:06,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:06,343 INFO ]: With dead ends: 9 [2018-06-25 06:39:06,343 INFO ]: Without dead ends: 7 [2018-06-25 06:39:06,343 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:39:06,343 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:06,345 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:06,345 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:06,345 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 259 transitions. [2018-06-25 06:39:06,346 INFO ]: Start accepts. Automaton has 7 states and 259 transitions. Word has length 6 [2018-06-25 06:39:06,346 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:06,346 INFO ]: Abstraction has 7 states and 259 transitions. [2018-06-25 06:39:06,346 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:39:06,346 INFO ]: Start isEmpty. Operand 7 states and 259 transitions. [2018-06-25 06:39:06,346 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:06,346 INFO ]: Found error trace [2018-06-25 06:39:06,346 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:06,346 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:06,346 INFO ]: Analyzing trace with hash -958289484, now seen corresponding path program 1 times [2018-06-25 06:39:06,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:06,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:06,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:06,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:06,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:06,372 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:06,484 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:06,485 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:06,485 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:06,485 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:06,485 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:06,485 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:06,485 INFO ]: Start difference. First operand 7 states and 259 transitions. Second operand 3 states. [2018-06-25 06:39:07,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:07,274 INFO ]: Finished difference Result 8 states and 259 transitions. [2018-06-25 06:39:07,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:07,274 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:07,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:07,275 INFO ]: With dead ends: 8 [2018-06-25 06:39:07,275 INFO ]: Without dead ends: 7 [2018-06-25 06:39:07,275 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:07,275 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:07,276 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:07,276 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:07,277 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2018-06-25 06:39:07,277 INFO ]: Start accepts. Automaton has 7 states and 211 transitions. Word has length 6 [2018-06-25 06:39:07,277 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:07,277 INFO ]: Abstraction has 7 states and 211 transitions. [2018-06-25 06:39:07,277 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:07,277 INFO ]: Start isEmpty. Operand 7 states and 211 transitions. [2018-06-25 06:39:07,277 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:07,277 INFO ]: Found error trace [2018-06-25 06:39:07,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:07,277 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:07,277 INFO ]: Analyzing trace with hash -838231754, now seen corresponding path program 1 times [2018-06-25 06:39:07,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:07,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:07,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:07,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:07,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:07,296 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:07,434 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:07,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:07,434 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:07,434 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:07,434 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:07,434 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:07,434 INFO ]: Start difference. First operand 7 states and 211 transitions. Second operand 3 states. [2018-06-25 06:39:08,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:08,200 INFO ]: Finished difference Result 8 states and 211 transitions. [2018-06-25 06:39:08,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:08,201 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:08,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:08,201 INFO ]: With dead ends: 8 [2018-06-25 06:39:08,201 INFO ]: Without dead ends: 7 [2018-06-25 06:39:08,202 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:08,202 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:08,203 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:08,203 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:08,203 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2018-06-25 06:39:08,203 INFO ]: Start accepts. Automaton has 7 states and 203 transitions. Word has length 6 [2018-06-25 06:39:08,203 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:08,203 INFO ]: Abstraction has 7 states and 203 transitions. [2018-06-25 06:39:08,204 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:08,204 INFO ]: Start isEmpty. Operand 7 states and 203 transitions. [2018-06-25 06:39:08,204 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:08,204 INFO ]: Found error trace [2018-06-25 06:39:08,204 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:08,204 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:08,204 INFO ]: Analyzing trace with hash -837308233, now seen corresponding path program 1 times [2018-06-25 06:39:08,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:08,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:08,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:08,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:08,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:08,224 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:08,254 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:08,254 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:08,254 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:08,254 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:08,255 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:08,255 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:08,255 INFO ]: Start difference. First operand 7 states and 203 transitions. Second operand 3 states. [2018-06-25 06:39:08,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:08,309 INFO ]: Finished difference Result 8 states and 203 transitions. [2018-06-25 06:39:08,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:08,309 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:39:08,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:08,310 INFO ]: With dead ends: 8 [2018-06-25 06:39:08,310 INFO ]: Without dead ends: 7 [2018-06-25 06:39:08,310 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:08,310 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:39:08,311 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:39:08,311 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:39:08,312 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2018-06-25 06:39:08,312 INFO ]: Start accepts. Automaton has 7 states and 195 transitions. Word has length 6 [2018-06-25 06:39:08,312 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:08,312 INFO ]: Abstraction has 7 states and 195 transitions. [2018-06-25 06:39:08,312 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:08,312 INFO ]: Start isEmpty. Operand 7 states and 195 transitions. [2018-06-25 06:39:08,312 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:08,312 INFO ]: Found error trace [2018-06-25 06:39:08,312 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:08,312 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:08,312 INFO ]: Analyzing trace with hash -1542878277, now seen corresponding path program 1 times [2018-06-25 06:39:08,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:08,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:08,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:08,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:08,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:08,331 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:08,534 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:08,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:08,535 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) [2018-06-25 06:39:08,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:39:08,617 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:08,620 INFO ]: Computing forward predicates... [2018-06-25 06:39:08,738 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:08,774 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:08,774 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 06:39:08,774 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:39:08,774 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:39:08,774 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:39:08,774 INFO ]: Start difference. First operand 7 states and 195 transitions. Second operand 5 states. [2018-06-25 06:39:09,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:09,554 INFO ]: Finished difference Result 9 states and 197 transitions. [2018-06-25 06:39:09,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:39:09,554 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:39:09,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:09,555 INFO ]: With dead ends: 9 [2018-06-25 06:39:09,555 INFO ]: Without dead ends: 9 [2018-06-25 06:39:09,555 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:39:09,555 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:39:09,556 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 06:39:09,556 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:09,557 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2018-06-25 06:39:09,557 INFO ]: Start accepts. Automaton has 8 states and 196 transitions. Word has length 6 [2018-06-25 06:39:09,557 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:09,557 INFO ]: Abstraction has 8 states and 196 transitions. [2018-06-25 06:39:09,557 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:39:09,557 INFO ]: Start isEmpty. Operand 8 states and 196 transitions. [2018-06-25 06:39:09,557 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:09,557 INFO ]: Found error trace [2018-06-25 06:39:09,557 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:09,557 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:09,557 INFO ]: Analyzing trace with hash -1593671932, now seen corresponding path program 1 times [2018-06-25 06:39:09,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:09,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:09,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:09,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:09,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:09,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:09,716 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:09,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:09,716 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-25 06:39:09,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:09,767 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:09,770 INFO ]: Computing forward predicates... [2018-06-25 06:39:09,963 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:09,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:09,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 06:39:09,997 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:39:09,997 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:39:09,997 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:39:09,997 INFO ]: Start difference. First operand 8 states and 196 transitions. Second operand 5 states. [2018-06-25 06:39:10,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:10,633 INFO ]: Finished difference Result 12 states and 200 transitions. [2018-06-25 06:39:10,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:39:10,633 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:39:10,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:10,634 INFO ]: With dead ends: 12 [2018-06-25 06:39:10,634 INFO ]: Without dead ends: 12 [2018-06-25 06:39:10,634 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:39:10,634 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 06:39:10,636 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-25 06:39:10,636 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:10,636 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2018-06-25 06:39:10,636 INFO ]: Start accepts. Automaton has 8 states and 196 transitions. Word has length 6 [2018-06-25 06:39:10,636 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:10,636 INFO ]: Abstraction has 8 states and 196 transitions. [2018-06-25 06:39:10,636 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:39:10,636 INFO ]: Start isEmpty. Operand 8 states and 196 transitions. [2018-06-25 06:39:10,637 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:39:10,637 INFO ]: Found error trace [2018-06-25 06:39:10,637 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:39:10,637 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:10,637 INFO ]: Analyzing trace with hash -1224263532, now seen corresponding path program 1 times [2018-06-25 06:39:10,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:10,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:10,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:10,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:10,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:10,659 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:10,753 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:10,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:10,753 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:39:10,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:10,806 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:10,808 INFO ]: Computing forward predicates... [2018-06-25 06:39:10,912 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:10,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:10,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:39:10,934 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:39:10,934 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:39:10,934 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:39:10,934 INFO ]: Start difference. First operand 8 states and 196 transitions. Second operand 6 states. [2018-06-25 06:39:11,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:11,361 INFO ]: Finished difference Result 13 states and 201 transitions. [2018-06-25 06:39:11,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:39:11,361 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:39:11,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:11,362 INFO ]: With dead ends: 13 [2018-06-25 06:39:11,362 INFO ]: Without dead ends: 8 [2018-06-25 06:39:11,362 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:39:11,362 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:11,363 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:11,363 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:11,363 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2018-06-25 06:39:11,364 INFO ]: Start accepts. Automaton has 8 states and 172 transitions. Word has length 6 [2018-06-25 06:39:11,364 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:11,364 INFO ]: Abstraction has 8 states and 172 transitions. [2018-06-25 06:39:11,364 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:39:11,364 INFO ]: Start isEmpty. Operand 8 states and 172 transitions. [2018-06-25 06:39:11,364 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:39:11,364 INFO ]: Found error trace [2018-06-25 06:39:11,364 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:39:11,364 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:11,364 INFO ]: Analyzing trace with hash 1910874241, now seen corresponding path program 1 times [2018-06-25 06:39:11,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:11,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:11,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:11,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:11,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:11,381 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:11,426 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:39:11,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:39:11,426 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:39:11,426 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:39:11,426 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:39:11,426 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:11,426 INFO ]: Start difference. First operand 8 states and 172 transitions. Second operand 3 states. [2018-06-25 06:39:11,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:11,439 INFO ]: Finished difference Result 9 states and 172 transitions. [2018-06-25 06:39:11,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:39:11,440 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:39:11,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:11,440 INFO ]: With dead ends: 9 [2018-06-25 06:39:11,440 INFO ]: Without dead ends: 8 [2018-06-25 06:39:11,440 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:39:11,441 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:39:11,442 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:39:11,442 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:39:11,442 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2018-06-25 06:39:11,442 INFO ]: Start accepts. Automaton has 8 states and 168 transitions. Word has length 7 [2018-06-25 06:39:11,442 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:11,442 INFO ]: Abstraction has 8 states and 168 transitions. [2018-06-25 06:39:11,442 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:39:11,442 INFO ]: Start isEmpty. Operand 8 states and 168 transitions. [2018-06-25 06:39:11,442 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:39:11,442 INFO ]: Found error trace [2018-06-25 06:39:11,442 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:39:11,442 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:39:11,443 INFO ]: Analyzing trace with hash -1639140483, now seen corresponding path program 1 times [2018-06-25 06:39:11,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:39:11,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:39:11,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:11,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:11,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:39:11,463 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:11,595 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:11,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:39:11,596 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-25 06:39:11,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:39:11,666 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:39:11,670 INFO ]: Computing forward predicates... [2018-06-25 06:39:12,172 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:39:12,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:39:12,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:39:12,197 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:39:12,198 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:39:12,198 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:39:12,198 INFO ]: Start difference. First operand 8 states and 168 transitions. Second operand 7 states. [2018-06-25 06:39:12,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:39:12,437 INFO ]: Finished difference Result 5 states and 8 transitions. [2018-06-25 06:39:12,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:39:12,438 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:39:12,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:39:12,438 INFO ]: With dead ends: 5 [2018-06-25 06:39:12,438 INFO ]: Without dead ends: 0 [2018-06-25 06:39:12,438 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:39:12,438 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:39:12,438 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:39:12,438 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:39:12,438 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:39:12,438 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:39:12,438 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:39:12,438 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:39:12,438 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:39:12,438 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:39:12,438 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:39:12,440 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:39:12,442 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:39:12 BasicIcfg [2018-06-25 06:39:12,442 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:39:12,443 INFO ]: Toolchain (without parser) took 48465.25 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 881.9 MB). Free memory was 255.1 MB in the beginning and 244.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 892.2 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:12,444 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:39:12,444 INFO ]: ChcToBoogie took 100.14 ms. Allocated memory is still 306.7 MB. Free memory was 253.1 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:12,445 INFO ]: Boogie Preprocessor took 37.59 ms. Allocated memory is still 306.7 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:12,445 INFO ]: RCFGBuilder took 302.39 ms. Allocated memory is still 306.7 MB. Free memory was 249.2 MB in the beginning and 231.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:12,445 INFO ]: BlockEncodingV2 took 26227.55 ms. Allocated memory was 306.7 MB in the beginning and 794.3 MB in the end (delta: 487.6 MB). Free memory was 229.2 MB in the beginning and 137.2 MB in the end (delta: 92.0 MB). Peak memory consumption was 579.6 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:12,446 INFO ]: TraceAbstraction took 21778.56 ms. Allocated memory was 794.3 MB in the beginning and 1.2 GB in the end (delta: 394.3 MB). Free memory was 137.2 MB in the beginning and 244.8 MB in the end (delta: -107.6 MB). Peak memory consumption was 286.7 MB. Max. memory is 3.6 GB. [2018-06-25 06:39:12,449 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 1274 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 100.14 ms. Allocated memory is still 306.7 MB. Free memory was 253.1 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.59 ms. Allocated memory is still 306.7 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 302.39 ms. Allocated memory is still 306.7 MB. Free memory was 249.2 MB in the beginning and 231.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 26227.55 ms. Allocated memory was 306.7 MB in the beginning and 794.3 MB in the end (delta: 487.6 MB). Free memory was 229.2 MB in the beginning and 137.2 MB in the end (delta: 92.0 MB). Peak memory consumption was 579.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 21778.56 ms. Allocated memory was 794.3 MB in the beginning and 1.2 GB in the end (delta: 394.3 MB). Free memory was 137.2 MB in the beginning and 244.8 MB in the end (delta: -107.6 MB). Peak memory consumption was 286.7 MB. 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, 6 locations, 1 error locations. SAFE Result, 20.3s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6917 SDtfs, 176 SDslu, 542 SDs, 0 SdLazy, 5378 SolverSat, 4242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 9 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2553 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 9/25 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/PRODUCER_CONSUMER_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-39-12-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-39-12-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-39-12-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMER_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-39-12-460.csv Received shutdown request...