java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:21:58,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:21:58,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:21:58,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:21:58,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:21:58,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:21:58,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:21:58,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:21:58,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:21:58,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:21:58,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:21:58,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:21:58,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:21:58,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:21:58,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:21:58,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:21:58,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:21:58,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:21:58,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:21:58,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:21:58,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:21:58,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:21:58,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:21:58,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:21:58,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:21:58,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:21:58,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:21:58,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:21:58,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:21:58,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:21:58,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:21:58,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:21:58,440 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:21:58,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:21:58,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:21:58,441 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:21:58,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:21:58,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:21:58,463 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:21:58,463 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:21:58,464 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:21:58,464 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:21:58,465 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:21:58,465 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:21:58,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:21:58,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:21:58,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:21:58,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:21:58,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:21:58,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:21:58,467 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:21:58,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:21:58,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:21:58,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:21:58,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:21:58,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:21:58,468 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:21:58,471 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:21:58,471 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:21:58,520 INFO ]: Repository-Root is: /tmp [2018-06-24 20:21:58,538 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:21:58,541 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:21:58,542 INFO ]: Initializing SmtParser... [2018-06-24 20:21:58,542 INFO ]: SmtParser initialized [2018-06-24 20:21:58,543 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 [2018-06-24 20:21:58,544 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:21:58,612 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 unknown [2018-06-24 20:21:59,395 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 [2018-06-24 20:21:59,403 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:21:59,411 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:21:59,411 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:21:59,411 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:21:59,412 INFO ]: ChcToBoogie initialized [2018-06-24 20:21:59,415 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,607 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59 Unit [2018-06-24 20:21:59,607 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:21:59,607 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:21:59,607 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:21:59,607 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:21:59,632 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,632 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,649 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,650 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,673 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,682 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,687 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... [2018-06-24 20:21:59,703 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:21:59,704 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:21:59,704 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:21:59,704 INFO ]: RCFGBuilder initialized [2018-06-24 20:21:59,705 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:21:59,726 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:21:59,726 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:21:59,726 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:21:59,726 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:21:59,726 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:21:59,726 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:22:02,467 INFO ]: Using library mode [2018-06-24 20:22:02,467 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:22:02 BoogieIcfgContainer [2018-06-24 20:22:02,467 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:22:02,468 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:22:02,468 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:22:02,469 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:22:02,469 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:22:02" (1/1) ... [2018-06-24 20:22:02,507 INFO ]: Initial Icfg 144 locations, 280 edges [2018-06-24 20:22:02,508 INFO ]: Using Remove infeasible edges [2018-06-24 20:22:02,509 INFO ]: Using Maximize final states [2018-06-24 20:22:02,509 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:22:02,509 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:22:02,511 INFO ]: Using Remove sink states [2018-06-24 20:22:02,512 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:22:02,512 INFO ]: Using Use SBE [2018-06-24 20:22:02,529 INFO ]: SBE split 0 edges [2018-06-24 20:22:02,535 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:22:02,537 INFO ]: 0 new accepting states [2018-06-24 20:22:03,338 INFO ]: Removed 57 edges and 8 locations by large block encoding [2018-06-24 20:22:03,342 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:22:03,345 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:22:03,346 INFO ]: 0 new accepting states [2018-06-24 20:22:03,348 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:22:03,349 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:22:03,351 INFO ]: Encoded RCFG 133 locations, 268 edges [2018-06-24 20:22:03,352 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:22:03 BasicIcfg [2018-06-24 20:22:03,352 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:22:03,353 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:22:03,353 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:22:03,356 INFO ]: TraceAbstraction initialized [2018-06-24 20:22:03,356 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:21:59" (1/4) ... [2018-06-24 20:22:03,357 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10abfcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:22:03, skipping insertion in model container [2018-06-24 20:22:03,357 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:21:59" (2/4) ... [2018-06-24 20:22:03,357 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10abfcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:22:03, skipping insertion in model container [2018-06-24 20:22:03,357 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:22:02" (3/4) ... [2018-06-24 20:22:03,357 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10abfcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:22:03, skipping insertion in model container [2018-06-24 20:22:03,357 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:22:03" (4/4) ... [2018-06-24 20:22:03,360 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:22:03,368 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:22:03,375 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:22:03,418 INFO ]: Using default assertion order modulation [2018-06-24 20:22:03,419 INFO ]: Interprodecural is true [2018-06-24 20:22:03,419 INFO ]: Hoare is false [2018-06-24 20:22:03,419 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:22:03,419 INFO ]: Backedges is TWOTRACK [2018-06-24 20:22:03,419 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:22:03,419 INFO ]: Difference is false [2018-06-24 20:22:03,419 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:22:03,419 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:22:03,435 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:22:03,471 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:22:03,471 INFO ]: Found error trace [2018-06-24 20:22:03,472 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:22:03,472 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:03,477 INFO ]: Analyzing trace with hash 5723979, now seen corresponding path program 1 times [2018-06-24 20:22:03,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:03,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:03,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:03,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:03,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:03,610 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:03,859 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:22:03,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:03,861 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:22:03,863 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:22:03,879 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:22:03,879 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:22:03,881 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:22:05,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:05,670 INFO ]: Finished difference Result 134 states and 365 transitions. [2018-06-24 20:22:05,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:22:05,672 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:22:05,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:05,709 INFO ]: With dead ends: 134 [2018-06-24 20:22:05,709 INFO ]: Without dead ends: 134 [2018-06-24 20:22:05,711 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:22:05,730 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 20:22:05,849 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-24 20:22:05,850 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 20:22:05,863 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 365 transitions. [2018-06-24 20:22:05,867 INFO ]: Start accepts. Automaton has 134 states and 365 transitions. Word has length 4 [2018-06-24 20:22:05,868 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:05,868 INFO ]: Abstraction has 134 states and 365 transitions. [2018-06-24 20:22:05,868 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:22:05,868 INFO ]: Start isEmpty. Operand 134 states and 365 transitions. [2018-06-24 20:22:05,884 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:22:05,885 INFO ]: Found error trace [2018-06-24 20:22:05,885 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:22:05,885 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:05,885 INFO ]: Analyzing trace with hash 176752188, now seen corresponding path program 1 times [2018-06-24 20:22:05,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:05,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:05,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:05,887 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:05,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:05,946 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:06,081 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:22:06,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:06,082 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:22:06,083 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:22:06,083 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:22:06,083 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:22:06,083 INFO ]: Start difference. First operand 134 states and 365 transitions. Second operand 3 states. [2018-06-24 20:22:08,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:08,968 INFO ]: Finished difference Result 264 states and 589 transitions. [2018-06-24 20:22:08,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:22:08,968 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:22:08,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:08,991 INFO ]: With dead ends: 264 [2018-06-24 20:22:08,991 INFO ]: Without dead ends: 264 [2018-06-24 20:22:08,992 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:22:08,993 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-24 20:22:09,072 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-24 20:22:09,072 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-24 20:22:09,088 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 589 transitions. [2018-06-24 20:22:09,088 INFO ]: Start accepts. Automaton has 264 states and 589 transitions. Word has length 5 [2018-06-24 20:22:09,088 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:09,088 INFO ]: Abstraction has 264 states and 589 transitions. [2018-06-24 20:22:09,088 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:22:09,088 INFO ]: Start isEmpty. Operand 264 states and 589 transitions. [2018-06-24 20:22:09,097 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:22:09,097 INFO ]: Found error trace [2018-06-24 20:22:09,097 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:22:09,097 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:09,097 INFO ]: Analyzing trace with hash 176816575, now seen corresponding path program 1 times [2018-06-24 20:22:09,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:09,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:09,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:09,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:09,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:09,115 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:09,199 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:22:09,199 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:09,199 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:22:09,200 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:22:09,200 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:22:09,200 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:22:09,200 INFO ]: Start difference. First operand 264 states and 589 transitions. Second operand 3 states. [2018-06-24 20:22:10,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:10,091 INFO ]: Finished difference Result 394 states and 798 transitions. [2018-06-24 20:22:10,091 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:22:10,091 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:22:10,091 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:10,113 INFO ]: With dead ends: 394 [2018-06-24 20:22:10,113 INFO ]: Without dead ends: 394 [2018-06-24 20:22:10,113 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:22:10,114 INFO ]: Start minimizeSevpa. Operand 394 states. [2018-06-24 20:22:10,190 INFO ]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-06-24 20:22:10,190 INFO ]: Start removeUnreachable. Operand 394 states. [2018-06-24 20:22:10,209 INFO ]: Finished removeUnreachable. Reduced from 394 states to 394 states and 798 transitions. [2018-06-24 20:22:10,209 INFO ]: Start accepts. Automaton has 394 states and 798 transitions. Word has length 5 [2018-06-24 20:22:10,209 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:10,209 INFO ]: Abstraction has 394 states and 798 transitions. [2018-06-24 20:22:10,209 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:22:10,209 INFO ]: Start isEmpty. Operand 394 states and 798 transitions. [2018-06-24 20:22:10,233 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:22:10,233 INFO ]: Found error trace [2018-06-24 20:22:10,233 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:10,233 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:10,234 INFO ]: Analyzing trace with hash -902817254, now seen corresponding path program 1 times [2018-06-24 20:22:10,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:10,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:10,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:10,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:10,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:10,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:10,563 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:10,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:10,563 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:22:10,563 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:22:10,563 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:22:10,563 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:10,563 INFO ]: Start difference. First operand 394 states and 798 transitions. Second operand 5 states. [2018-06-24 20:22:11,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:11,233 INFO ]: Finished difference Result 610 states and 1684 transitions. [2018-06-24 20:22:11,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:22:11,233 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:22:11,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:11,286 INFO ]: With dead ends: 610 [2018-06-24 20:22:11,286 INFO ]: Without dead ends: 610 [2018-06-24 20:22:11,287 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:11,287 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-24 20:22:11,409 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-24 20:22:11,409 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:22:11,421 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 846 transitions. [2018-06-24 20:22:11,421 INFO ]: Start accepts. Automaton has 400 states and 846 transitions. Word has length 9 [2018-06-24 20:22:11,421 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:11,421 INFO ]: Abstraction has 400 states and 846 transitions. [2018-06-24 20:22:11,421 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:22:11,421 INFO ]: Start isEmpty. Operand 400 states and 846 transitions. [2018-06-24 20:22:11,441 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:22:11,442 INFO ]: Found error trace [2018-06-24 20:22:11,442 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:11,442 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:11,442 INFO ]: Analyzing trace with hash -902816293, now seen corresponding path program 1 times [2018-06-24 20:22:11,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:11,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:11,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:11,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:11,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:11,482 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:11,643 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:11,643 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:11,643 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:22:11,643 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:22:11,643 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:22:11,643 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:11,643 INFO ]: Start difference. First operand 400 states and 846 transitions. Second operand 5 states. [2018-06-24 20:22:13,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:13,981 INFO ]: Finished difference Result 1026 states and 2834 transitions. [2018-06-24 20:22:14,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:22:14,034 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:22:14,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:14,099 INFO ]: With dead ends: 1026 [2018-06-24 20:22:14,099 INFO ]: Without dead ends: 812 [2018-06-24 20:22:14,099 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:22:14,100 INFO ]: Start minimizeSevpa. Operand 812 states. [2018-06-24 20:22:14,285 INFO ]: Finished minimizeSevpa. Reduced states from 812 to 532. [2018-06-24 20:22:14,285 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:22:14,296 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1122 transitions. [2018-06-24 20:22:14,297 INFO ]: Start accepts. Automaton has 532 states and 1122 transitions. Word has length 9 [2018-06-24 20:22:14,297 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:14,297 INFO ]: Abstraction has 532 states and 1122 transitions. [2018-06-24 20:22:14,297 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:22:14,297 INFO ]: Start isEmpty. Operand 532 states and 1122 transitions. [2018-06-24 20:22:14,324 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:22:14,324 INFO ]: Found error trace [2018-06-24 20:22:14,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:14,324 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:14,324 INFO ]: Analyzing trace with hash -902814371, now seen corresponding path program 1 times [2018-06-24 20:22:14,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:14,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:14,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:14,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:14,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:14,376 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:14,585 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:14,585 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:14,586 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:22:14,586 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:22:14,586 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:22:14,586 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:14,586 INFO ]: Start difference. First operand 532 states and 1122 transitions. Second operand 5 states. [2018-06-24 20:22:15,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:15,217 INFO ]: Finished difference Result 812 states and 2231 transitions. [2018-06-24 20:22:15,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:22:15,217 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:22:15,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:15,265 INFO ]: With dead ends: 812 [2018-06-24 20:22:15,265 INFO ]: Without dead ends: 812 [2018-06-24 20:22:15,265 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:15,266 INFO ]: Start minimizeSevpa. Operand 812 states. [2018-06-24 20:22:15,409 INFO ]: Finished minimizeSevpa. Reduced states from 812 to 532. [2018-06-24 20:22:15,409 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:22:15,422 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1114 transitions. [2018-06-24 20:22:15,422 INFO ]: Start accepts. Automaton has 532 states and 1114 transitions. Word has length 9 [2018-06-24 20:22:15,422 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:15,422 INFO ]: Abstraction has 532 states and 1114 transitions. [2018-06-24 20:22:15,422 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:22:15,422 INFO ]: Start isEmpty. Operand 532 states and 1114 transitions. [2018-06-24 20:22:15,448 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:22:15,448 INFO ]: Found error trace [2018-06-24 20:22:15,448 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:15,449 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:15,449 INFO ]: Analyzing trace with hash -902813410, now seen corresponding path program 1 times [2018-06-24 20:22:15,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:15,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:15,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:15,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:15,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:15,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:15,784 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:15,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:15,785 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:22:15,785 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:22:15,785 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:22:15,785 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:15,785 INFO ]: Start difference. First operand 532 states and 1114 transitions. Second operand 5 states. [2018-06-24 20:22:17,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:17,676 INFO ]: Finished difference Result 812 states and 2223 transitions. [2018-06-24 20:22:17,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:22:17,677 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:22:17,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:17,721 INFO ]: With dead ends: 812 [2018-06-24 20:22:17,721 INFO ]: Without dead ends: 812 [2018-06-24 20:22:17,721 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:22:17,722 INFO ]: Start minimizeSevpa. Operand 812 states. [2018-06-24 20:22:17,857 INFO ]: Finished minimizeSevpa. Reduced states from 812 to 532. [2018-06-24 20:22:17,857 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:22:17,876 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1106 transitions. [2018-06-24 20:22:17,876 INFO ]: Start accepts. Automaton has 532 states and 1106 transitions. Word has length 9 [2018-06-24 20:22:17,876 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:17,876 INFO ]: Abstraction has 532 states and 1106 transitions. [2018-06-24 20:22:17,876 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:22:17,876 INFO ]: Start isEmpty. Operand 532 states and 1106 transitions. [2018-06-24 20:22:17,899 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:22:17,899 INFO ]: Found error trace [2018-06-24 20:22:17,899 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:17,899 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:17,899 INFO ]: Analyzing trace with hash -1608246799, now seen corresponding path program 1 times [2018-06-24 20:22:17,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:17,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:17,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:17,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:17,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:17,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:18,127 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:18,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:18,127 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:22:18,128 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:22:18,128 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:22:18,128 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:22:18,128 INFO ]: Start difference. First operand 532 states and 1106 transitions. Second operand 5 states. [2018-06-24 20:22:20,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:20,499 INFO ]: Finished difference Result 957 states and 2470 transitions. [2018-06-24 20:22:20,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:22:20,499 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:22:20,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:20,532 INFO ]: With dead ends: 957 [2018-06-24 20:22:20,532 INFO ]: Without dead ends: 952 [2018-06-24 20:22:20,533 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:22:20,533 INFO ]: Start minimizeSevpa. Operand 952 states. [2018-06-24 20:22:20,663 INFO ]: Finished minimizeSevpa. Reduced states from 952 to 756. [2018-06-24 20:22:20,663 INFO ]: Start removeUnreachable. Operand 756 states. [2018-06-24 20:22:20,677 INFO ]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1732 transitions. [2018-06-24 20:22:20,677 INFO ]: Start accepts. Automaton has 756 states and 1732 transitions. Word has length 9 [2018-06-24 20:22:20,677 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:20,677 INFO ]: Abstraction has 756 states and 1732 transitions. [2018-06-24 20:22:20,677 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:22:20,677 INFO ]: Start isEmpty. Operand 756 states and 1732 transitions. [2018-06-24 20:22:20,702 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:22:20,702 INFO ]: Found error trace [2018-06-24 20:22:20,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:20,702 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:20,703 INFO ]: Analyzing trace with hash 2072013073, now seen corresponding path program 1 times [2018-06-24 20:22:20,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:20,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:20,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:20,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:20,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:20,736 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:20,969 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:20,969 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:20,969 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:22:20,969 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:22:20,970 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:22:20,970 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:22:20,970 INFO ]: Start difference. First operand 756 states and 1732 transitions. Second operand 6 states. [2018-06-24 20:22:23,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:23,699 INFO ]: Finished difference Result 2836 states and 13299 transitions. [2018-06-24 20:22:23,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:22:23,700 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:22:23,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:24,001 INFO ]: With dead ends: 2836 [2018-06-24 20:22:24,001 INFO ]: Without dead ends: 2836 [2018-06-24 20:22:24,002 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:22:24,004 INFO ]: Start minimizeSevpa. Operand 2836 states. [2018-06-24 20:22:24,859 INFO ]: Finished minimizeSevpa. Reduced states from 2836 to 1546. [2018-06-24 20:22:24,859 INFO ]: Start removeUnreachable. Operand 1546 states. [2018-06-24 20:22:24,918 INFO ]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 3656 transitions. [2018-06-24 20:22:24,918 INFO ]: Start accepts. Automaton has 1546 states and 3656 transitions. Word has length 10 [2018-06-24 20:22:24,918 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:24,918 INFO ]: Abstraction has 1546 states and 3656 transitions. [2018-06-24 20:22:24,918 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:22:24,918 INFO ]: Start isEmpty. Operand 1546 states and 3656 transitions. [2018-06-24 20:22:24,945 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:22:24,945 INFO ]: Found error trace [2018-06-24 20:22:24,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:24,945 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:24,946 INFO ]: Analyzing trace with hash 2076928588, now seen corresponding path program 1 times [2018-06-24 20:22:24,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:24,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:24,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:24,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:24,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:24,985 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:25,386 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:25,386 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:25,386 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:22:25,386 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:22:25,386 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:22:25,386 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:22:25,386 INFO ]: Start difference. First operand 1546 states and 3656 transitions. Second operand 6 states. [2018-06-24 20:22:26,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:26,490 INFO ]: Finished difference Result 2940 states and 11742 transitions. [2018-06-24 20:22:26,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:22:26,490 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:22:26,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:26,745 INFO ]: With dead ends: 2940 [2018-06-24 20:22:26,745 INFO ]: Without dead ends: 2940 [2018-06-24 20:22:26,745 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:22:26,747 INFO ]: Start minimizeSevpa. Operand 2940 states. [2018-06-24 20:22:27,348 INFO ]: Finished minimizeSevpa. Reduced states from 2940 to 1554. [2018-06-24 20:22:27,348 INFO ]: Start removeUnreachable. Operand 1554 states. [2018-06-24 20:22:27,408 INFO ]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 3728 transitions. [2018-06-24 20:22:27,408 INFO ]: Start accepts. Automaton has 1554 states and 3728 transitions. Word has length 10 [2018-06-24 20:22:27,408 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:27,408 INFO ]: Abstraction has 1554 states and 3728 transitions. [2018-06-24 20:22:27,408 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:22:27,408 INFO ]: Start isEmpty. Operand 1554 states and 3728 transitions. [2018-06-24 20:22:27,430 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:22:27,430 INFO ]: Found error trace [2018-06-24 20:22:27,430 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:27,430 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:27,430 INFO ]: Analyzing trace with hash -435821276, now seen corresponding path program 1 times [2018-06-24 20:22:27,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:27,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:27,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:27,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:27,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:27,474 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:27,988 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:27,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:22:27,988 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:22:27,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:28,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:28,117 INFO ]: Computing forward predicates... [2018-06-24 20:22:28,606 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:28,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:22:28,640 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:22:28,641 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:22:28,641 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:22:28,641 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:22:28,641 INFO ]: Start difference. First operand 1554 states and 3728 transitions. Second operand 10 states. [2018-06-24 20:22:40,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:40,625 INFO ]: Finished difference Result 3894 states and 16455 transitions. [2018-06-24 20:22:40,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:22:40,625 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:22:40,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:40,995 INFO ]: With dead ends: 3894 [2018-06-24 20:22:40,995 INFO ]: Without dead ends: 3861 [2018-06-24 20:22:40,996 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:22:40,997 INFO ]: Start minimizeSevpa. Operand 3861 states. [2018-06-24 20:22:42,158 INFO ]: Finished minimizeSevpa. Reduced states from 3861 to 2493. [2018-06-24 20:22:42,158 INFO ]: Start removeUnreachable. Operand 2493 states. [2018-06-24 20:22:42,309 INFO ]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 7368 transitions. [2018-06-24 20:22:42,309 INFO ]: Start accepts. Automaton has 2493 states and 7368 transitions. Word has length 10 [2018-06-24 20:22:42,333 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:42,333 INFO ]: Abstraction has 2493 states and 7368 transitions. [2018-06-24 20:22:42,333 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:22:42,333 INFO ]: Start isEmpty. Operand 2493 states and 7368 transitions. [2018-06-24 20:22:42,388 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:22:42,388 INFO ]: Found error trace [2018-06-24 20:22:42,388 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:42,388 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:42,388 INFO ]: Analyzing trace with hash 1170352277, now seen corresponding path program 1 times [2018-06-24 20:22:42,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:42,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:42,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:42,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:42,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:42,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:42,901 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:42,901 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:42,901 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:22:42,902 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:22:42,902 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:22:42,902 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:22:42,902 INFO ]: Start difference. First operand 2493 states and 7368 transitions. Second operand 6 states. [2018-06-24 20:22:44,626 WARN ]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 20:22:48,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:22:48,283 INFO ]: Finished difference Result 3903 states and 27779 transitions. [2018-06-24 20:22:48,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:22:48,319 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:22:48,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:22:49,024 INFO ]: With dead ends: 3903 [2018-06-24 20:22:49,024 INFO ]: Without dead ends: 3903 [2018-06-24 20:22:49,024 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:22:49,027 INFO ]: Start minimizeSevpa. Operand 3903 states. [2018-06-24 20:22:50,664 INFO ]: Finished minimizeSevpa. Reduced states from 3903 to 2642. [2018-06-24 20:22:50,664 INFO ]: Start removeUnreachable. Operand 2642 states. [2018-06-24 20:22:50,838 INFO ]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 8337 transitions. [2018-06-24 20:22:50,838 INFO ]: Start accepts. Automaton has 2642 states and 8337 transitions. Word has length 10 [2018-06-24 20:22:50,838 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:22:50,838 INFO ]: Abstraction has 2642 states and 8337 transitions. [2018-06-24 20:22:50,838 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:22:50,838 INFO ]: Start isEmpty. Operand 2642 states and 8337 transitions. [2018-06-24 20:22:50,871 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:22:50,871 INFO ]: Found error trace [2018-06-24 20:22:50,871 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:22:50,871 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:50,872 INFO ]: Analyzing trace with hash 1170353238, now seen corresponding path program 1 times [2018-06-24 20:22:50,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:50,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:50,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:50,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:50,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:50,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:22:51,291 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:22:51,291 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:22:51,291 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:22:51,291 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:22:51,292 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:22:51,292 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:22:51,292 INFO ]: Start difference. First operand 2642 states and 8337 transitions. Second operand 6 states. Received shutdown request... [2018-06-24 20:22:51,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:22:51,850 WARN ]: Verification canceled [2018-06-24 20:22:51,853 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:22:51,853 WARN ]: Timeout [2018-06-24 20:22:51,854 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:22:51 BasicIcfg [2018-06-24 20:22:51,854 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:22:51,854 INFO ]: Toolchain (without parser) took 52451.08 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 208.5 MB in the beginning and 486.2 MB in the end (delta: -277.7 MB). Peak memory consumption was 973.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:22:51,855 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:22:51,855 INFO ]: ChcToBoogie took 195.57 ms. Allocated memory is still 308.8 MB. Free memory was 208.5 MB in the beginning and 202.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:22:51,855 INFO ]: Boogie Preprocessor took 96.22 ms. Allocated memory is still 308.8 MB. Free memory was 202.6 MB in the beginning and 199.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 20:22:51,856 INFO ]: RCFGBuilder took 2763.21 ms. Allocated memory was 308.8 MB in the beginning and 362.8 MB in the end (delta: 54.0 MB). Free memory was 199.6 MB in the beginning and 313.4 MB in the end (delta: -113.8 MB). Peak memory consumption was 44.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:22:51,856 INFO ]: BlockEncodingV2 took 884.07 ms. Allocated memory is still 362.8 MB. Free memory was 313.4 MB in the beginning and 205.6 MB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:22:51,857 INFO ]: TraceAbstraction took 48500.65 ms. Allocated memory was 362.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 205.6 MB in the beginning and 486.2 MB in the end (delta: -280.6 MB). Peak memory consumption was 916.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:22:51,860 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 280 edges - StatisticsResult: Encoded RCFG 133 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 195.57 ms. Allocated memory is still 308.8 MB. Free memory was 208.5 MB in the beginning and 202.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 96.22 ms. Allocated memory is still 308.8 MB. Free memory was 202.6 MB in the beginning and 199.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2763.21 ms. Allocated memory was 308.8 MB in the beginning and 362.8 MB in the end (delta: 54.0 MB). Free memory was 199.6 MB in the beginning and 313.4 MB in the end (delta: -113.8 MB). Peak memory consumption was 44.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 884.07 ms. Allocated memory is still 362.8 MB. Free memory was 313.4 MB in the beginning and 205.6 MB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 48500.65 ms. Allocated memory was 362.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 205.6 MB in the beginning and 486.2 MB in the end (delta: -280.6 MB). Peak memory consumption was 916.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2642states) and interpolant automaton (currently 8 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (543 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. TIMEOUT Result, 48.4s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 37.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8963 SDtfs, 1340 SDslu, 19689 SDs, 0 SdLazy, 19743 SolverSat, 2964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2642occurred 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: 5.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 6551 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 2203 SizeOfPredicates, 9 NumberOfNonLiveVariables, 841 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 22/24 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/fortune-full.14.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-22-51-880.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.14.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-22-51-880.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.14.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-22-51-880.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.14.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-22-51-880.csv Completed graceful shutdown