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.16.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:23:45,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:23:45,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:23:45,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:23:45,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:23:45,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:23:45,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:23:45,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:23:45,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:23:45,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:23:45,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:23:45,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:23:45,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:23:45,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:23:45,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:23:45,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:23:45,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:23:45,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:23:45,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:23:45,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:23:45,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:23:45,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:23:45,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:23:45,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:23:45,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:23:45,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:23:45,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:23:45,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:23:45,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:23:45,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:23:45,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:23:45,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:23:45,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:23:45,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:23:45,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:23:45,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:23:45,468 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:23:45,494 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:23:45,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:23:45,494 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:23:45,495 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:23:45,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:23:45,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:23:45,496 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:23:45,496 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:23:45,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:23:45,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:23:45,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:23:45,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:23:45,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:23:45,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:23:45,498 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:23:45,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:23:45,500 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:23:45,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:23:45,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:23:45,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:23:45,501 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:23:45,504 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:23:45,504 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:23:45,553 INFO ]: Repository-Root is: /tmp [2018-06-26 17:23:45,566 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:23:45,570 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:23:45,571 INFO ]: Initializing SmtParser... [2018-06-26 17:23:45,571 INFO ]: SmtParser initialized [2018-06-26 17:23:45,572 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 [2018-06-26 17:23:45,573 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-26 17:23:45,648 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 unknown [2018-06-26 17:23:46,386 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 [2018-06-26 17:23:46,396 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:23:46,413 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:23:46,413 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:23:46,413 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:23:46,413 INFO ]: ChcToBoogie initialized [2018-06-26 17:23:46,431 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,556 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46 Unit [2018-06-26 17:23:46,556 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:23:46,557 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:23:46,557 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:23:46,557 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:23:46,577 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,578 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,594 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,595 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,616 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,620 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,626 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... [2018-06-26 17:23:46,633 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:23:46,634 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:23:46,634 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:23:46,634 INFO ]: RCFGBuilder initialized [2018-06-26 17:23:46,635 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:23:46,647 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:23:46,647 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:23:46,647 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:23:46,647 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:23:46,647 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:23:46,647 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-26 17:23:48,971 INFO ]: Using library mode [2018-06-26 17:23:48,972 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:23:48 BoogieIcfgContainer [2018-06-26 17:23:48,972 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:23:48,973 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:23:48,973 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:23:48,974 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:23:48,975 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:23:48" (1/1) ... [2018-06-26 17:23:49,058 INFO ]: Initial Icfg 144 locations, 279 edges [2018-06-26 17:23:49,060 INFO ]: Using Remove infeasible edges [2018-06-26 17:23:49,060 INFO ]: Using Maximize final states [2018-06-26 17:23:49,061 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:23:49,061 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:23:49,067 INFO ]: Using Remove sink states [2018-06-26 17:23:49,067 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:23:49,067 INFO ]: Using Use SBE [2018-06-26 17:23:49,099 INFO ]: SBE split 0 edges [2018-06-26 17:23:49,109 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:23:49,113 INFO ]: 0 new accepting states [2018-06-26 17:23:49,971 INFO ]: Removed 55 edges and 8 locations by large block encoding [2018-06-26 17:23:49,974 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:23:49,977 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:23:49,978 INFO ]: 0 new accepting states [2018-06-26 17:23:49,982 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:23:49,983 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:23:49,985 INFO ]: Encoded RCFG 133 locations, 267 edges [2018-06-26 17:23:49,985 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:23:49 BasicIcfg [2018-06-26 17:23:49,985 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:23:49,989 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:23:49,989 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:23:49,992 INFO ]: TraceAbstraction initialized [2018-06-26 17:23:49,992 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:23:46" (1/4) ... [2018-06-26 17:23:49,993 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58df38e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:23:49, skipping insertion in model container [2018-06-26 17:23:49,993 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:23:46" (2/4) ... [2018-06-26 17:23:49,994 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58df38e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:23:49, skipping insertion in model container [2018-06-26 17:23:49,994 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:23:48" (3/4) ... [2018-06-26 17:23:49,994 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58df38e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:23:49, skipping insertion in model container [2018-06-26 17:23:49,994 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:23:49" (4/4) ... [2018-06-26 17:23:49,997 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:23:50,006 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:23:50,013 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:23:50,059 INFO ]: Using default assertion order modulation [2018-06-26 17:23:50,059 INFO ]: Interprodecural is true [2018-06-26 17:23:50,059 INFO ]: Hoare is false [2018-06-26 17:23:50,059 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:23:50,059 INFO ]: Backedges is TWOTRACK [2018-06-26 17:23:50,059 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:23:50,059 INFO ]: Difference is false [2018-06-26 17:23:50,059 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:23:50,059 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:23:50,074 INFO ]: Start isEmpty. Operand 133 states. [2018-06-26 17:23:50,112 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:23:50,112 INFO ]: Found error trace [2018-06-26 17:23:50,113 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:23:50,113 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:23:50,122 INFO ]: Analyzing trace with hash 5692172, now seen corresponding path program 1 times [2018-06-26 17:23:50,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:23:50,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:23:50,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:50,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:23:50,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:50,301 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:23:50,567 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:23:50,568 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:23:50,568 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:23:50,570 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:23:50,581 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:23:50,581 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:23:50,584 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-26 17:23:52,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:23:52,175 INFO ]: Finished difference Result 134 states and 364 transitions. [2018-06-26 17:23:52,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:23:52,177 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:23:52,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:23:52,212 INFO ]: With dead ends: 134 [2018-06-26 17:23:52,212 INFO ]: Without dead ends: 134 [2018-06-26 17:23:52,213 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-26 17:23:52,233 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 17:23:52,356 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-26 17:23:52,357 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-26 17:23:52,374 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 364 transitions. [2018-06-26 17:23:52,375 INFO ]: Start accepts. Automaton has 134 states and 364 transitions. Word has length 4 [2018-06-26 17:23:52,376 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:23:52,376 INFO ]: Abstraction has 134 states and 364 transitions. [2018-06-26 17:23:52,376 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:23:52,376 INFO ]: Start isEmpty. Operand 134 states and 364 transitions. [2018-06-26 17:23:52,388 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:23:52,388 INFO ]: Found error trace [2018-06-26 17:23:52,388 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:23:52,388 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:23:52,388 INFO ]: Analyzing trace with hash 175766108, now seen corresponding path program 1 times [2018-06-26 17:23:52,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:23:52,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:23:52,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:52,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:23:52,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:52,422 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:23:52,544 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:23:52,544 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:23:52,544 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:23:52,545 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:23:52,546 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:23:52,546 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:23:52,546 INFO ]: Start difference. First operand 134 states and 364 transitions. Second operand 3 states. [2018-06-26 17:23:55,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:23:55,037 INFO ]: Finished difference Result 264 states and 587 transitions. [2018-06-26 17:23:55,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:23:55,037 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:23:55,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:23:55,056 INFO ]: With dead ends: 264 [2018-06-26 17:23:55,056 INFO ]: Without dead ends: 264 [2018-06-26 17:23:55,057 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-26 17:23:55,058 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-26 17:23:55,114 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-26 17:23:55,114 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-26 17:23:55,125 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 587 transitions. [2018-06-26 17:23:55,125 INFO ]: Start accepts. Automaton has 264 states and 587 transitions. Word has length 5 [2018-06-26 17:23:55,125 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:23:55,125 INFO ]: Abstraction has 264 states and 587 transitions. [2018-06-26 17:23:55,125 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:23:55,125 INFO ]: Start isEmpty. Operand 264 states and 587 transitions. [2018-06-26 17:23:55,133 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:23:55,133 INFO ]: Found error trace [2018-06-26 17:23:55,133 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:23:55,133 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:23:55,133 INFO ]: Analyzing trace with hash 175832417, now seen corresponding path program 1 times [2018-06-26 17:23:55,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:23:55,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:23:55,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:55,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:23:55,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:55,150 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:23:55,254 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:23:55,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:23:55,255 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:23:55,255 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:23:55,255 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:23:55,255 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:23:55,255 INFO ]: Start difference. First operand 264 states and 587 transitions. Second operand 3 states. [2018-06-26 17:23:56,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:23:56,514 INFO ]: Finished difference Result 394 states and 795 transitions. [2018-06-26 17:23:56,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:23:56,514 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:23:56,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:23:56,533 INFO ]: With dead ends: 394 [2018-06-26 17:23:56,533 INFO ]: Without dead ends: 394 [2018-06-26 17:23:56,533 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-26 17:23:56,533 INFO ]: Start minimizeSevpa. Operand 394 states. [2018-06-26 17:23:56,611 INFO ]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-06-26 17:23:56,612 INFO ]: Start removeUnreachable. Operand 394 states. [2018-06-26 17:23:56,625 INFO ]: Finished removeUnreachable. Reduced from 394 states to 394 states and 795 transitions. [2018-06-26 17:23:56,626 INFO ]: Start accepts. Automaton has 394 states and 795 transitions. Word has length 5 [2018-06-26 17:23:56,627 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:23:56,627 INFO ]: Abstraction has 394 states and 795 transitions. [2018-06-26 17:23:56,627 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:23:56,627 INFO ]: Start isEmpty. Operand 394 states and 795 transitions. [2018-06-26 17:23:56,647 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:23:56,647 INFO ]: Found error trace [2018-06-26 17:23:56,648 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:23:56,648 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:23:56,648 INFO ]: Analyzing trace with hash -746509647, now seen corresponding path program 1 times [2018-06-26 17:23:56,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:23:56,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:23:56,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:56,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:23:56,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:23:56,690 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:23:57,052 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:23:57,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:23:57,052 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:23:57,052 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:23:57,052 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:23:57,052 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:23:57,052 INFO ]: Start difference. First operand 394 states and 795 transitions. Second operand 5 states. [2018-06-26 17:23:59,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:23:59,785 INFO ]: Finished difference Result 998 states and 2584 transitions. [2018-06-26 17:23:59,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:23:59,785 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:23:59,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:23:59,862 INFO ]: With dead ends: 998 [2018-06-26 17:23:59,862 INFO ]: Without dead ends: 893 [2018-06-26 17:23:59,862 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-26 17:23:59,863 INFO ]: Start minimizeSevpa. Operand 893 states. [2018-06-26 17:24:00,055 INFO ]: Finished minimizeSevpa. Reduced states from 893 to 752. [2018-06-26 17:24:00,055 INFO ]: Start removeUnreachable. Operand 752 states. [2018-06-26 17:24:00,081 INFO ]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1679 transitions. [2018-06-26 17:24:00,081 INFO ]: Start accepts. Automaton has 752 states and 1679 transitions. Word has length 9 [2018-06-26 17:24:00,081 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:00,081 INFO ]: Abstraction has 752 states and 1679 transitions. [2018-06-26 17:24:00,081 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:24:00,081 INFO ]: Start isEmpty. Operand 752 states and 1679 transitions. [2018-06-26 17:24:00,109 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:24:00,109 INFO ]: Found error trace [2018-06-26 17:24:00,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:00,109 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:00,110 INFO ]: Analyzing trace with hash 640454396, now seen corresponding path program 1 times [2018-06-26 17:24:00,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:00,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:00,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:00,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:00,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:00,166 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:00,335 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:00,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:00,335 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:24:00,335 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:24:00,335 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:24:00,335 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:24:00,335 INFO ]: Start difference. First operand 752 states and 1679 transitions. Second operand 5 states. [2018-06-26 17:24:01,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:01,287 INFO ]: Finished difference Result 1256 states and 3993 transitions. [2018-06-26 17:24:01,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:24:01,287 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:24:01,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:01,418 INFO ]: With dead ends: 1256 [2018-06-26 17:24:01,418 INFO ]: Without dead ends: 1114 [2018-06-26 17:24:01,418 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-26 17:24:01,419 INFO ]: Start minimizeSevpa. Operand 1114 states. [2018-06-26 17:24:01,689 INFO ]: Finished minimizeSevpa. Reduced states from 1114 to 763. [2018-06-26 17:24:01,689 INFO ]: Start removeUnreachable. Operand 763 states. [2018-06-26 17:24:01,717 INFO ]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1748 transitions. [2018-06-26 17:24:01,717 INFO ]: Start accepts. Automaton has 763 states and 1748 transitions. Word has length 9 [2018-06-26 17:24:01,717 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:01,717 INFO ]: Abstraction has 763 states and 1748 transitions. [2018-06-26 17:24:01,717 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:24:01,717 INFO ]: Start isEmpty. Operand 763 states and 1748 transitions. [2018-06-26 17:24:01,741 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:24:01,741 INFO ]: Found error trace [2018-06-26 17:24:01,741 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:01,741 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:01,742 INFO ]: Analyzing trace with hash 640455357, now seen corresponding path program 1 times [2018-06-26 17:24:01,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:01,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:01,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:01,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:01,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:01,794 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:02,100 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:02,100 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:02,100 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:24:02,100 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:24:02,100 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:24:02,100 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:24:02,100 INFO ]: Start difference. First operand 763 states and 1748 transitions. Second operand 5 states. [2018-06-26 17:24:06,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:06,162 INFO ]: Finished difference Result 1114 states and 3532 transitions. [2018-06-26 17:24:06,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:24:06,165 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:24:06,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:06,246 INFO ]: With dead ends: 1114 [2018-06-26 17:24:06,246 INFO ]: Without dead ends: 1114 [2018-06-26 17:24:06,246 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-26 17:24:06,247 INFO ]: Start minimizeSevpa. Operand 1114 states. [2018-06-26 17:24:06,505 INFO ]: Finished minimizeSevpa. Reduced states from 1114 to 763. [2018-06-26 17:24:06,505 INFO ]: Start removeUnreachable. Operand 763 states. [2018-06-26 17:24:06,530 INFO ]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1743 transitions. [2018-06-26 17:24:06,530 INFO ]: Start accepts. Automaton has 763 states and 1743 transitions. Word has length 9 [2018-06-26 17:24:06,530 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:06,530 INFO ]: Abstraction has 763 states and 1743 transitions. [2018-06-26 17:24:06,530 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:24:06,530 INFO ]: Start isEmpty. Operand 763 states and 1743 transitions. [2018-06-26 17:24:06,552 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:24:06,552 INFO ]: Found error trace [2018-06-26 17:24:06,552 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:06,552 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:06,552 INFO ]: Analyzing trace with hash 640460162, now seen corresponding path program 1 times [2018-06-26 17:24:06,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:06,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:06,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:06,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:06,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:06,585 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:06,889 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:06,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:06,889 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:24:06,890 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:24:06,890 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:24:06,890 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:24:06,890 INFO ]: Start difference. First operand 763 states and 1743 transitions. Second operand 5 states. [2018-06-26 17:24:08,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:08,550 INFO ]: Finished difference Result 1114 states and 3527 transitions. [2018-06-26 17:24:08,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:24:08,553 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:24:08,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:08,645 INFO ]: With dead ends: 1114 [2018-06-26 17:24:08,645 INFO ]: Without dead ends: 1114 [2018-06-26 17:24:08,645 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-26 17:24:08,647 INFO ]: Start minimizeSevpa. Operand 1114 states. [2018-06-26 17:24:08,957 INFO ]: Finished minimizeSevpa. Reduced states from 1114 to 763. [2018-06-26 17:24:08,957 INFO ]: Start removeUnreachable. Operand 763 states. [2018-06-26 17:24:08,980 INFO ]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1738 transitions. [2018-06-26 17:24:08,980 INFO ]: Start accepts. Automaton has 763 states and 1738 transitions. Word has length 9 [2018-06-26 17:24:08,980 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:08,980 INFO ]: Abstraction has 763 states and 1738 transitions. [2018-06-26 17:24:08,980 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:24:08,980 INFO ]: Start isEmpty. Operand 763 states and 1738 transitions. [2018-06-26 17:24:09,003 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:24:09,004 INFO ]: Found error trace [2018-06-26 17:24:09,004 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:09,004 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:09,004 INFO ]: Analyzing trace with hash 508257349, now seen corresponding path program 1 times [2018-06-26 17:24:09,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:09,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:09,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:09,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:09,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:09,041 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:09,548 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:09,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:24:09,549 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-26 17:24:09,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:09,675 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:09,686 INFO ]: Computing forward predicates... [2018-06-26 17:24:09,885 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:09,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:24:09,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 17:24:09,920 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:24:09,920 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:24:09,920 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:24:09,920 INFO ]: Start difference. First operand 763 states and 1738 transitions. Second operand 10 states. [2018-06-26 17:24:21,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:21,729 INFO ]: Finished difference Result 1509 states and 5449 transitions. [2018-06-26 17:24:21,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:24:21,729 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 17:24:21,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:21,893 INFO ]: With dead ends: 1509 [2018-06-26 17:24:21,893 INFO ]: Without dead ends: 1497 [2018-06-26 17:24:21,893 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:24:21,894 INFO ]: Start minimizeSevpa. Operand 1497 states. [2018-06-26 17:24:22,344 INFO ]: Finished minimizeSevpa. Reduced states from 1497 to 1012. [2018-06-26 17:24:22,344 INFO ]: Start removeUnreachable. Operand 1012 states. [2018-06-26 17:24:22,383 INFO ]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 2501 transitions. [2018-06-26 17:24:22,383 INFO ]: Start accepts. Automaton has 1012 states and 2501 transitions. Word has length 10 [2018-06-26 17:24:22,383 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:22,383 INFO ]: Abstraction has 1012 states and 2501 transitions. [2018-06-26 17:24:22,383 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:24:22,383 INFO ]: Start isEmpty. Operand 1012 states and 2501 transitions. [2018-06-26 17:24:22,436 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:24:22,437 INFO ]: Found error trace [2018-06-26 17:24:22,437 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:22,437 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:22,437 INFO ]: Analyzing trace with hash -1626111888, now seen corresponding path program 1 times [2018-06-26 17:24:22,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:22,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:22,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:22,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:22,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:22,482 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:22,899 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:22,899 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:22,899 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:24:22,900 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:24:22,900 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:24:22,900 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:24:22,900 INFO ]: Start difference. First operand 1012 states and 2501 transitions. Second operand 6 states. [2018-06-26 17:24:25,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:25,399 INFO ]: Finished difference Result 2970 states and 15120 transitions. [2018-06-26 17:24:25,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:24:25,399 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:24:25,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:25,713 INFO ]: With dead ends: 2970 [2018-06-26 17:24:25,713 INFO ]: Without dead ends: 2970 [2018-06-26 17:24:25,713 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:24:25,715 INFO ]: Start minimizeSevpa. Operand 2970 states. [2018-06-26 17:24:26,963 INFO ]: Finished minimizeSevpa. Reduced states from 2970 to 1568. [2018-06-26 17:24:26,963 INFO ]: Start removeUnreachable. Operand 1568 states. [2018-06-26 17:24:27,060 INFO ]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 3926 transitions. [2018-06-26 17:24:27,060 INFO ]: Start accepts. Automaton has 1568 states and 3926 transitions. Word has length 10 [2018-06-26 17:24:27,061 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:27,061 INFO ]: Abstraction has 1568 states and 3926 transitions. [2018-06-26 17:24:27,061 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:24:27,061 INFO ]: Start isEmpty. Operand 1568 states and 3926 transitions. [2018-06-26 17:24:27,088 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:24:27,088 INFO ]: Found error trace [2018-06-26 17:24:27,088 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:27,088 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:27,089 INFO ]: Analyzing trace with hash -1621166582, now seen corresponding path program 1 times [2018-06-26 17:24:27,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:27,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:27,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:27,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:27,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:27,136 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:27,447 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:27,447 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:27,447 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:24:27,447 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:24:27,447 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:24:27,447 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:24:27,447 INFO ]: Start difference. First operand 1568 states and 3926 transitions. Second operand 6 states. [2018-06-26 17:24:28,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:28,261 INFO ]: Finished difference Result 2962 states and 12866 transitions. [2018-06-26 17:24:28,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:24:28,261 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:24:28,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:28,696 INFO ]: With dead ends: 2962 [2018-06-26 17:24:28,696 INFO ]: Without dead ends: 2962 [2018-06-26 17:24:28,696 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:24:28,697 INFO ]: Start minimizeSevpa. Operand 2962 states. [2018-06-26 17:24:29,423 INFO ]: Finished minimizeSevpa. Reduced states from 2962 to 1576. [2018-06-26 17:24:29,423 INFO ]: Start removeUnreachable. Operand 1576 states. [2018-06-26 17:24:29,495 INFO ]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3998 transitions. [2018-06-26 17:24:29,495 INFO ]: Start accepts. Automaton has 1576 states and 3998 transitions. Word has length 10 [2018-06-26 17:24:29,495 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:29,495 INFO ]: Abstraction has 1576 states and 3998 transitions. [2018-06-26 17:24:29,495 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:24:29,495 INFO ]: Start isEmpty. Operand 1576 states and 3998 transitions. [2018-06-26 17:24:29,521 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:24:29,521 INFO ]: Found error trace [2018-06-26 17:24:29,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:29,521 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:29,521 INFO ]: Analyzing trace with hash -1499555464, now seen corresponding path program 1 times [2018-06-26 17:24:29,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:29,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:29,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:29,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:29,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:29,560 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:30,001 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:30,001 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:30,001 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:24:30,001 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:24:30,001 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:24:30,001 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:24:30,001 INFO ]: Start difference. First operand 1576 states and 3998 transitions. Second operand 6 states. [2018-06-26 17:24:34,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:24:34,564 INFO ]: Finished difference Result 2419 states and 11531 transitions. [2018-06-26 17:24:34,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:24:34,564 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:24:34,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:24:34,785 INFO ]: With dead ends: 2419 [2018-06-26 17:24:34,785 INFO ]: Without dead ends: 2419 [2018-06-26 17:24:34,785 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:24:34,786 INFO ]: Start minimizeSevpa. Operand 2419 states. [2018-06-26 17:24:35,511 INFO ]: Finished minimizeSevpa. Reduced states from 2419 to 1600. [2018-06-26 17:24:35,511 INFO ]: Start removeUnreachable. Operand 1600 states. [2018-06-26 17:24:35,588 INFO ]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 4110 transitions. [2018-06-26 17:24:35,588 INFO ]: Start accepts. Automaton has 1600 states and 4110 transitions. Word has length 10 [2018-06-26 17:24:35,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:24:35,588 INFO ]: Abstraction has 1600 states and 4110 transitions. [2018-06-26 17:24:35,588 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:24:35,588 INFO ]: Start isEmpty. Operand 1600 states and 4110 transitions. [2018-06-26 17:24:35,613 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:24:35,613 INFO ]: Found error trace [2018-06-26 17:24:35,613 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:24:35,614 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:24:35,616 INFO ]: Analyzing trace with hash -1499554503, now seen corresponding path program 1 times [2018-06-26 17:24:35,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:24:35,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:24:35,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:35,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:24:35,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:24:35,661 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:24:36,042 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:24:36,042 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:24:36,042 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:24:36,043 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:24:36,043 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:24:36,043 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:24:36,043 INFO ]: Start difference. First operand 1600 states and 4110 transitions. Second operand 6 states. Received shutdown request... [2018-06-26 17:24:37,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:24:37,603 WARN ]: Verification canceled [2018-06-26 17:24:37,606 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:24:37,607 WARN ]: Timeout [2018-06-26 17:24:37,607 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:24:37 BasicIcfg [2018-06-26 17:24:37,607 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:24:37,608 INFO ]: Toolchain (without parser) took 51211.87 ms. Allocated memory was 305.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 212.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:24:37,610 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:24:37,610 INFO ]: ChcToBoogie took 143.73 ms. Allocated memory is still 305.1 MB. Free memory was 212.6 MB in the beginning and 207.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:24:37,610 INFO ]: Boogie Preprocessor took 76.29 ms. Allocated memory is still 305.1 MB. Free memory was 207.7 MB in the beginning and 204.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:24:37,611 INFO ]: RCFGBuilder took 2338.07 ms. Allocated memory was 305.1 MB in the beginning and 327.7 MB in the end (delta: 22.5 MB). Free memory was 203.7 MB in the beginning and 175.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 50.4 MB. Max. memory is 3.6 GB. [2018-06-26 17:24:37,611 INFO ]: BlockEncodingV2 took 1012.99 ms. Allocated memory was 327.7 MB in the beginning and 367.5 MB in the end (delta: 39.8 MB). Free memory was 175.8 MB in the beginning and 241.2 MB in the end (delta: -65.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:24:37,611 INFO ]: TraceAbstraction took 47618.36 ms. Allocated memory was 367.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 241.2 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:24:37,614 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 279 edges - StatisticsResult: Encoded RCFG 133 locations, 267 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 143.73 ms. Allocated memory is still 305.1 MB. Free memory was 212.6 MB in the beginning and 207.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 76.29 ms. Allocated memory is still 305.1 MB. Free memory was 207.7 MB in the beginning and 204.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2338.07 ms. Allocated memory was 305.1 MB in the beginning and 327.7 MB in the end (delta: 22.5 MB). Free memory was 203.7 MB in the beginning and 175.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 50.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1012.99 ms. Allocated memory was 327.7 MB in the beginning and 367.5 MB in the end (delta: 39.8 MB). Free memory was 175.8 MB in the beginning and 241.2 MB in the end (delta: -65.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 47618.36 ms. Allocated memory was 367.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 241.2 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). There was no memory consumed. 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 (1600states) and interpolant automaton (currently 9 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (1363 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. TIMEOUT Result, 47.5s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 37.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8099 SDtfs, 1529 SDslu, 16626 SDs, 0 SdLazy, 15973 SolverSat, 3091 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1600occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 5286 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873 SizeOfPredicates, 9 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 20/22 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.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-24-37-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-24-37-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-24-37-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-24-37-624.csv Completed graceful shutdown