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/hopv/lia/mochi/file.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:18:38,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:18:38,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:18:38,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:18:38,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:18:38,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:18:38,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:18:38,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:18:38,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:18:38,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:18:38,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:18:38,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:18:38,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:18:38,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:18:38,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:18:38,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:18:38,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:18:38,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:18:38,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:18:38,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:18:38,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:18:38,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:18:38,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:18:38,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:18:38,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:18:38,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:18:38,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:18:38,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:18:38,079 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:18:38,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:18:38,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:18:38,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:18:38,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:18:38,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:18:38,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:18:38,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:18:38,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:18:38,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:18:38,108 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:18:38,108 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:18:38,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:18:38,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:18:38,110 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:18:38,110 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:18:38,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:18:38,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:18:38,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:18:38,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:18:38,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:18:38,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:18:38,112 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:18:38,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:18:38,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:18:38,113 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:18:38,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:18:38,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:18:38,113 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:18:38,118 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:18:38,118 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:18:38,173 INFO ]: Repository-Root is: /tmp [2018-06-24 21:18:38,193 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:18:38,199 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:18:38,200 INFO ]: Initializing SmtParser... [2018-06-24 21:18:38,201 INFO ]: SmtParser initialized [2018-06-24 21:18:38,202 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/file.smt2 [2018-06-24 21:18:38,203 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 21:18:38,290 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/file.smt2 unknown [2018-06-24 21:18:38,615 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/file.smt2 [2018-06-24 21:18:38,624 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:18:38,631 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:18:38,632 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:18:38,632 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:18:38,632 INFO ]: ChcToBoogie initialized [2018-06-24 21:18:38,635 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,699 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38 Unit [2018-06-24 21:18:38,699 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:18:38,700 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:18:38,700 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:18:38,700 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:18:38,722 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,722 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,732 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,732 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,737 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,750 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,752 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (1/1) ... [2018-06-24 21:18:38,754 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:18:38,754 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:18:38,754 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:18:38,754 INFO ]: RCFGBuilder initialized [2018-06-24 21:18:38,755 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (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 21:18:38,773 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:18:38,773 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:18:38,773 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:18:38,773 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:18:38,773 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:18:38,773 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 21:18:39,310 INFO ]: Using library mode [2018-06-24 21:18:39,310 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:18:39 BoogieIcfgContainer [2018-06-24 21:18:39,310 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:18:39,311 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:18:39,311 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:18:39,312 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:18:39,312 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:18:39" (1/1) ... [2018-06-24 21:18:39,336 INFO ]: Initial Icfg 40 locations, 66 edges [2018-06-24 21:18:39,338 INFO ]: Using Remove infeasible edges [2018-06-24 21:18:39,339 INFO ]: Using Maximize final states [2018-06-24 21:18:39,339 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:18:39,339 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:18:39,341 INFO ]: Using Remove sink states [2018-06-24 21:18:39,342 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:18:39,342 INFO ]: Using Use SBE [2018-06-24 21:18:39,361 INFO ]: SBE split 0 edges [2018-06-24 21:18:39,369 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:18:39,373 INFO ]: 0 new accepting states [2018-06-24 21:18:39,688 INFO ]: Removed 48 edges and 13 locations by large block encoding [2018-06-24 21:18:39,689 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:18:39,691 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:18:39,691 INFO ]: 0 new accepting states [2018-06-24 21:18:39,692 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:18:39,692 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:18:39,692 INFO ]: Encoded RCFG 25 locations, 51 edges [2018-06-24 21:18:39,693 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:18:39 BasicIcfg [2018-06-24 21:18:39,693 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:18:39,694 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:18:39,694 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:18:39,697 INFO ]: TraceAbstraction initialized [2018-06-24 21:18:39,697 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:18:38" (1/4) ... [2018-06-24 21:18:39,699 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b9ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:18:39, skipping insertion in model container [2018-06-24 21:18:39,699 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:38" (2/4) ... [2018-06-24 21:18:39,699 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b9ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:18:39, skipping insertion in model container [2018-06-24 21:18:39,699 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:18:39" (3/4) ... [2018-06-24 21:18:39,699 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b9ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:18:39, skipping insertion in model container [2018-06-24 21:18:39,700 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:18:39" (4/4) ... [2018-06-24 21:18:39,702 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:18:39,711 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:18:39,728 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:18:39,777 INFO ]: Using default assertion order modulation [2018-06-24 21:18:39,777 INFO ]: Interprodecural is true [2018-06-24 21:18:39,777 INFO ]: Hoare is false [2018-06-24 21:18:39,777 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:18:39,777 INFO ]: Backedges is TWOTRACK [2018-06-24 21:18:39,777 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:18:39,777 INFO ]: Difference is false [2018-06-24 21:18:39,777 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:18:39,777 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:18:39,793 INFO ]: Start isEmpty. Operand 25 states. [2018-06-24 21:18:39,815 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:18:39,815 INFO ]: Found error trace [2018-06-24 21:18:39,816 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:18:39,817 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:39,821 INFO ]: Analyzing trace with hash 1271265, now seen corresponding path program 1 times [2018-06-24 21:18:39,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:39,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:39,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:39,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:39,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:39,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:39,942 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:18:39,944 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:39,944 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:39,945 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:39,957 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:39,957 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:39,960 INFO ]: Start difference. First operand 25 states. Second operand 3 states. [2018-06-24 21:18:40,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:40,480 INFO ]: Finished difference Result 46 states and 94 transitions. [2018-06-24 21:18:40,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:40,481 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:18:40,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:40,493 INFO ]: With dead ends: 46 [2018-06-24 21:18:40,493 INFO ]: Without dead ends: 45 [2018-06-24 21:18:40,494 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 21:18:40,509 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:18:40,552 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-24 21:18:40,553 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:18:40,556 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 91 transitions. [2018-06-24 21:18:40,558 INFO ]: Start accepts. Automaton has 45 states and 91 transitions. Word has length 4 [2018-06-24 21:18:40,558 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:40,558 INFO ]: Abstraction has 45 states and 91 transitions. [2018-06-24 21:18:40,558 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:40,558 INFO ]: Start isEmpty. Operand 45 states and 91 transitions. [2018-06-24 21:18:40,560 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:18:40,560 INFO ]: Found error trace [2018-06-24 21:18:40,560 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:18:40,560 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:40,560 INFO ]: Analyzing trace with hash 39164456, now seen corresponding path program 1 times [2018-06-24 21:18:40,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:40,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:40,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:40,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:40,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:40,568 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:40,610 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:18:40,610 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:40,610 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:40,611 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:40,611 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:40,611 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:40,612 INFO ]: Start difference. First operand 45 states and 91 transitions. Second operand 3 states. [2018-06-24 21:18:40,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:40,964 INFO ]: Finished difference Result 66 states and 134 transitions. [2018-06-24 21:18:40,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:40,964 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:18:40,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:40,969 INFO ]: With dead ends: 66 [2018-06-24 21:18:40,969 INFO ]: Without dead ends: 66 [2018-06-24 21:18:40,970 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 21:18:40,970 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 21:18:40,982 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-24 21:18:40,982 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:18:40,984 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2018-06-24 21:18:40,984 INFO ]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 5 [2018-06-24 21:18:40,985 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:40,985 INFO ]: Abstraction has 66 states and 134 transitions. [2018-06-24 21:18:40,985 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:40,985 INFO ]: Start isEmpty. Operand 66 states and 134 transitions. [2018-06-24 21:18:40,991 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:18:40,991 INFO ]: Found error trace [2018-06-24 21:18:40,991 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:40,991 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:40,991 INFO ]: Analyzing trace with hash 968337002, now seen corresponding path program 1 times [2018-06-24 21:18:40,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:40,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:40,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:40,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:40,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:41,004 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:41,046 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:18:41,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:41,046 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:41,046 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:41,047 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:41,047 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:41,047 INFO ]: Start difference. First operand 66 states and 134 transitions. Second operand 3 states. [2018-06-24 21:18:41,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:41,634 INFO ]: Finished difference Result 87 states and 179 transitions. [2018-06-24 21:18:41,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:41,635 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 21:18:41,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:41,644 INFO ]: With dead ends: 87 [2018-06-24 21:18:41,644 INFO ]: Without dead ends: 87 [2018-06-24 21:18:41,644 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 21:18:41,645 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-24 21:18:41,670 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-24 21:18:41,671 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 21:18:41,677 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 179 transitions. [2018-06-24 21:18:41,677 INFO ]: Start accepts. Automaton has 87 states and 179 transitions. Word has length 13 [2018-06-24 21:18:41,677 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:41,677 INFO ]: Abstraction has 87 states and 179 transitions. [2018-06-24 21:18:41,677 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:41,677 INFO ]: Start isEmpty. Operand 87 states and 179 transitions. [2018-06-24 21:18:41,681 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:18:41,681 INFO ]: Found error trace [2018-06-24 21:18:41,682 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:41,682 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:41,682 INFO ]: Analyzing trace with hash 1097419721, now seen corresponding path program 1 times [2018-06-24 21:18:41,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:41,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:41,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:41,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:41,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:41,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:41,799 INFO ]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:41,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:41,799 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) [2018-06-24 21:18:41,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:41,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:41,859 INFO ]: Computing forward predicates... [2018-06-24 21:18:41,880 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:18:41,917 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:18:41,917 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:18:41,918 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:41,918 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:41,918 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:41,918 INFO ]: Start difference. First operand 87 states and 179 transitions. Second operand 3 states. [2018-06-24 21:18:42,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:42,224 INFO ]: Finished difference Result 108 states and 209 transitions. [2018-06-24 21:18:42,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:42,225 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 21:18:42,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:42,228 INFO ]: With dead ends: 108 [2018-06-24 21:18:42,228 INFO ]: Without dead ends: 108 [2018-06-24 21:18:42,228 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 14 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 21:18:42,229 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-24 21:18:42,257 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-06-24 21:18:42,258 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-24 21:18:42,263 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 209 transitions. [2018-06-24 21:18:42,264 INFO ]: Start accepts. Automaton has 108 states and 209 transitions. Word has length 13 [2018-06-24 21:18:42,264 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:42,266 INFO ]: Abstraction has 108 states and 209 transitions. [2018-06-24 21:18:42,266 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:42,266 INFO ]: Start isEmpty. Operand 108 states and 209 transitions. [2018-06-24 21:18:42,274 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:18:42,274 INFO ]: Found error trace [2018-06-24 21:18:42,274 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:42,274 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:42,275 INFO ]: Analyzing trace with hash 793227753, now seen corresponding path program 1 times [2018-06-24 21:18:42,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:42,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:42,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:42,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:42,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:42,313 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:42,400 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:18:42,400 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:42,400 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:18:42,400 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:18:42,401 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:18:42,401 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:18:42,401 INFO ]: Start difference. First operand 108 states and 209 transitions. Second operand 4 states. [2018-06-24 21:18:42,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:42,632 INFO ]: Finished difference Result 283 states and 791 transitions. [2018-06-24 21:18:42,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:18:42,634 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-24 21:18:42,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:42,669 INFO ]: With dead ends: 283 [2018-06-24 21:18:42,670 INFO ]: Without dead ends: 283 [2018-06-24 21:18:42,670 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:18:42,670 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-24 21:18:42,742 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 143. [2018-06-24 21:18:42,742 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-24 21:18:42,751 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 274 transitions. [2018-06-24 21:18:42,751 INFO ]: Start accepts. Automaton has 143 states and 274 transitions. Word has length 13 [2018-06-24 21:18:42,751 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:42,751 INFO ]: Abstraction has 143 states and 274 transitions. [2018-06-24 21:18:42,751 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:18:42,752 INFO ]: Start isEmpty. Operand 143 states and 274 transitions. [2018-06-24 21:18:42,756 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:18:42,756 INFO ]: Found error trace [2018-06-24 21:18:42,756 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:42,757 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:42,757 INFO ]: Analyzing trace with hash 793232558, now seen corresponding path program 1 times [2018-06-24 21:18:42,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:42,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:42,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:42,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:42,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:42,785 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:43,050 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:43,050 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:43,050 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:18:43,051 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:18:43,051 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:18:43,051 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:18:43,051 INFO ]: Start difference. First operand 143 states and 274 transitions. Second operand 4 states. [2018-06-24 21:18:43,281 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:18:43,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:43,966 INFO ]: Finished difference Result 325 states and 842 transitions. [2018-06-24 21:18:43,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:18:43,989 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-24 21:18:43,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:44,001 INFO ]: With dead ends: 325 [2018-06-24 21:18:44,001 INFO ]: Without dead ends: 257 [2018-06-24 21:18:44,002 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:18:44,002 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-24 21:18:44,030 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 181. [2018-06-24 21:18:44,030 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-24 21:18:44,034 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 383 transitions. [2018-06-24 21:18:44,034 INFO ]: Start accepts. Automaton has 181 states and 383 transitions. Word has length 13 [2018-06-24 21:18:44,034 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:44,034 INFO ]: Abstraction has 181 states and 383 transitions. [2018-06-24 21:18:44,034 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:18:44,034 INFO ]: Start isEmpty. Operand 181 states and 383 transitions. [2018-06-24 21:18:44,036 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:18:44,036 INFO ]: Found error trace [2018-06-24 21:18:44,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:44,036 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:44,036 INFO ]: Analyzing trace with hash 821861709, now seen corresponding path program 1 times [2018-06-24 21:18:44,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:44,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:44,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:44,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:44,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:44,044 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:44,149 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:44,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:44,149 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:18:44,150 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:18:44,150 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:18:44,150 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:18:44,150 INFO ]: Start difference. First operand 181 states and 383 transitions. Second operand 4 states. [2018-06-24 21:18:44,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:44,712 INFO ]: Finished difference Result 276 states and 807 transitions. [2018-06-24 21:18:44,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:18:44,712 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-24 21:18:44,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:44,722 INFO ]: With dead ends: 276 [2018-06-24 21:18:44,722 INFO ]: Without dead ends: 276 [2018-06-24 21:18:44,723 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:18:44,723 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-24 21:18:44,757 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 182. [2018-06-24 21:18:44,758 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-24 21:18:44,761 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 433 transitions. [2018-06-24 21:18:44,761 INFO ]: Start accepts. Automaton has 182 states and 433 transitions. Word has length 13 [2018-06-24 21:18:44,762 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:44,762 INFO ]: Abstraction has 182 states and 433 transitions. [2018-06-24 21:18:44,762 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:18:44,762 INFO ]: Start isEmpty. Operand 182 states and 433 transitions. [2018-06-24 21:18:44,763 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:18:44,763 INFO ]: Found error trace [2018-06-24 21:18:44,763 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:44,764 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:44,764 INFO ]: Analyzing trace with hash 879120011, now seen corresponding path program 1 times [2018-06-24 21:18:44,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:44,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:44,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:44,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:44,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:44,772 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:44,826 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:44,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:44,826 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:18:44,826 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:18:44,827 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:18:44,827 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:18:44,827 INFO ]: Start difference. First operand 182 states and 433 transitions. Second operand 4 states. [2018-06-24 21:18:45,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:45,030 INFO ]: Finished difference Result 287 states and 898 transitions. [2018-06-24 21:18:45,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:18:45,030 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-24 21:18:45,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:45,042 INFO ]: With dead ends: 287 [2018-06-24 21:18:45,042 INFO ]: Without dead ends: 287 [2018-06-24 21:18:45,042 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:18:45,042 INFO ]: Start minimizeSevpa. Operand 287 states. [2018-06-24 21:18:45,074 INFO ]: Finished minimizeSevpa. Reduced states from 287 to 186. [2018-06-24 21:18:45,074 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-24 21:18:45,078 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 492 transitions. [2018-06-24 21:18:45,078 INFO ]: Start accepts. Automaton has 186 states and 492 transitions. Word has length 13 [2018-06-24 21:18:45,078 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:45,078 INFO ]: Abstraction has 186 states and 492 transitions. [2018-06-24 21:18:45,078 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:18:45,078 INFO ]: Start isEmpty. Operand 186 states and 492 transitions. [2018-06-24 21:18:45,080 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:18:45,080 INFO ]: Found error trace [2018-06-24 21:18:45,080 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:45,080 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:45,080 INFO ]: Analyzing trace with hash 706326509, now seen corresponding path program 1 times [2018-06-24 21:18:45,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:45,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:45,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:45,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:45,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:45,084 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:45,157 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:18:45,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:45,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:45,157 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:45,157 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:45,157 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:45,157 INFO ]: Start difference. First operand 186 states and 492 transitions. Second operand 3 states. [2018-06-24 21:18:45,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:45,327 INFO ]: Finished difference Result 206 states and 546 transitions. [2018-06-24 21:18:45,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:45,328 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 21:18:45,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:45,332 INFO ]: With dead ends: 206 [2018-06-24 21:18:45,332 INFO ]: Without dead ends: 186 [2018-06-24 21:18:45,332 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 21:18:45,332 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-24 21:18:45,351 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-06-24 21:18:45,351 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-24 21:18:45,354 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 491 transitions. [2018-06-24 21:18:45,354 INFO ]: Start accepts. Automaton has 186 states and 491 transitions. Word has length 14 [2018-06-24 21:18:45,354 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:45,354 INFO ]: Abstraction has 186 states and 491 transitions. [2018-06-24 21:18:45,354 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:45,354 INFO ]: Start isEmpty. Operand 186 states and 491 transitions. [2018-06-24 21:18:45,358 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:18:45,358 INFO ]: Found error trace [2018-06-24 21:18:45,358 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:45,358 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:45,359 INFO ]: Analyzing trace with hash -1142496032, now seen corresponding path program 1 times [2018-06-24 21:18:45,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:45,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:45,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:45,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:45,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:45,377 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:45,558 INFO ]: Checked inductivity of 32 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:18:45,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:45,558 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:45,563 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:45,612 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:45,615 INFO ]: Computing forward predicates... [2018-06-24 21:18:45,689 INFO ]: Checked inductivity of 32 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:18:45,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:45,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:18:45,714 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:18:45,714 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:18:45,714 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:18:45,714 INFO ]: Start difference. First operand 186 states and 491 transitions. Second operand 10 states. [2018-06-24 21:18:46,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:46,630 INFO ]: Finished difference Result 361 states and 1075 transitions. [2018-06-24 21:18:46,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:18:46,631 INFO ]: Start accepts. Automaton has 10 states. Word has length 26 [2018-06-24 21:18:46,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:46,645 INFO ]: With dead ends: 361 [2018-06-24 21:18:46,645 INFO ]: Without dead ends: 360 [2018-06-24 21:18:46,646 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:18:46,646 INFO ]: Start minimizeSevpa. Operand 360 states. [2018-06-24 21:18:46,676 INFO ]: Finished minimizeSevpa. Reduced states from 360 to 262. [2018-06-24 21:18:46,676 INFO ]: Start removeUnreachable. Operand 262 states. [2018-06-24 21:18:46,682 INFO ]: Finished removeUnreachable. Reduced from 262 states to 262 states and 711 transitions. [2018-06-24 21:18:46,682 INFO ]: Start accepts. Automaton has 262 states and 711 transitions. Word has length 26 [2018-06-24 21:18:46,682 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:46,683 INFO ]: Abstraction has 262 states and 711 transitions. [2018-06-24 21:18:46,683 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:18:46,683 INFO ]: Start isEmpty. Operand 262 states and 711 transitions. [2018-06-24 21:18:46,689 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:18:46,689 INFO ]: Found error trace [2018-06-24 21:18:46,689 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:46,689 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:46,689 INFO ]: Analyzing trace with hash 2100295717, now seen corresponding path program 1 times [2018-06-24 21:18:46,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:46,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:46,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:46,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:46,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:46,699 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:46,756 INFO ]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:18:46,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:46,757 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:46,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:46,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:46,807 INFO ]: Computing forward predicates... [2018-06-24 21:18:46,948 INFO ]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 21:18:46,976 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:18:46,976 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-24 21:18:46,976 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:18:46,976 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:18:46,976 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:18:46,976 INFO ]: Start difference. First operand 262 states and 711 transitions. Second operand 10 states. [2018-06-24 21:18:53,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:53,644 INFO ]: Finished difference Result 1318 states and 6436 transitions. [2018-06-24 21:18:53,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-06-24 21:18:53,645 INFO ]: Start accepts. Automaton has 10 states. Word has length 26 [2018-06-24 21:18:53,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:53,770 INFO ]: With dead ends: 1318 [2018-06-24 21:18:53,770 INFO ]: Without dead ends: 1318 [2018-06-24 21:18:53,772 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=895, Invalid=5747, Unknown=0, NotChecked=0, Total=6642 [2018-06-24 21:18:53,773 INFO ]: Start minimizeSevpa. Operand 1318 states. [2018-06-24 21:18:54,283 INFO ]: Finished minimizeSevpa. Reduced states from 1318 to 339. [2018-06-24 21:18:54,283 INFO ]: Start removeUnreachable. Operand 339 states. [2018-06-24 21:18:54,306 INFO ]: Finished removeUnreachable. Reduced from 339 states to 339 states and 997 transitions. [2018-06-24 21:18:54,306 INFO ]: Start accepts. Automaton has 339 states and 997 transitions. Word has length 26 [2018-06-24 21:18:54,307 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:54,307 INFO ]: Abstraction has 339 states and 997 transitions. [2018-06-24 21:18:54,307 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:18:54,307 INFO ]: Start isEmpty. Operand 339 states and 997 transitions. [2018-06-24 21:18:54,313 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:18:54,313 INFO ]: Found error trace [2018-06-24 21:18:54,313 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:54,313 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:54,314 INFO ]: Analyzing trace with hash -1986963098, now seen corresponding path program 2 times [2018-06-24 21:18:54,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:54,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:54,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:54,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:54,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:54,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:54,555 INFO ]: Checked inductivity of 32 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:18:54,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:54,555 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:18:54,567 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:54,629 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:18:54,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:54,632 INFO ]: Computing forward predicates... [2018-06-24 21:18:54,796 INFO ]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:18:54,819 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:18:54,819 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-06-24 21:18:54,819 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:18:54,819 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:18:54,819 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:18:54,819 INFO ]: Start difference. First operand 339 states and 997 transitions. Second operand 9 states. [2018-06-24 21:18:56,846 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:18:58,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:58,756 INFO ]: Finished difference Result 1152 states and 5425 transitions. [2018-06-24 21:18:58,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-24 21:18:58,756 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-24 21:18:58,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:58,835 INFO ]: With dead ends: 1152 [2018-06-24 21:18:58,835 INFO ]: Without dead ends: 1152 [2018-06-24 21:18:58,837 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=2095, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 21:18:58,838 INFO ]: Start minimizeSevpa. Operand 1152 states. [2018-06-24 21:18:59,097 INFO ]: Finished minimizeSevpa. Reduced states from 1152 to 443. [2018-06-24 21:18:59,098 INFO ]: Start removeUnreachable. Operand 443 states. [2018-06-24 21:18:59,107 INFO ]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1352 transitions. [2018-06-24 21:18:59,107 INFO ]: Start accepts. Automaton has 443 states and 1352 transitions. Word has length 26 [2018-06-24 21:18:59,108 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:59,108 INFO ]: Abstraction has 443 states and 1352 transitions. [2018-06-24 21:18:59,108 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:18:59,109 INFO ]: Start isEmpty. Operand 443 states and 1352 transitions. [2018-06-24 21:18:59,116 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:18:59,116 INFO ]: Found error trace [2018-06-24 21:18:59,116 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:59,116 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:59,116 INFO ]: Analyzing trace with hash -1975812056, now seen corresponding path program 1 times [2018-06-24 21:18:59,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:59,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:59,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:59,117 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:59,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:59,127 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:59,652 INFO ]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:18:59,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:59,652 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:59,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:59,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:59,708 INFO ]: Computing forward predicates... [2018-06-24 21:18:59,778 INFO ]: Checked inductivity of 32 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:18:59,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:59,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:18:59,799 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:18:59,799 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:18:59,799 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:18:59,800 INFO ]: Start difference. First operand 443 states and 1352 transitions. Second operand 14 states. [2018-06-24 21:19:01,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:19:01,023 INFO ]: Finished difference Result 849 states and 2868 transitions. [2018-06-24 21:19:01,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:19:01,023 INFO ]: Start accepts. Automaton has 14 states. Word has length 26 [2018-06-24 21:19:01,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:19:01,053 INFO ]: With dead ends: 849 [2018-06-24 21:19:01,053 INFO ]: Without dead ends: 849 [2018-06-24 21:19:01,053 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:19:01,054 INFO ]: Start minimizeSevpa. Operand 849 states. [2018-06-24 21:19:01,148 INFO ]: Finished minimizeSevpa. Reduced states from 849 to 453. [2018-06-24 21:19:01,148 INFO ]: Start removeUnreachable. Operand 453 states. [2018-06-24 21:19:01,159 INFO ]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1402 transitions. [2018-06-24 21:19:01,159 INFO ]: Start accepts. Automaton has 453 states and 1402 transitions. Word has length 26 [2018-06-24 21:19:01,159 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:19:01,159 INFO ]: Abstraction has 453 states and 1402 transitions. [2018-06-24 21:19:01,159 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:19:01,159 INFO ]: Start isEmpty. Operand 453 states and 1402 transitions. [2018-06-24 21:19:01,167 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:19:01,167 INFO ]: Found error trace [2018-06-24 21:19:01,167 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:19:01,167 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:19:01,167 INFO ]: Analyzing trace with hash 1809655807, now seen corresponding path program 1 times [2018-06-24 21:19:01,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:19:01,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:19:01,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:19:01,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:19:01,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:19:01,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:19:01,430 INFO ]: Checked inductivity of 44 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 21:19:01,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:19:01,430 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:19:01,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:19:01,477 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:19:01,480 INFO ]: Computing forward predicates... [2018-06-24 21:19:01,565 INFO ]: Checked inductivity of 44 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 21:19:01,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:19:01,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:19:01,584 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:19:01,584 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:19:01,584 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:19:01,584 INFO ]: Start difference. First operand 453 states and 1402 transitions. Second operand 14 states. [2018-06-24 21:19:08,313 WARN ]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:19:09,653 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:19:13,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:19:13,918 INFO ]: Finished difference Result 4475 states and 24575 transitions. [2018-06-24 21:19:13,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-06-24 21:19:13,918 INFO ]: Start accepts. Automaton has 14 states. Word has length 30 [2018-06-24 21:19:13,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:19:14,566 INFO ]: With dead ends: 4475 [2018-06-24 21:19:14,566 INFO ]: Without dead ends: 4475 [2018-06-24 21:19:14,575 INFO ]: 0 DeclaredPredicates, 328 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14134 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3098, Invalid=32058, Unknown=0, NotChecked=0, Total=35156 [2018-06-24 21:19:14,577 INFO ]: Start minimizeSevpa. Operand 4475 states. [2018-06-24 21:19:15,439 INFO ]: Finished minimizeSevpa. Reduced states from 4475 to 1034. [2018-06-24 21:19:15,439 INFO ]: Start removeUnreachable. Operand 1034 states. [2018-06-24 21:19:15,466 INFO ]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3212 transitions. [2018-06-24 21:19:15,466 INFO ]: Start accepts. Automaton has 1034 states and 3212 transitions. Word has length 30 [2018-06-24 21:19:15,466 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:19:15,466 INFO ]: Abstraction has 1034 states and 3212 transitions. [2018-06-24 21:19:15,466 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:19:15,466 INFO ]: Start isEmpty. Operand 1034 states and 3212 transitions. [2018-06-24 21:19:15,486 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:19:15,486 INFO ]: Found error trace [2018-06-24 21:19:15,486 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:19:15,486 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:19:15,486 INFO ]: Analyzing trace with hash -915720066, now seen corresponding path program 1 times [2018-06-24 21:19:15,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:19:15,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:19:15,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:19:15,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:19:15,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:19:15,496 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:19:15,588 INFO ]: Checked inductivity of 44 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 21:19:15,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:19:15,589 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:19:15,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:19:15,621 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:19:15,625 INFO ]: Computing forward predicates... [2018-06-24 21:19:15,786 INFO ]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:19:15,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:19:15,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:19:15,807 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:19:15,807 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:19:15,807 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:19:15,807 INFO ]: Start difference. First operand 1034 states and 3212 transitions. Second operand 14 states. [2018-06-24 21:19:16,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:19:16,891 INFO ]: Finished difference Result 1698 states and 5233 transitions. [2018-06-24 21:19:16,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:19:16,891 INFO ]: Start accepts. Automaton has 14 states. Word has length 30 [2018-06-24 21:19:16,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:19:16,980 INFO ]: With dead ends: 1698 [2018-06-24 21:19:16,980 INFO ]: Without dead ends: 1698 [2018-06-24 21:19:16,980 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:19:16,981 INFO ]: Start minimizeSevpa. Operand 1698 states. [2018-06-24 21:19:17,119 INFO ]: Finished minimizeSevpa. Reduced states from 1698 to 1034. [2018-06-24 21:19:17,119 INFO ]: Start removeUnreachable. Operand 1034 states. [2018-06-24 21:19:17,151 INFO ]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3182 transitions. [2018-06-24 21:19:17,151 INFO ]: Start accepts. Automaton has 1034 states and 3182 transitions. Word has length 30 [2018-06-24 21:19:17,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:19:17,151 INFO ]: Abstraction has 1034 states and 3182 transitions. [2018-06-24 21:19:17,151 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:19:17,151 INFO ]: Start isEmpty. Operand 1034 states and 3182 transitions. [2018-06-24 21:19:17,172 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:19:17,172 INFO ]: Found error trace [2018-06-24 21:19:17,172 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:19:17,172 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:19:17,172 INFO ]: Analyzing trace with hash -977759680, now seen corresponding path program 1 times [2018-06-24 21:19:17,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:19:17,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:19:17,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:19:17,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:19:17,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:19:17,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:19:17,329 INFO ]: Checked inductivity of 44 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 21:19:17,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:19:17,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:19:17,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:19:17,376 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:19:17,379 INFO ]: Computing forward predicates... [2018-06-24 21:19:17,597 INFO ]: Checked inductivity of 44 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 21:19:17,618 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:19:17,618 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:19:17,618 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:19:17,618 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:19:17,619 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:19:17,619 INFO ]: Start difference. First operand 1034 states and 3182 transitions. Second operand 14 states. Received shutdown request... [2018-06-24 21:19:38,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-06-24 21:19:38,517 WARN ]: Verification canceled [2018-06-24 21:19:38,520 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:19:38,521 WARN ]: Timeout [2018-06-24 21:19:38,521 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:19:38 BasicIcfg [2018-06-24 21:19:38,521 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:19:38,522 INFO ]: Toolchain (without parser) took 59897.63 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 258.7 MB in the beginning and 527.2 MB in the end (delta: -268.6 MB). Peak memory consumption was 848.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:19:38,522 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:19:38,522 INFO ]: ChcToBoogie took 68.04 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 255.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:19:38,523 INFO ]: Boogie Preprocessor took 53.44 ms. Allocated memory is still 308.3 MB. Free memory was 255.7 MB in the beginning and 254.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 21:19:38,523 INFO ]: RCFGBuilder took 556.39 ms. Allocated memory is still 308.3 MB. Free memory was 254.7 MB in the beginning and 238.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:19:38,524 INFO ]: BlockEncodingV2 took 381.96 ms. Allocated memory is still 308.3 MB. Free memory was 238.6 MB in the beginning and 224.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:19:38,524 INFO ]: TraceAbstraction took 58827.17 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 224.6 MB in the beginning and 527.2 MB in the end (delta: -302.6 MB). Peak memory consumption was 814.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:19:38,527 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 66 edges - StatisticsResult: Encoded RCFG 25 locations, 51 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.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.04 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 255.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.44 ms. Allocated memory is still 308.3 MB. Free memory was 255.7 MB in the beginning and 254.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 556.39 ms. Allocated memory is still 308.3 MB. Free memory was 254.7 MB in the beginning and 238.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 381.96 ms. Allocated memory is still 308.3 MB. Free memory was 238.6 MB in the beginning and 224.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58827.17 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 224.6 MB in the beginning and 527.2 MB in the end (delta: -302.6 MB). Peak memory consumption was 814.6 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 (1034states) and interpolant automaton (currently 170 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (7485 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. TIMEOUT Result, 58.7s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 52.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5435 SDtfs, 1453 SDslu, 21348 SDs, 0 SdLazy, 53694 SolverSat, 13477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29576 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1034occurred in iteration=14, 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: 2.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 6698 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 17816 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1881 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 491/568 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/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-19-38-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-19-38-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-19-38-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/file.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-19-38-538.csv Completed graceful shutdown