java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/swim1.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:34:41,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:34:41,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:34:41,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:34:41,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:34:41,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:34:41,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:34:41,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:34:41,276 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:34:41,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:34:41,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:34:41,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:34:41,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:34:41,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:34:41,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:34:41,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:34:41,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:34:41,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:34:41,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:34:41,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:34:41,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:34:41,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:34:41,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:34:41,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:34:41,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:34:41,293 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:34:41,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:34:41,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:34:41,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:34:41,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:34:41,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:34:41,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:34:41,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:34:41,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:34:41,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:34:41,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:34:41,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:34:41,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:34:41,314 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:34:41,315 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:34:41,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:34:41,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:34:41,316 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:34:41,316 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:34:41,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:34:41,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:34:41,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:34:41,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:34:41,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:34:41,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:34:41,318 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:34:41,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:34:41,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:34:41,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:34:41,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:34:41,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:34:41,319 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:34:41,323 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:34:41,324 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:34:41,372 INFO ]: Repository-Root is: /tmp [2018-06-25 01:34:41,385 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:34:41,390 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:34:41,393 INFO ]: Initializing SmtParser... [2018-06-25 01:34:41,393 INFO ]: SmtParser initialized [2018-06-25 01:34:41,394 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/swim1.c.smt2 [2018-06-25 01:34:41,395 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 01:34:41,483 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/swim1.c.smt2 unknown [2018-06-25 01:34:42,000 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/swim1.c.smt2 [2018-06-25 01:34:42,005 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:34:42,013 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:34:42,013 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:34:42,013 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:34:42,013 INFO ]: ChcToBoogie initialized [2018-06-25 01:34:42,016 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,095 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42 Unit [2018-06-25 01:34:42,095 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:34:42,095 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:34:42,095 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:34:42,095 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:34:42,118 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,119 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,141 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,141 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,164 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,165 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,176 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,183 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:34:42,184 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:34:42,184 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:34:42,184 INFO ]: RCFGBuilder initialized [2018-06-25 01:34:42,185 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (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 01:34:42,208 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:34:42,208 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:34:42,208 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:34:42,208 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:34:42,208 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:34:42,208 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 01:34:42,616 INFO ]: Using library mode [2018-06-25 01:34:42,617 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:34:42 BoogieIcfgContainer [2018-06-25 01:34:42,617 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:34:42,617 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:34:42,617 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:34:42,618 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:34:42,619 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:34:42" (1/1) ... [2018-06-25 01:34:42,639 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:34:42,641 INFO ]: Using Remove infeasible edges [2018-06-25 01:34:42,641 INFO ]: Using Maximize final states [2018-06-25 01:34:42,642 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:34:42,642 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:34:42,644 INFO ]: Using Remove sink states [2018-06-25 01:34:42,644 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:34:42,644 INFO ]: Using Use SBE [2018-06-25 01:34:42,654 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 01:34:43,248 WARN ]: aborting because of expected exponential blowup for input size 140 [2018-06-25 01:34:43,271 WARN ]: aborting because of expected exponential blowup for input size 140 [2018-06-25 01:34:43,271 INFO ]: SBE split 1 edges [2018-06-25 01:34:43,278 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:34:43,280 INFO ]: 0 new accepting states [2018-06-25 01:34:43,549 INFO ]: Removed 17 edges and 2 locations by large block encoding [2018-06-25 01:34:43,551 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:34:43,552 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:34:43,553 INFO ]: 0 new accepting states [2018-06-25 01:34:43,553 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:34:43,553 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:34:43,553 INFO ]: Encoded RCFG 6 locations, 19 edges [2018-06-25 01:34:43,553 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:34:43 BasicIcfg [2018-06-25 01:34:43,553 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:34:43,555 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:34:43,555 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:34:43,562 INFO ]: TraceAbstraction initialized [2018-06-25 01:34:43,562 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:34:42" (1/4) ... [2018-06-25 01:34:43,563 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73acd9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:34:43, skipping insertion in model container [2018-06-25 01:34:43,563 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:34:42" (2/4) ... [2018-06-25 01:34:43,563 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73acd9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:34:43, skipping insertion in model container [2018-06-25 01:34:43,563 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:34:42" (3/4) ... [2018-06-25 01:34:43,563 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73acd9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:34:43, skipping insertion in model container [2018-06-25 01:34:43,563 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:34:43" (4/4) ... [2018-06-25 01:34:43,567 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:34:43,576 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:34:43,584 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:34:43,641 INFO ]: Using default assertion order modulation [2018-06-25 01:34:43,642 INFO ]: Interprodecural is true [2018-06-25 01:34:43,642 INFO ]: Hoare is false [2018-06-25 01:34:43,642 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:34:43,642 INFO ]: Backedges is TWOTRACK [2018-06-25 01:34:43,642 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:34:43,642 INFO ]: Difference is false [2018-06-25 01:34:43,642 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:34:43,642 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:34:43,657 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:34:43,670 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:34:43,670 INFO ]: Found error trace [2018-06-25 01:34:43,672 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:34:43,672 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:43,678 INFO ]: Analyzing trace with hash 36083911, now seen corresponding path program 1 times [2018-06-25 01:34:43,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:43,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:43,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:43,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:43,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:43,775 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:43,884 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:43,886 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:34:43,886 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:34:43,888 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:34:43,904 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:34:43,905 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:34:43,907 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:34:44,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:44,151 INFO ]: Finished difference Result 7 states and 20 transitions. [2018-06-25 01:34:44,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:34:44,152 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:34:44,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:44,162 INFO ]: With dead ends: 7 [2018-06-25 01:34:44,162 INFO ]: Without dead ends: 7 [2018-06-25 01:34:44,164 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 01:34:44,181 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:34:44,204 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:34:44,206 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:34:44,206 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-06-25 01:34:44,207 INFO ]: Start accepts. Automaton has 7 states and 20 transitions. Word has length 5 [2018-06-25 01:34:44,208 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:44,208 INFO ]: Abstraction has 7 states and 20 transitions. [2018-06-25 01:34:44,208 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:34:44,208 INFO ]: Start isEmpty. Operand 7 states and 20 transitions. [2018-06-25 01:34:44,209 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:34:44,209 INFO ]: Found error trace [2018-06-25 01:34:44,209 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:34:44,209 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:44,209 INFO ]: Analyzing trace with hash 1117527002, now seen corresponding path program 1 times [2018-06-25 01:34:44,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:44,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:44,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:44,211 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:44,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:44,357 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:44,717 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:34:44,718 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:44,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:44,718 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 01:34:44,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:44,834 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:44,844 INFO ]: Computing forward predicates... [2018-06-25 01:34:45,585 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:45,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:45,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 01:34:45,615 INFO ]: Interpolant automaton has 5 states [2018-06-25 01:34:45,615 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 01:34:45,615 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 01:34:45,615 INFO ]: Start difference. First operand 7 states and 20 transitions. Second operand 5 states. [2018-06-25 01:34:45,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:45,947 INFO ]: Finished difference Result 11 states and 24 transitions. [2018-06-25 01:34:45,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:34:45,948 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 01:34:45,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:45,948 INFO ]: With dead ends: 11 [2018-06-25 01:34:45,948 INFO ]: Without dead ends: 11 [2018-06-25 01:34:45,949 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:45,949 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 01:34:45,951 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 01:34:45,951 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:34:45,951 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 01:34:45,951 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 6 [2018-06-25 01:34:45,951 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:45,951 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 01:34:45,951 INFO ]: Interpolant automaton has 5 states. [2018-06-25 01:34:45,951 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 01:34:45,952 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:34:45,952 INFO ]: Found error trace [2018-06-25 01:34:45,952 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:34:45,952 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:45,952 INFO ]: Analyzing trace with hash 1119374044, now seen corresponding path program 1 times [2018-06-25 01:34:45,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:45,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:45,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:45,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:45,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:46,001 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:46,145 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:46,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:46,146 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 01:34:46,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:46,221 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:46,224 INFO ]: Computing forward predicates... [2018-06-25 01:34:46,371 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:46,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:46,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 01:34:46,390 INFO ]: Interpolant automaton has 4 states [2018-06-25 01:34:46,390 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 01:34:46,390 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:34:46,391 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 4 states. [2018-06-25 01:34:46,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:46,430 INFO ]: Finished difference Result 10 states and 23 transitions. [2018-06-25 01:34:46,431 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 01:34:46,431 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 01:34:46,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:46,431 INFO ]: With dead ends: 10 [2018-06-25 01:34:46,431 INFO ]: Without dead ends: 10 [2018-06-25 01:34:46,431 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:34:46,432 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 01:34:46,433 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 01:34:46,433 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 01:34:46,433 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 01:34:46,433 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 6 [2018-06-25 01:34:46,433 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:46,433 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 01:34:46,433 INFO ]: Interpolant automaton has 4 states. [2018-06-25 01:34:46,433 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 01:34:46,434 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:34:46,434 INFO ]: Found error trace [2018-06-25 01:34:46,434 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 01:34:46,434 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:46,434 INFO ]: Analyzing trace with hash 282524455, now seen corresponding path program 2 times [2018-06-25 01:34:46,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:46,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:46,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:46,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:46,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:46,507 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:46,877 WARN ]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:34:47,135 WARN ]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:34:47,135 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:47,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:47,135 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 01:34:47,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:34:47,275 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:34:47,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:47,279 INFO ]: Computing forward predicates... [2018-06-25 01:34:48,751 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:48,783 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:48,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 01:34:48,861 INFO ]: Interpolant automaton has 6 states [2018-06-25 01:34:48,861 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 01:34:48,861 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 01:34:48,861 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 6 states. [2018-06-25 01:34:49,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:49,319 INFO ]: Finished difference Result 12 states and 25 transitions. [2018-06-25 01:34:49,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 01:34:49,319 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 01:34:49,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:49,320 INFO ]: With dead ends: 12 [2018-06-25 01:34:49,320 INFO ]: Without dead ends: 12 [2018-06-25 01:34:49,320 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-25 01:34:49,320 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 01:34:49,321 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-25 01:34:49,321 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 01:34:49,322 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-25 01:34:49,322 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 7 [2018-06-25 01:34:49,322 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:49,322 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-25 01:34:49,322 INFO ]: Interpolant automaton has 6 states. [2018-06-25 01:34:49,322 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-25 01:34:49,322 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:34:49,322 INFO ]: Found error trace [2018-06-25 01:34:49,322 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 01:34:49,322 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:49,322 INFO ]: Analyzing trace with hash 1942256636, now seen corresponding path program 2 times [2018-06-25 01:34:49,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:49,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:49,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:49,323 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:34:49,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:49,402 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:49,702 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 01:34:49,772 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:49,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:49,772 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 01:34:49,779 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 01:34:49,940 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 01:34:49,940 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:49,945 INFO ]: Computing forward predicates... [2018-06-25 01:34:52,932 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:52,952 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:52,952 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 01:34:52,952 INFO ]: Interpolant automaton has 7 states [2018-06-25 01:34:52,952 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 01:34:52,952 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:52,953 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 7 states. [2018-06-25 01:34:53,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:53,207 INFO ]: Finished difference Result 16 states and 29 transitions. [2018-06-25 01:34:53,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:34:53,207 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-25 01:34:53,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:53,208 INFO ]: With dead ends: 16 [2018-06-25 01:34:53,208 INFO ]: Without dead ends: 16 [2018-06-25 01:34:53,208 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-25 01:34:53,208 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:34:53,210 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-06-25 01:34:53,210 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 01:34:53,210 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-25 01:34:53,210 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 8 [2018-06-25 01:34:53,210 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:53,210 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-25 01:34:53,210 INFO ]: Interpolant automaton has 7 states. [2018-06-25 01:34:53,210 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-25 01:34:53,210 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 01:34:53,210 INFO ]: Found error trace [2018-06-25 01:34:53,210 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 01:34:53,210 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:53,211 INFO ]: Analyzing trace with hash 888685959, now seen corresponding path program 3 times [2018-06-25 01:34:53,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:53,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:53,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:53,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:34:53,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:53,314 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:53,727 WARN ]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:34:53,973 WARN ]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 01:34:54,144 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:54,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:54,144 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-25 01:34:54,159 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-25 01:34:54,290 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 01:34:54,290 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:54,295 INFO ]: Computing forward predicates... [2018-06-25 01:34:54,474 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:54,494 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:54,494 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 01:34:54,495 INFO ]: Interpolant automaton has 8 states [2018-06-25 01:34:54,495 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 01:34:54,495 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 01:34:54,495 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 8 states. [2018-06-25 01:34:54,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:34:54,800 INFO ]: Finished difference Result 17 states and 30 transitions. [2018-06-25 01:34:54,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 01:34:54,800 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 01:34:54,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:34:54,801 INFO ]: With dead ends: 17 [2018-06-25 01:34:54,801 INFO ]: Without dead ends: 17 [2018-06-25 01:34:54,801 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-06-25 01:34:54,801 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 01:34:54,802 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-06-25 01:34:54,802 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 01:34:54,803 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2018-06-25 01:34:54,803 INFO ]: Start accepts. Automaton has 11 states and 24 transitions. Word has length 9 [2018-06-25 01:34:54,803 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:34:54,803 INFO ]: Abstraction has 11 states and 24 transitions. [2018-06-25 01:34:54,803 INFO ]: Interpolant automaton has 8 states. [2018-06-25 01:34:54,803 INFO ]: Start isEmpty. Operand 11 states and 24 transitions. [2018-06-25 01:34:54,803 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 01:34:54,803 INFO ]: Found error trace [2018-06-25 01:34:54,803 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-25 01:34:54,803 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:34:54,804 INFO ]: Analyzing trace with hash 1822149668, now seen corresponding path program 1 times [2018-06-25 01:34:54,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:34:54,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:34:54,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:54,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:34:54,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:34:54,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:55,227 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:55,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:34:55,227 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 01:34:55,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:34:55,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:34:55,355 INFO ]: Computing forward predicates... [2018-06-25 01:34:59,925 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:34:59,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:34:59,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 01:34:59,945 INFO ]: Interpolant automaton has 7 states [2018-06-25 01:34:59,945 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 01:34:59,945 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 01:34:59,945 INFO ]: Start difference. First operand 11 states and 24 transitions. Second operand 7 states. [2018-06-25 01:35:00,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:35:00,150 INFO ]: Finished difference Result 16 states and 29 transitions. [2018-06-25 01:35:00,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 01:35:00,150 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 01:35:00,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:35:00,150 INFO ]: With dead ends: 16 [2018-06-25 01:35:00,150 INFO ]: Without dead ends: 16 [2018-06-25 01:35:00,151 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-25 01:35:00,151 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 01:35:00,152 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-06-25 01:35:00,152 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 01:35:00,152 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2018-06-25 01:35:00,152 INFO ]: Start accepts. Automaton has 11 states and 24 transitions. Word has length 9 [2018-06-25 01:35:00,152 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:35:00,152 INFO ]: Abstraction has 11 states and 24 transitions. [2018-06-25 01:35:00,152 INFO ]: Interpolant automaton has 7 states. [2018-06-25 01:35:00,153 INFO ]: Start isEmpty. Operand 11 states and 24 transitions. [2018-06-25 01:35:00,153 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 01:35:00,153 INFO ]: Found error trace [2018-06-25 01:35:00,153 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 01:35:00,153 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:35:00,153 INFO ]: Analyzing trace with hash 1778386714, now seen corresponding path program 4 times [2018-06-25 01:35:00,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:35:00,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:35:00,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:00,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:35:00,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:00,257 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:00,536 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:00,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:35:00,536 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-25 01:35:00,544 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 01:35:00,692 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 01:35:00,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:00,698 INFO ]: Computing forward predicates... [2018-06-25 01:35:01,460 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:01,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:35:01,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 01:35:01,480 INFO ]: Interpolant automaton has 9 states [2018-06-25 01:35:01,480 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 01:35:01,480 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-25 01:35:01,480 INFO ]: Start difference. First operand 11 states and 24 transitions. Second operand 9 states. [2018-06-25 01:35:01,859 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 01:35:01,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:35:01,959 INFO ]: Finished difference Result 19 states and 32 transitions. [2018-06-25 01:35:01,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 01:35:01,959 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 01:35:01,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:35:01,959 INFO ]: With dead ends: 19 [2018-06-25 01:35:01,959 INFO ]: Without dead ends: 19 [2018-06-25 01:35:01,960 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-06-25 01:35:01,960 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 01:35:01,962 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-06-25 01:35:01,962 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:35:01,962 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-25 01:35:01,962 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 10 [2018-06-25 01:35:01,962 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:35:01,962 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-25 01:35:01,962 INFO ]: Interpolant automaton has 9 states. [2018-06-25 01:35:01,962 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-25 01:35:01,963 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 01:35:01,963 INFO ]: Found error trace [2018-06-25 01:35:01,963 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 01:35:01,963 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:35:01,963 INFO ]: Analyzing trace with hash -1836522212, now seen corresponding path program 3 times [2018-06-25 01:35:01,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:35:01,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:35:01,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:01,964 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:35:01,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:02,055 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:02,448 WARN ]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 01:35:02,706 WARN ]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:35:02,972 WARN ]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 01:35:03,240 WARN ]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 01:35:03,408 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:03,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:35:03,409 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-25 01:35:03,415 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 01:35:03,583 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 01:35:03,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:03,589 INFO ]: Computing forward predicates... [2018-06-25 01:35:04,132 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:04,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:35:04,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 01:35:04,153 INFO ]: Interpolant automaton has 9 states [2018-06-25 01:35:04,153 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 01:35:04,153 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-25 01:35:04,154 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 9 states. [2018-06-25 01:35:04,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:35:04,442 INFO ]: Finished difference Result 20 states and 33 transitions. [2018-06-25 01:35:04,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 01:35:04,442 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 01:35:04,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:35:04,443 INFO ]: With dead ends: 20 [2018-06-25 01:35:04,443 INFO ]: Without dead ends: 20 [2018-06-25 01:35:04,443 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-25 01:35:04,443 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 01:35:04,445 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-06-25 01:35:04,445 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 01:35:04,446 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-25 01:35:04,446 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 10 [2018-06-25 01:35:04,446 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:35:04,446 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-25 01:35:04,446 INFO ]: Interpolant automaton has 9 states. [2018-06-25 01:35:04,446 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-25 01:35:04,446 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 01:35:04,446 INFO ]: Found error trace [2018-06-25 01:35:04,446 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-25 01:35:04,446 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:35:04,446 INFO ]: Analyzing trace with hash -705660953, now seen corresponding path program 5 times [2018-06-25 01:35:04,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:35:04,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:35:04,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:04,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:35:04,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:04,542 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:04,939 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 01:35:04,991 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:04,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:35:04,991 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-25 01:35:04,998 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 01:35:05,229 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 01:35:05,229 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:05,236 INFO ]: Computing forward predicates... [2018-06-25 01:35:06,272 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:06,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:35:06,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 01:35:06,304 INFO ]: Interpolant automaton has 10 states [2018-06-25 01:35:06,304 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 01:35:06,304 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 01:35:06,305 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 10 states. [2018-06-25 01:35:06,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:35:06,714 INFO ]: Finished difference Result 21 states and 34 transitions. [2018-06-25 01:35:06,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 01:35:06,715 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-25 01:35:06,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:35:06,715 INFO ]: With dead ends: 21 [2018-06-25 01:35:06,715 INFO ]: Without dead ends: 21 [2018-06-25 01:35:06,715 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-06-25 01:35:06,715 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 01:35:06,717 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-06-25 01:35:06,717 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 01:35:06,717 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-06-25 01:35:06,718 INFO ]: Start accepts. Automaton has 13 states and 26 transitions. Word has length 11 [2018-06-25 01:35:06,718 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:35:06,718 INFO ]: Abstraction has 13 states and 26 transitions. [2018-06-25 01:35:06,718 INFO ]: Interpolant automaton has 10 states. [2018-06-25 01:35:06,718 INFO ]: Start isEmpty. Operand 13 states and 26 transitions. [2018-06-25 01:35:06,718 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 01:35:06,718 INFO ]: Found error trace [2018-06-25 01:35:06,718 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-25 01:35:06,718 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:35:06,718 INFO ]: Analyzing trace with hash -1098687963, now seen corresponding path program 4 times [2018-06-25 01:35:06,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:35:06,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:35:06,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:06,719 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:35:06,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:06,809 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:07,130 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:07,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:35:07,131 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:35:07,136 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 01:35:07,326 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 01:35:07,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:07,333 INFO ]: Computing forward predicates... [2018-06-25 01:35:07,376 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 01:35:10,311 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:10,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 01:35:10,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 01:35:10,332 INFO ]: Interpolant automaton has 10 states [2018-06-25 01:35:10,332 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 01:35:10,332 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 01:35:10,332 INFO ]: Start difference. First operand 13 states and 26 transitions. Second operand 10 states. [2018-06-25 01:35:10,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:35:10,735 INFO ]: Finished difference Result 30 states and 43 transitions. [2018-06-25 01:35:10,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 01:35:10,735 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-25 01:35:10,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:35:10,736 INFO ]: With dead ends: 30 [2018-06-25 01:35:10,736 INFO ]: Without dead ends: 30 [2018-06-25 01:35:10,736 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2018-06-25 01:35:10,736 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 01:35:10,738 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 13. [2018-06-25 01:35:10,738 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 01:35:10,738 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-06-25 01:35:10,738 INFO ]: Start accepts. Automaton has 13 states and 26 transitions. Word has length 11 [2018-06-25 01:35:10,739 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:35:10,739 INFO ]: Abstraction has 13 states and 26 transitions. [2018-06-25 01:35:10,739 INFO ]: Interpolant automaton has 10 states. [2018-06-25 01:35:10,739 INFO ]: Start isEmpty. Operand 13 states and 26 transitions. [2018-06-25 01:35:10,739 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 01:35:10,739 INFO ]: Found error trace [2018-06-25 01:35:10,739 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-25 01:35:10,739 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:35:10,739 INFO ]: Analyzing trace with hash -401727302, now seen corresponding path program 6 times [2018-06-25 01:35:10,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:35:10,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:35:10,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:10,740 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 01:35:10,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:35:10,929 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:11,272 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:35:11,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:35:11,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:35:11,285 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 01:35:11,510 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 01:35:11,510 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:35:11,519 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-25 01:35:45,287 INFO ]: Timeout while computing interpolants [2018-06-25 01:35:45,488 WARN ]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:35:45,488 WARN ]: Verification canceled [2018-06-25 01:35:45,490 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:35:45,491 WARN ]: Timeout [2018-06-25 01:35:45,491 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:35:45 BasicIcfg [2018-06-25 01:35:45,491 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:35:45,492 INFO ]: Toolchain (without parser) took 63486.36 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 231.8 MB in the beginning and 328.7 MB in the end (delta: -96.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 01:35:45,493 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:35:45,493 INFO ]: ChcToBoogie took 81.91 ms. Allocated memory is still 309.3 MB. Free memory was 231.8 MB in the beginning and 228.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:35:45,494 INFO ]: Boogie Preprocessor took 87.81 ms. Allocated memory is still 309.3 MB. Free memory was 228.8 MB in the beginning and 226.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 01:35:45,494 INFO ]: RCFGBuilder took 433.33 ms. Allocated memory is still 309.3 MB. Free memory was 226.7 MB in the beginning and 197.6 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 3.6 GB. [2018-06-25 01:35:45,494 INFO ]: BlockEncodingV2 took 936.03 ms. Allocated memory was 309.3 MB in the beginning and 331.4 MB in the end (delta: 22.0 MB). Free memory was 197.6 MB in the beginning and 267.2 MB in the end (delta: -69.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 3.6 GB. [2018-06-25 01:35:45,495 INFO ]: TraceAbstraction took 61935.83 ms. Allocated memory was 331.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 265.7 MB in the beginning and 328.7 MB in the end (delta: -63.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 01:35:45,499 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, 19 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 81.91 ms. Allocated memory is still 309.3 MB. Free memory was 231.8 MB in the beginning and 228.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 87.81 ms. Allocated memory is still 309.3 MB. Free memory was 228.8 MB in the beginning and 226.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 433.33 ms. Allocated memory is still 309.3 MB. Free memory was 226.7 MB in the beginning and 197.6 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 936.03 ms. Allocated memory was 309.3 MB in the beginning and 331.4 MB in the end (delta: 22.0 MB). Free memory was 197.6 MB in the beginning and 267.2 MB in the end (delta: -69.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61935.83 ms. Allocated memory was 331.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 265.7 MB in the beginning and 328.7 MB in the end (delta: -63.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 13 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 32 quantified variables from 11 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 61.8s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 0 SDslu, 159 SDs, 0 SdLazy, 174 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 59 SyntacticMatches, 32 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=10, 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, 11 MinimizatonAttempts, 64 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 6690 SizeOfPredicates, 70 NumberOfNonLiveVariables, 6586 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 0/206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/swim1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-35-45-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/swim1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-35-45-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/swim1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-35-45-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/swim1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-35-45-511.csv Completed graceful shutdown