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/sally-chc-benchmarks/misc/frolloc_lifo_prop1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 22:20:53,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 22:20:53,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 22:20:53,650 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 22:20:53,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 22:20:53,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 22:20:53,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 22:20:53,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 22:20:53,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 22:20:53,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 22:20:53,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 22:20:53,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 22:20:53,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 22:20:53,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 22:20:53,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 22:20:53,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 22:20:53,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 22:20:53,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 22:20:53,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 22:20:53,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 22:20:53,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 22:20:53,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 22:20:53,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 22:20:53,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 22:20:53,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 22:20:53,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 22:20:53,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 22:20:53,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 22:20:53,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 22:20:53,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 22:20:53,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 22:20:53,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 22:20:53,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 22:20:53,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 22:20:53,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 22:20:53,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 22:20:53,723 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 22:20:53,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 22:20:53,723 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 22:20:53,724 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 22:20:53,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 22:20:53,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 22:20:53,725 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 22:20:53,725 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 22:20:53,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 22:20:53,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 22:20:53,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 22:20:53,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 22:20:53,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:20:53,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 22:20:53,730 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 22:20:53,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 22:20:53,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 22:20:53,730 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 22:20:53,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 22:20:53,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 22:20:53,731 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 22:20:53,732 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 22:20:53,733 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 22:20:53,786 INFO ]: Repository-Root is: /tmp [2018-06-24 22:20:53,801 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 22:20:53,809 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 22:20:53,810 INFO ]: Initializing SmtParser... [2018-06-24 22:20:53,811 INFO ]: SmtParser initialized [2018-06-24 22:20:53,811 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/sally-chc-benchmarks/misc/frolloc_lifo_prop1.smt2 [2018-06-24 22:20:53,812 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 22:20:53,886 INFO ]: Executing SMT file /storage/chc-comp/sally-chc-benchmarks/misc/frolloc_lifo_prop1.smt2 unknown [2018-06-24 22:20:54,267 INFO ]: Succesfully executed SMT file /storage/chc-comp/sally-chc-benchmarks/misc/frolloc_lifo_prop1.smt2 [2018-06-24 22:20:54,272 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 22:20:54,288 INFO ]: Walking toolchain with 5 elements. [2018-06-24 22:20:54,288 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 22:20:54,288 INFO ]: Initializing ChcToBoogie... [2018-06-24 22:20:54,288 INFO ]: ChcToBoogie initialized [2018-06-24 22:20:54,292 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,374 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54 Unit [2018-06-24 22:20:54,374 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 22:20:54,375 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 22:20:54,375 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 22:20:54,375 INFO ]: Boogie Preprocessor initialized [2018-06-24 22:20:54,424 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,425 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,446 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,446 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,454 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,465 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,467 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,470 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 22:20:54,471 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 22:20:54,471 INFO ]: Initializing RCFGBuilder... [2018-06-24 22:20:54,471 INFO ]: RCFGBuilder initialized [2018-06-24 22:20:54,472 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 22:20:54,499 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 22:20:54,499 INFO ]: Found specification of procedure gotoProc [2018-06-24 22:20:54,499 INFO ]: Found implementation of procedure gotoProc [2018-06-24 22:20:54,500 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 22:20:54,500 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 22:20:54,500 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:20:54,881 INFO ]: Using library mode [2018-06-24 22:20:54,882 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:20:54 BoogieIcfgContainer [2018-06-24 22:20:54,882 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 22:20:54,882 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 22:20:54,882 INFO ]: Initializing BlockEncodingV2... [2018-06-24 22:20:54,884 INFO ]: BlockEncodingV2 initialized [2018-06-24 22:20:54,884 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:20:54" (1/1) ... [2018-06-24 22:20:54,906 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 22:20:54,907 INFO ]: Using Remove infeasible edges [2018-06-24 22:20:54,908 INFO ]: Using Maximize final states [2018-06-24 22:20:54,908 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 22:20:54,908 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 22:20:54,912 INFO ]: Using Remove sink states [2018-06-24 22:20:54,913 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 22:20:54,913 INFO ]: Using Use SBE [2018-06-24 22:20:55,277 INFO ]: SBE split 1 edges [2018-06-24 22:20:55,294 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 22:20:55,297 INFO ]: 0 new accepting states [2018-06-24 22:20:55,360 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 22:20:55,362 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:20:55,373 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:20:55,373 INFO ]: 0 new accepting states [2018-06-24 22:20:55,374 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 22:20:55,374 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:20:55,381 INFO ]: Encoded RCFG 6 locations, 147 edges [2018-06-24 22:20:55,381 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:20:55 BasicIcfg [2018-06-24 22:20:55,381 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 22:20:55,382 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 22:20:55,382 INFO ]: Initializing TraceAbstraction... [2018-06-24 22:20:55,385 INFO ]: TraceAbstraction initialized [2018-06-24 22:20:55,386 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:20:54" (1/4) ... [2018-06-24 22:20:55,386 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d4255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 10:20:55, skipping insertion in model container [2018-06-24 22:20:55,386 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:20:54" (2/4) ... [2018-06-24 22:20:55,387 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d4255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 10:20:55, skipping insertion in model container [2018-06-24 22:20:55,387 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:20:54" (3/4) ... [2018-06-24 22:20:55,387 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d4255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:20:55, skipping insertion in model container [2018-06-24 22:20:55,387 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:20:55" (4/4) ... [2018-06-24 22:20:55,390 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 22:20:55,396 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 22:20:55,402 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 22:20:55,453 INFO ]: Using default assertion order modulation [2018-06-24 22:20:55,454 INFO ]: Interprodecural is true [2018-06-24 22:20:55,454 INFO ]: Hoare is false [2018-06-24 22:20:55,454 INFO ]: Compute interpolants for FPandBP [2018-06-24 22:20:55,454 INFO ]: Backedges is TWOTRACK [2018-06-24 22:20:55,454 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 22:20:55,454 INFO ]: Difference is false [2018-06-24 22:20:55,454 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 22:20:55,454 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 22:20:55,465 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 22:20:55,476 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:20:55,476 INFO ]: Found error trace [2018-06-24 22:20:55,477 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:20:55,477 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:55,480 INFO ]: Analyzing trace with hash 39769346, now seen corresponding path program 1 times [2018-06-24 22:20:55,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:55,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:55,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:55,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:55,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:55,594 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:55,731 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:55,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:55,734 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:55,736 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:55,752 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:55,752 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:55,759 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 22:20:57,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:57,309 INFO ]: Finished difference Result 7 states and 170 transitions. [2018-06-24 22:20:57,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:20:57,311 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:20:57,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:57,320 INFO ]: With dead ends: 7 [2018-06-24 22:20:57,320 INFO ]: Without dead ends: 7 [2018-06-24 22:20:57,322 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:57,337 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 22:20:57,355 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 22:20:57,357 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 22:20:57,358 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2018-06-24 22:20:57,359 INFO ]: Start accepts. Automaton has 7 states and 170 transitions. Word has length 5 [2018-06-24 22:20:57,359 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:57,359 INFO ]: Abstraction has 7 states and 170 transitions. [2018-06-24 22:20:57,360 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:20:57,360 INFO ]: Start isEmpty. Operand 7 states and 170 transitions. [2018-06-24 22:20:57,360 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:20:57,360 INFO ]: Found error trace [2018-06-24 22:20:57,360 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:20:57,360 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:57,360 INFO ]: Analyzing trace with hash 1228728156, now seen corresponding path program 1 times [2018-06-24 22:20:57,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:57,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:57,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:57,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:57,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:57,404 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:57,499 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:57,499 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:57,499 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:57,500 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:57,500 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:57,500 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:57,501 INFO ]: Start difference. First operand 7 states and 170 transitions. Second operand 3 states. [2018-06-24 22:20:59,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:20:59,256 INFO ]: Finished difference Result 9 states and 335 transitions. [2018-06-24 22:20:59,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:20:59,259 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:20:59,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:20:59,260 INFO ]: With dead ends: 9 [2018-06-24 22:20:59,260 INFO ]: Without dead ends: 9 [2018-06-24 22:20:59,261 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:59,261 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 22:20:59,266 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 22:20:59,267 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 22:20:59,267 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2018-06-24 22:20:59,268 INFO ]: Start accepts. Automaton has 8 states and 280 transitions. Word has length 6 [2018-06-24 22:20:59,317 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:20:59,317 INFO ]: Abstraction has 8 states and 280 transitions. [2018-06-24 22:20:59,317 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:20:59,317 INFO ]: Start isEmpty. Operand 8 states and 280 transitions. [2018-06-24 22:20:59,317 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:20:59,317 INFO ]: Found error trace [2018-06-24 22:20:59,318 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:20:59,318 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:20:59,318 INFO ]: Analyzing trace with hash -567747951, now seen corresponding path program 1 times [2018-06-24 22:20:59,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:20:59,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:20:59,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:59,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:20:59,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:20:59,384 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:20:59,491 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:20:59,491 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:20:59,491 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:20:59,492 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:20:59,492 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:20:59,492 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:20:59,492 INFO ]: Start difference. First operand 8 states and 280 transitions. Second operand 3 states. [2018-06-24 22:21:00,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:00,148 INFO ]: Finished difference Result 11 states and 435 transitions. [2018-06-24 22:21:00,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:00,149 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:21:00,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:00,151 INFO ]: With dead ends: 11 [2018-06-24 22:21:00,151 INFO ]: Without dead ends: 11 [2018-06-24 22:21:00,151 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:00,151 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 22:21:00,159 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 22:21:00,159 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 22:21:00,160 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 435 transitions. [2018-06-24 22:21:00,160 INFO ]: Start accepts. Automaton has 11 states and 435 transitions. Word has length 7 [2018-06-24 22:21:00,161 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:00,161 INFO ]: Abstraction has 11 states and 435 transitions. [2018-06-24 22:21:00,161 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:00,161 INFO ]: Start isEmpty. Operand 11 states and 435 transitions. [2018-06-24 22:21:00,161 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:21:00,161 INFO ]: Found error trace [2018-06-24 22:21:00,161 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:00,162 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:00,162 INFO ]: Analyzing trace with hash -565424253, now seen corresponding path program 1 times [2018-06-24 22:21:00,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:00,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:00,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:00,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:00,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:00,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:00,251 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:21:00,251 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:00,251 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:00,251 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:00,251 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:00,251 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:00,251 INFO ]: Start difference. First operand 11 states and 435 transitions. Second operand 3 states. [2018-06-24 22:21:01,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:01,023 INFO ]: Finished difference Result 14 states and 610 transitions. [2018-06-24 22:21:01,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:01,024 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:21:01,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:01,025 INFO ]: With dead ends: 14 [2018-06-24 22:21:01,025 INFO ]: Without dead ends: 14 [2018-06-24 22:21:01,025 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:01,025 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 22:21:01,030 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 22:21:01,030 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 22:21:01,032 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 610 transitions. [2018-06-24 22:21:01,032 INFO ]: Start accepts. Automaton has 14 states and 610 transitions. Word has length 7 [2018-06-24 22:21:01,032 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:01,032 INFO ]: Abstraction has 14 states and 610 transitions. [2018-06-24 22:21:01,032 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:01,033 INFO ]: Start isEmpty. Operand 14 states and 610 transitions. [2018-06-24 22:21:01,033 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:21:01,033 INFO ]: Found error trace [2018-06-24 22:21:01,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:01,033 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:01,034 INFO ]: Analyzing trace with hash -556725281, now seen corresponding path program 1 times [2018-06-24 22:21:01,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:01,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:01,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:01,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:01,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:01,077 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:01,178 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:21:01,178 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:01,178 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:01,178 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:01,178 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:01,178 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:01,178 INFO ]: Start difference. First operand 14 states and 610 transitions. Second operand 3 states. [2018-06-24 22:21:01,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:01,919 INFO ]: Finished difference Result 17 states and 806 transitions. [2018-06-24 22:21:01,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:01,919 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:21:01,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:01,920 INFO ]: With dead ends: 17 [2018-06-24 22:21:01,920 INFO ]: Without dead ends: 17 [2018-06-24 22:21:01,921 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:01,921 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 22:21:01,926 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 22:21:01,926 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 22:21:01,928 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 806 transitions. [2018-06-24 22:21:01,928 INFO ]: Start accepts. Automaton has 17 states and 806 transitions. Word has length 7 [2018-06-24 22:21:01,928 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:01,928 INFO ]: Abstraction has 17 states and 806 transitions. [2018-06-24 22:21:01,928 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:01,928 INFO ]: Start isEmpty. Operand 17 states and 806 transitions. [2018-06-24 22:21:01,929 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:21:01,929 INFO ]: Found error trace [2018-06-24 22:21:01,929 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:01,929 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:01,929 INFO ]: Analyzing trace with hash -555027194, now seen corresponding path program 1 times [2018-06-24 22:21:01,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:01,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:01,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:01,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:01,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:01,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:02,031 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:21:02,031 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:02,031 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:02,032 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:02,032 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:02,032 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:02,032 INFO ]: Start difference. First operand 17 states and 806 transitions. Second operand 3 states. [2018-06-24 22:21:02,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:02,827 INFO ]: Finished difference Result 29 states and 1161 transitions. [2018-06-24 22:21:02,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:02,829 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 22:21:02,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:02,831 INFO ]: With dead ends: 29 [2018-06-24 22:21:02,831 INFO ]: Without dead ends: 29 [2018-06-24 22:21:02,832 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:02,832 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 22:21:02,841 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 22:21:02,841 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 22:21:02,843 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1161 transitions. [2018-06-24 22:21:02,843 INFO ]: Start accepts. Automaton has 29 states and 1161 transitions. Word has length 7 [2018-06-24 22:21:02,843 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:02,843 INFO ]: Abstraction has 29 states and 1161 transitions. [2018-06-24 22:21:02,844 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:02,844 INFO ]: Start isEmpty. Operand 29 states and 1161 transitions. [2018-06-24 22:21:02,845 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 22:21:02,845 INFO ]: Found error trace [2018-06-24 22:21:02,845 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:02,845 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:02,845 INFO ]: Analyzing trace with hash -49370177, now seen corresponding path program 1 times [2018-06-24 22:21:02,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:02,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:02,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:02,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:02,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:02,879 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:03,065 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:21:03,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:21:03,065 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:21:03,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:03,224 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:03,233 INFO ]: Computing forward predicates... [2018-06-24 22:21:03,255 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:21:03,276 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 22:21:03,276 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 22:21:03,276 INFO ]: Interpolant automaton has 6 states [2018-06-24 22:21:03,276 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 22:21:03,276 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:21:03,277 INFO ]: Start difference. First operand 29 states and 1161 transitions. Second operand 6 states. [2018-06-24 22:21:07,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:07,576 INFO ]: Finished difference Result 133 states and 5022 transitions. [2018-06-24 22:21:07,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 22:21:07,578 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 22:21:07,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:07,590 INFO ]: With dead ends: 133 [2018-06-24 22:21:07,591 INFO ]: Without dead ends: 133 [2018-06-24 22:21:07,591 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-06-24 22:21:07,591 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-24 22:21:07,609 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 53. [2018-06-24 22:21:07,609 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 22:21:07,611 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 2435 transitions. [2018-06-24 22:21:07,612 INFO ]: Start accepts. Automaton has 53 states and 2435 transitions. Word has length 8 [2018-06-24 22:21:07,612 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:07,612 INFO ]: Abstraction has 53 states and 2435 transitions. [2018-06-24 22:21:07,612 INFO ]: Interpolant automaton has 6 states. [2018-06-24 22:21:07,612 INFO ]: Start isEmpty. Operand 53 states and 2435 transitions. [2018-06-24 22:21:07,614 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 22:21:07,614 INFO ]: Found error trace [2018-06-24 22:21:07,614 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:07,614 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:07,614 INFO ]: Analyzing trace with hash -298773116, now seen corresponding path program 1 times [2018-06-24 22:21:07,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:07,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:07,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:07,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:07,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:07,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:07,757 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:21:07,757 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:07,757 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:07,757 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:07,757 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:07,757 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:07,758 INFO ]: Start difference. First operand 53 states and 2435 transitions. Second operand 3 states. [2018-06-24 22:21:09,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:09,353 INFO ]: Finished difference Result 69 states and 2785 transitions. [2018-06-24 22:21:09,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:09,354 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 22:21:09,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:09,360 INFO ]: With dead ends: 69 [2018-06-24 22:21:09,360 INFO ]: Without dead ends: 69 [2018-06-24 22:21:09,360 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:09,360 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-24 22:21:09,375 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-24 22:21:09,376 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-24 22:21:09,379 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 2785 transitions. [2018-06-24 22:21:09,379 INFO ]: Start accepts. Automaton has 69 states and 2785 transitions. Word has length 10 [2018-06-24 22:21:09,379 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:09,379 INFO ]: Abstraction has 69 states and 2785 transitions. [2018-06-24 22:21:09,379 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:09,379 INFO ]: Start isEmpty. Operand 69 states and 2785 transitions. [2018-06-24 22:21:09,382 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:21:09,382 INFO ]: Found error trace [2018-06-24 22:21:09,382 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:09,382 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:09,382 INFO ]: Analyzing trace with hash 619159106, now seen corresponding path program 1 times [2018-06-24 22:21:09,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:09,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:09,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:09,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:09,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:09,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:09,530 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 22:21:09,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:09,530 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:09,530 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:09,530 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:09,530 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:09,530 INFO ]: Start difference. First operand 69 states and 2785 transitions. Second operand 3 states. [2018-06-24 22:21:10,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:10,688 INFO ]: Finished difference Result 61 states and 1731 transitions. [2018-06-24 22:21:10,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:10,688 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 22:21:10,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:10,690 INFO ]: With dead ends: 61 [2018-06-24 22:21:10,690 INFO ]: Without dead ends: 61 [2018-06-24 22:21:10,690 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:10,691 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 22:21:10,702 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-24 22:21:10,702 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 22:21:10,704 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 1731 transitions. [2018-06-24 22:21:10,704 INFO ]: Start accepts. Automaton has 61 states and 1731 transitions. Word has length 11 [2018-06-24 22:21:10,704 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:10,704 INFO ]: Abstraction has 61 states and 1731 transitions. [2018-06-24 22:21:10,704 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:10,704 INFO ]: Start isEmpty. Operand 61 states and 1731 transitions. [2018-06-24 22:21:10,705 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:21:10,705 INFO ]: Found error trace [2018-06-24 22:21:10,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:10,705 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:10,705 INFO ]: Analyzing trace with hash 1045195799, now seen corresponding path program 1 times [2018-06-24 22:21:10,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:10,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:10,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:10,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:10,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:10,729 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:10,807 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 22:21:10,807 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:10,807 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:10,808 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:10,808 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:10,808 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:10,808 INFO ]: Start difference. First operand 61 states and 1731 transitions. Second operand 3 states. [2018-06-24 22:21:11,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:11,595 INFO ]: Finished difference Result 75 states and 1806 transitions. [2018-06-24 22:21:11,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:11,595 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 22:21:11,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:11,596 INFO ]: With dead ends: 75 [2018-06-24 22:21:11,596 INFO ]: Without dead ends: 75 [2018-06-24 22:21:11,597 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:11,597 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 22:21:11,610 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-24 22:21:11,610 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 22:21:11,612 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 1806 transitions. [2018-06-24 22:21:11,613 INFO ]: Start accepts. Automaton has 75 states and 1806 transitions. Word has length 12 [2018-06-24 22:21:11,613 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:11,613 INFO ]: Abstraction has 75 states and 1806 transitions. [2018-06-24 22:21:11,613 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:11,613 INFO ]: Start isEmpty. Operand 75 states and 1806 transitions. [2018-06-24 22:21:11,614 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:21:11,614 INFO ]: Found error trace [2018-06-24 22:21:11,614 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:11,614 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:11,614 INFO ]: Analyzing trace with hash -805867569, now seen corresponding path program 1 times [2018-06-24 22:21:11,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:11,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:11,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:11,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:11,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:11,647 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:11,737 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 22:21:11,737 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:11,737 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:11,737 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:11,738 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:11,738 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:11,738 INFO ]: Start difference. First operand 75 states and 1806 transitions. Second operand 3 states. [2018-06-24 22:21:12,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:12,368 INFO ]: Finished difference Result 89 states and 1995 transitions. [2018-06-24 22:21:12,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:12,369 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 22:21:12,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:12,371 INFO ]: With dead ends: 89 [2018-06-24 22:21:12,372 INFO ]: Without dead ends: 89 [2018-06-24 22:21:12,372 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:12,372 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 22:21:12,382 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-06-24 22:21:12,382 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-24 22:21:12,390 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 1995 transitions. [2018-06-24 22:21:12,390 INFO ]: Start accepts. Automaton has 89 states and 1995 transitions. Word has length 12 [2018-06-24 22:21:12,390 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:12,390 INFO ]: Abstraction has 89 states and 1995 transitions. [2018-06-24 22:21:12,390 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:12,390 INFO ]: Start isEmpty. Operand 89 states and 1995 transitions. [2018-06-24 22:21:12,392 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:21:12,392 INFO ]: Found error trace [2018-06-24 22:21:12,392 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:12,392 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:12,392 INFO ]: Analyzing trace with hash 510085020, now seen corresponding path program 1 times [2018-06-24 22:21:12,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:12,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:12,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:12,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:12,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:12,434 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:12,528 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 22:21:12,528 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:12,528 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:12,529 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:12,529 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:12,529 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:12,529 INFO ]: Start difference. First operand 89 states and 1995 transitions. Second operand 3 states. [2018-06-24 22:21:13,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:13,012 INFO ]: Finished difference Result 113 states and 2373 transitions. [2018-06-24 22:21:13,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:13,012 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 22:21:13,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:13,015 INFO ]: With dead ends: 113 [2018-06-24 22:21:13,015 INFO ]: Without dead ends: 113 [2018-06-24 22:21:13,015 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:13,015 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 22:21:13,030 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-06-24 22:21:13,030 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 22:21:13,035 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 2373 transitions. [2018-06-24 22:21:13,035 INFO ]: Start accepts. Automaton has 113 states and 2373 transitions. Word has length 12 [2018-06-24 22:21:13,035 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:13,035 INFO ]: Abstraction has 113 states and 2373 transitions. [2018-06-24 22:21:13,035 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:13,035 INFO ]: Start isEmpty. Operand 113 states and 2373 transitions. [2018-06-24 22:21:13,036 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 22:21:13,037 INFO ]: Found error trace [2018-06-24 22:21:13,037 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:21:13,037 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:21:13,037 INFO ]: Analyzing trace with hash 938090538, now seen corresponding path program 1 times [2018-06-24 22:21:13,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:21:13,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:21:13,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:13,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:21:13,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:21:13,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:21:13,195 INFO ]: Checked inductivity of 45 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 22:21:13,195 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:21:13,195 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:21:13,195 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:21:13,195 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:21:13,195 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:13,195 INFO ]: Start difference. First operand 113 states and 2373 transitions. Second operand 3 states. [2018-06-24 22:21:13,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:21:13,746 INFO ]: Finished difference Result 134 states and 1736 transitions. [2018-06-24 22:21:13,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:21:13,747 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 22:21:13,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:21:13,747 INFO ]: With dead ends: 134 [2018-06-24 22:21:13,747 INFO ]: Without dead ends: 0 [2018-06-24 22:21:13,747 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:21:13,747 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 22:21:13,747 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 22:21:13,747 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 22:21:13,747 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 22:21:13,747 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-06-24 22:21:13,747 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:21:13,747 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 22:21:13,747 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:21:13,747 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 22:21:13,747 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 22:21:13,749 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:21:13,753 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:21:13 BasicIcfg [2018-06-24 22:21:13,753 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:21:13,754 INFO ]: Toolchain (without parser) took 19481.36 ms. Allocated memory was 309.3 MB in the beginning and 584.1 MB in the end (delta: 274.7 MB). Free memory was 254.6 MB in the beginning and 511.3 MB in the end (delta: -256.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:21:13,755 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-24 22:21:13,755 INFO ]: ChcToBoogie took 86.65 ms. Allocated memory is still 309.3 MB. Free memory was 254.6 MB in the beginning and 251.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:21:13,756 INFO ]: Boogie Preprocessor took 95.13 ms. Allocated memory is still 309.3 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:21:13,756 INFO ]: RCFGBuilder took 411.25 ms. Allocated memory is still 309.3 MB. Free memory was 249.6 MB in the beginning and 223.6 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:21:13,756 INFO ]: BlockEncodingV2 took 498.81 ms. Allocated memory was 309.3 MB in the beginning and 332.4 MB in the end (delta: 23.1 MB). Free memory was 222.6 MB in the beginning and 285.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 41.6 MB. Max. memory is 3.6 GB. [2018-06-24 22:21:13,759 INFO ]: TraceAbstraction took 18370.90 ms. Allocated memory was 332.4 MB in the beginning and 584.1 MB in the end (delta: 251.7 MB). Free memory was 285.6 MB in the beginning and 511.3 MB in the end (delta: -225.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 3.6 GB. [2018-06-24 22:21:13,762 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, 147 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 86.65 ms. Allocated memory is still 309.3 MB. Free memory was 254.6 MB in the beginning and 251.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 95.13 ms. Allocated memory is still 309.3 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 411.25 ms. Allocated memory is still 309.3 MB. Free memory was 249.6 MB in the beginning and 223.6 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 498.81 ms. Allocated memory was 309.3 MB in the beginning and 332.4 MB in the end (delta: 23.1 MB). Free memory was 222.6 MB in the beginning and 285.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 41.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 18370.90 ms. Allocated memory was 332.4 MB in the beginning and 584.1 MB in the end (delta: 251.7 MB). Free memory was 285.6 MB in the beginning and 511.3 MB in the end (delta: -225.7 MB). Peak memory consumption was 25.9 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, 18.3s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 3 SDslu, 47 SDs, 0 SdLazy, 3624 SolverSat, 2738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 81 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 1 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 187/190 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/frolloc_lifo_prop1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-21-13-781.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/frolloc_lifo_prop1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-21-13-781.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/frolloc_lifo_prop1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-21-13-781.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/frolloc_lifo_prop1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-21-13-781.csv Received shutdown request...