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.10.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:20:03,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:20:03,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:20:03,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:20:03,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:20:03,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:20:03,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:20:03,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:20:03,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:20:03,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:20:03,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:20:03,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:20:03,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:20:03,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:20:03,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:20:03,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:20:03,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:20:03,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:20:03,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:20:03,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:20:03,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:20:03,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:20:03,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:20:03,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:20:03,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:20:03,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:20:03,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:20:03,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:20:03,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:20:03,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:20:03,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:20:03,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:20:03,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:20:03,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:20:03,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:20:03,254 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:20:03,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:20:03,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:20:03,278 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:20:03,278 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:20:03,279 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:20:03,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:20:03,280 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:20:03,280 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:20:03,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:20:03,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:20:03,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:20:03,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:20:03,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:20:03,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:20:03,282 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:20:03,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:20:03,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:20:03,282 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:20:03,282 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:20:03,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:20:03,283 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:20:03,285 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:20:03,285 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:20:03,331 INFO ]: Repository-Root is: /tmp [2018-06-24 20:20:03,345 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:20:03,355 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:20:03,356 INFO ]: Initializing SmtParser... [2018-06-24 20:20:03,357 INFO ]: SmtParser initialized [2018-06-24 20:20:03,358 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.10.smt2 [2018-06-24 20:20:03,359 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:20:03,451 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.10.smt2 unknown [2018-06-24 20:20:04,428 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.10.smt2 [2018-06-24 20:20:04,433 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:20:04,440 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:20:04,440 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:20:04,440 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:20:04,440 INFO ]: ChcToBoogie initialized [2018-06-24 20:20:04,444 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,649 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04 Unit [2018-06-24 20:20:04,649 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:20:04,650 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:20:04,650 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:20:04,650 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:20:04,671 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,671 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,694 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,694 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,722 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,727 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,733 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... [2018-06-24 20:20:04,741 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:20:04,742 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:20:04,742 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:20:04,742 INFO ]: RCFGBuilder initialized [2018-06-24 20:20:04,743 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:20:04,761 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:20:04,761 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:20:04,761 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:20:04,761 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:20:04,761 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:20:04,761 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:20:07,219 INFO ]: Using library mode [2018-06-24 20:20:07,220 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:20:07 BoogieIcfgContainer [2018-06-24 20:20:07,220 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:20:07,221 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:20:07,221 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:20:07,222 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:20:07,223 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:20:07" (1/1) ... [2018-06-24 20:20:07,273 INFO ]: Initial Icfg 144 locations, 282 edges [2018-06-24 20:20:07,275 INFO ]: Using Remove infeasible edges [2018-06-24 20:20:07,276 INFO ]: Using Maximize final states [2018-06-24 20:20:07,276 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:20:07,276 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:20:07,278 INFO ]: Using Remove sink states [2018-06-24 20:20:07,279 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:20:07,279 INFO ]: Using Use SBE [2018-06-24 20:20:07,307 INFO ]: SBE split 0 edges [2018-06-24 20:20:07,313 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:20:07,316 INFO ]: 0 new accepting states [2018-06-24 20:20:08,323 INFO ]: Removed 61 edges and 8 locations by large block encoding [2018-06-24 20:20:08,326 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:20:08,329 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:20:08,330 INFO ]: 0 new accepting states [2018-06-24 20:20:08,332 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:20:08,333 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:20:08,335 INFO ]: Encoded RCFG 133 locations, 270 edges [2018-06-24 20:20:08,335 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:20:08 BasicIcfg [2018-06-24 20:20:08,335 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:20:08,337 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:20:08,337 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:20:08,339 INFO ]: TraceAbstraction initialized [2018-06-24 20:20:08,340 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:20:04" (1/4) ... [2018-06-24 20:20:08,340 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cac91dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:20:08, skipping insertion in model container [2018-06-24 20:20:08,341 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:20:04" (2/4) ... [2018-06-24 20:20:08,341 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cac91dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:20:08, skipping insertion in model container [2018-06-24 20:20:08,341 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:20:07" (3/4) ... [2018-06-24 20:20:08,341 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cac91dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:20:08, skipping insertion in model container [2018-06-24 20:20:08,341 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:20:08" (4/4) ... [2018-06-24 20:20:08,343 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:20:08,352 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:20:08,359 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:20:08,404 INFO ]: Using default assertion order modulation [2018-06-24 20:20:08,404 INFO ]: Interprodecural is true [2018-06-24 20:20:08,404 INFO ]: Hoare is false [2018-06-24 20:20:08,404 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:20:08,404 INFO ]: Backedges is TWOTRACK [2018-06-24 20:20:08,404 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:20:08,404 INFO ]: Difference is false [2018-06-24 20:20:08,404 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:20:08,404 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:20:08,422 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:20:08,457 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:20:08,457 INFO ]: Found error trace [2018-06-24 20:20:08,458 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:20:08,458 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:08,465 INFO ]: Analyzing trace with hash 5787531, now seen corresponding path program 1 times [2018-06-24 20:20:08,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:08,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:08,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:08,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:08,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:08,669 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:08,971 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:20:08,974 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:08,974 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:20:08,976 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:20:08,991 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:20:08,992 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:08,995 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:20:11,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:11,152 INFO ]: Finished difference Result 134 states and 367 transitions. [2018-06-24 20:20:11,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:20:11,154 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:20:11,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:11,191 INFO ]: With dead ends: 134 [2018-06-24 20:20:11,191 INFO ]: Without dead ends: 134 [2018-06-24 20:20:11,192 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:11,211 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 20:20:11,315 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-24 20:20:11,316 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 20:20:11,329 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 367 transitions. [2018-06-24 20:20:11,331 INFO ]: Start accepts. Automaton has 134 states and 367 transitions. Word has length 4 [2018-06-24 20:20:11,331 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:11,331 INFO ]: Abstraction has 134 states and 367 transitions. [2018-06-24 20:20:11,331 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:20:11,331 INFO ]: Start isEmpty. Operand 134 states and 367 transitions. [2018-06-24 20:20:11,342 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:20:11,342 INFO ]: Found error trace [2018-06-24 20:20:11,342 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:20:11,343 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:11,343 INFO ]: Analyzing trace with hash 178632030, now seen corresponding path program 1 times [2018-06-24 20:20:11,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:11,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:11,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:11,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:11,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:11,371 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:11,510 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:20:11,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:11,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:20:11,512 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:20:11,512 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:20:11,512 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:11,512 INFO ]: Start difference. First operand 134 states and 367 transitions. Second operand 3 states. [2018-06-24 20:20:14,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:14,238 INFO ]: Finished difference Result 264 states and 593 transitions. [2018-06-24 20:20:14,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:20:14,239 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:20:14,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:14,260 INFO ]: With dead ends: 264 [2018-06-24 20:20:14,261 INFO ]: Without dead ends: 264 [2018-06-24 20:20:14,261 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:14,262 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-24 20:20:14,325 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-24 20:20:14,325 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-24 20:20:14,337 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 593 transitions. [2018-06-24 20:20:14,337 INFO ]: Start accepts. Automaton has 264 states and 593 transitions. Word has length 5 [2018-06-24 20:20:14,337 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:14,337 INFO ]: Abstraction has 264 states and 593 transitions. [2018-06-24 20:20:14,337 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:20:14,337 INFO ]: Start isEmpty. Operand 264 states and 593 transitions. [2018-06-24 20:20:14,346 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:20:14,346 INFO ]: Found error trace [2018-06-24 20:20:14,346 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:20:14,346 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:14,346 INFO ]: Analyzing trace with hash 178729091, now seen corresponding path program 1 times [2018-06-24 20:20:14,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:14,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:14,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:14,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:14,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:14,366 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:14,491 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:20:14,491 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:14,491 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:20:14,491 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:20:14,491 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:20:14,491 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:14,491 INFO ]: Start difference. First operand 264 states and 593 transitions. Second operand 3 states. [2018-06-24 20:20:15,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:15,260 INFO ]: Finished difference Result 394 states and 804 transitions. [2018-06-24 20:20:15,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:20:15,260 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:20:15,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:15,287 INFO ]: With dead ends: 394 [2018-06-24 20:20:15,288 INFO ]: Without dead ends: 394 [2018-06-24 20:20:15,288 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:20:15,288 INFO ]: Start minimizeSevpa. Operand 394 states. [2018-06-24 20:20:15,343 INFO ]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-06-24 20:20:15,343 INFO ]: Start removeUnreachable. Operand 394 states. [2018-06-24 20:20:15,357 INFO ]: Finished removeUnreachable. Reduced from 394 states to 394 states and 804 transitions. [2018-06-24 20:20:15,357 INFO ]: Start accepts. Automaton has 394 states and 804 transitions. Word has length 5 [2018-06-24 20:20:15,357 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:15,357 INFO ]: Abstraction has 394 states and 804 transitions. [2018-06-24 20:20:15,357 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:20:15,357 INFO ]: Start isEmpty. Operand 394 states and 804 transitions. [2018-06-24 20:20:15,379 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:20:15,379 INFO ]: Found error trace [2018-06-24 20:20:15,379 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:15,379 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:15,379 INFO ]: Analyzing trace with hash 1034040207, now seen corresponding path program 1 times [2018-06-24 20:20:15,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:15,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:15,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:15,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:15,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:15,433 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:15,660 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:15,660 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:15,660 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:20:15,661 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:20:15,661 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:20:15,661 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:20:15,661 INFO ]: Start difference. First operand 394 states and 804 transitions. Second operand 5 states. [2018-06-24 20:20:17,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:17,442 INFO ]: Finished difference Result 614 states and 1616 transitions. [2018-06-24 20:20:17,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:20:17,442 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:20:17,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:17,508 INFO ]: With dead ends: 614 [2018-06-24 20:20:17,508 INFO ]: Without dead ends: 611 [2018-06-24 20:20:17,509 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:17,509 INFO ]: Start minimizeSevpa. Operand 611 states. [2018-06-24 20:20:17,634 INFO ]: Finished minimizeSevpa. Reduced states from 611 to 473. [2018-06-24 20:20:17,634 INFO ]: Start removeUnreachable. Operand 473 states. [2018-06-24 20:20:17,649 INFO ]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1076 transitions. [2018-06-24 20:20:17,649 INFO ]: Start accepts. Automaton has 473 states and 1076 transitions. Word has length 9 [2018-06-24 20:20:17,649 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:17,649 INFO ]: Abstraction has 473 states and 1076 transitions. [2018-06-24 20:20:17,649 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:20:17,649 INFO ]: Start isEmpty. Operand 473 states and 1076 transitions. [2018-06-24 20:20:17,672 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:20:17,672 INFO ]: Found error trace [2018-06-24 20:20:17,672 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:17,672 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:17,672 INFO ]: Analyzing trace with hash 1111256339, now seen corresponding path program 1 times [2018-06-24 20:20:17,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:17,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:17,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:17,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:17,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:17,733 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:17,905 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:17,905 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:17,906 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:20:17,906 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:20:17,906 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:20:17,906 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:20:17,906 INFO ]: Start difference. First operand 473 states and 1076 transitions. Second operand 5 states. [2018-06-24 20:20:20,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:20,863 INFO ]: Finished difference Result 1186 states and 3813 transitions. [2018-06-24 20:20:20,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:20:20,863 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:20:20,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:20,993 INFO ]: With dead ends: 1186 [2018-06-24 20:20:20,993 INFO ]: Without dead ends: 892 [2018-06-24 20:20:20,993 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:20:20,994 INFO ]: Start minimizeSevpa. Operand 892 states. [2018-06-24 20:20:21,232 INFO ]: Finished minimizeSevpa. Reduced states from 892 to 611. [2018-06-24 20:20:21,232 INFO ]: Start removeUnreachable. Operand 611 states. [2018-06-24 20:20:21,250 INFO ]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1421 transitions. [2018-06-24 20:20:21,250 INFO ]: Start accepts. Automaton has 611 states and 1421 transitions. Word has length 9 [2018-06-24 20:20:21,250 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:21,250 INFO ]: Abstraction has 611 states and 1421 transitions. [2018-06-24 20:20:21,250 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:20:21,251 INFO ]: Start isEmpty. Operand 611 states and 1421 transitions. [2018-06-24 20:20:21,283 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:20:21,283 INFO ]: Found error trace [2018-06-24 20:20:21,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:21,283 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:21,283 INFO ]: Analyzing trace with hash 1111260183, now seen corresponding path program 1 times [2018-06-24 20:20:21,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:21,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:21,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:21,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:21,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:21,331 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:21,620 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:21,620 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:21,620 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:20:21,620 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:20:21,620 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:20:21,620 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:20:21,620 INFO ]: Start difference. First operand 611 states and 1421 transitions. Second operand 5 states. [2018-06-24 20:20:23,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:23,010 INFO ]: Finished difference Result 892 states and 2848 transitions. [2018-06-24 20:20:23,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:20:23,010 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:20:23,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:23,068 INFO ]: With dead ends: 892 [2018-06-24 20:20:23,068 INFO ]: Without dead ends: 892 [2018-06-24 20:20:23,069 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:20:23,069 INFO ]: Start minimizeSevpa. Operand 892 states. [2018-06-24 20:20:23,244 INFO ]: Finished minimizeSevpa. Reduced states from 892 to 611. [2018-06-24 20:20:23,244 INFO ]: Start removeUnreachable. Operand 611 states. [2018-06-24 20:20:23,263 INFO ]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1417 transitions. [2018-06-24 20:20:23,263 INFO ]: Start accepts. Automaton has 611 states and 1417 transitions. Word has length 9 [2018-06-24 20:20:23,263 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:23,263 INFO ]: Abstraction has 611 states and 1417 transitions. [2018-06-24 20:20:23,263 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:20:23,263 INFO ]: Start isEmpty. Operand 611 states and 1417 transitions. [2018-06-24 20:20:23,294 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:20:23,294 INFO ]: Found error trace [2018-06-24 20:20:23,294 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:23,294 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:23,294 INFO ]: Analyzing trace with hash 1111262105, now seen corresponding path program 1 times [2018-06-24 20:20:23,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:23,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:23,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:23,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:23,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:23,340 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:23,623 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:23,624 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:23,624 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:20:23,624 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:20:23,624 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:20:23,624 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:20:23,624 INFO ]: Start difference. First operand 611 states and 1417 transitions. Second operand 5 states. [2018-06-24 20:20:24,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:24,631 INFO ]: Finished difference Result 892 states and 2844 transitions. [2018-06-24 20:20:24,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:20:24,634 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:20:24,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:24,684 INFO ]: With dead ends: 892 [2018-06-24 20:20:24,684 INFO ]: Without dead ends: 892 [2018-06-24 20:20:24,684 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:20:24,685 INFO ]: Start minimizeSevpa. Operand 892 states. [2018-06-24 20:20:24,856 INFO ]: Finished minimizeSevpa. Reduced states from 892 to 611. [2018-06-24 20:20:24,857 INFO ]: Start removeUnreachable. Operand 611 states. [2018-06-24 20:20:24,880 INFO ]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1413 transitions. [2018-06-24 20:20:24,880 INFO ]: Start accepts. Automaton has 611 states and 1413 transitions. Word has length 9 [2018-06-24 20:20:24,880 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:24,880 INFO ]: Abstraction has 611 states and 1413 transitions. [2018-06-24 20:20:24,880 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:20:24,880 INFO ]: Start isEmpty. Operand 611 states and 1413 transitions. [2018-06-24 20:20:24,911 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:24,911 INFO ]: Found error trace [2018-06-24 20:20:24,911 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:24,912 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:24,912 INFO ]: Analyzing trace with hash -247421082, now seen corresponding path program 1 times [2018-06-24 20:20:24,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:24,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:24,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:24,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:24,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:24,956 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:25,395 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:25,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:20:25,395 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:20:25,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:25,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:25,533 INFO ]: Computing forward predicates... [2018-06-24 20:20:25,815 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:25,843 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:20:25,843 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:20:25,844 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:20:25,844 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:20:25,844 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:20:25,844 INFO ]: Start difference. First operand 611 states and 1413 transitions. Second operand 10 states. [2018-06-24 20:20:35,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:35,718 INFO ]: Finished difference Result 1318 states and 4860 transitions. [2018-06-24 20:20:35,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:20:35,719 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:20:35,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:35,881 INFO ]: With dead ends: 1318 [2018-06-24 20:20:35,881 INFO ]: Without dead ends: 1308 [2018-06-24 20:20:35,882 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:20:35,883 INFO ]: Start minimizeSevpa. Operand 1308 states. [2018-06-24 20:20:36,328 INFO ]: Finished minimizeSevpa. Reduced states from 1308 to 852. [2018-06-24 20:20:36,328 INFO ]: Start removeUnreachable. Operand 852 states. [2018-06-24 20:20:36,359 INFO ]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2139 transitions. [2018-06-24 20:20:36,359 INFO ]: Start accepts. Automaton has 852 states and 2139 transitions. Word has length 10 [2018-06-24 20:20:36,359 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:36,359 INFO ]: Abstraction has 852 states and 2139 transitions. [2018-06-24 20:20:36,359 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:20:36,359 INFO ]: Start isEmpty. Operand 852 states and 2139 transitions. [2018-06-24 20:20:36,401 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:36,401 INFO ]: Found error trace [2018-06-24 20:20:36,401 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:36,401 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:36,401 INFO ]: Analyzing trace with hash -121100854, now seen corresponding path program 1 times [2018-06-24 20:20:36,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:36,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:36,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:36,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:36,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:36,455 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:36,790 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:36,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:36,790 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:20:36,790 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:20:36,791 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:20:36,791 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:36,791 INFO ]: Start difference. First operand 852 states and 2139 transitions. Second operand 6 states. [2018-06-24 20:20:40,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:40,553 INFO ]: Finished difference Result 1783 states and 10157 transitions. [2018-06-24 20:20:40,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:20:40,553 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:40,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:40,722 INFO ]: With dead ends: 1783 [2018-06-24 20:20:40,722 INFO ]: Without dead ends: 1783 [2018-06-24 20:20:40,722 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:20:40,752 INFO ]: Start minimizeSevpa. Operand 1783 states. [2018-06-24 20:20:41,376 INFO ]: Finished minimizeSevpa. Reduced states from 1783 to 1112. [2018-06-24 20:20:41,376 INFO ]: Start removeUnreachable. Operand 1112 states. [2018-06-24 20:20:41,427 INFO ]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 3252 transitions. [2018-06-24 20:20:41,427 INFO ]: Start accepts. Automaton has 1112 states and 3252 transitions. Word has length 10 [2018-06-24 20:20:41,427 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:41,427 INFO ]: Abstraction has 1112 states and 3252 transitions. [2018-06-24 20:20:41,427 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:20:41,427 INFO ]: Start isEmpty. Operand 1112 states and 3252 transitions. [2018-06-24 20:20:41,453 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:41,453 INFO ]: Found error trace [2018-06-24 20:20:41,453 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:41,453 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:41,454 INFO ]: Analyzing trace with hash -121097010, now seen corresponding path program 1 times [2018-06-24 20:20:41,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:41,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:41,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:41,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:41,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:41,496 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:41,718 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:41,718 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:41,718 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:20:41,718 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:20:41,718 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:20:41,718 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:41,718 INFO ]: Start difference. First operand 1112 states and 3252 transitions. Second operand 6 states. [2018-06-24 20:20:46,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:46,007 INFO ]: Finished difference Result 2285 states and 13051 transitions. [2018-06-24 20:20:46,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:20:46,033 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:46,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:46,239 INFO ]: With dead ends: 2285 [2018-06-24 20:20:46,240 INFO ]: Without dead ends: 2285 [2018-06-24 20:20:46,240 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:20:46,241 INFO ]: Start minimizeSevpa. Operand 2285 states. [2018-06-24 20:20:46,844 INFO ]: Finished minimizeSevpa. Reduced states from 2285 to 1500. [2018-06-24 20:20:46,844 INFO ]: Start removeUnreachable. Operand 1500 states. [2018-06-24 20:20:46,898 INFO ]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 4458 transitions. [2018-06-24 20:20:46,898 INFO ]: Start accepts. Automaton has 1500 states and 4458 transitions. Word has length 10 [2018-06-24 20:20:46,899 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:46,899 INFO ]: Abstraction has 1500 states and 4458 transitions. [2018-06-24 20:20:46,899 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:20:46,899 INFO ]: Start isEmpty. Operand 1500 states and 4458 transitions. [2018-06-24 20:20:46,912 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:46,912 INFO ]: Found error trace [2018-06-24 20:20:46,912 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:46,912 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:46,912 INFO ]: Analyzing trace with hash -121095088, now seen corresponding path program 1 times [2018-06-24 20:20:46,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:46,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:46,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:46,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:46,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:46,951 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:48,083 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:48,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:48,084 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:20:48,084 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:20:48,084 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:20:48,084 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:48,084 INFO ]: Start difference. First operand 1500 states and 4458 transitions. Second operand 6 states. [2018-06-24 20:20:50,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:50,945 INFO ]: Finished difference Result 2285 states and 13035 transitions. [2018-06-24 20:20:50,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:20:50,946 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:50,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:51,203 INFO ]: With dead ends: 2285 [2018-06-24 20:20:51,203 INFO ]: Without dead ends: 2285 [2018-06-24 20:20:51,204 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:20:51,205 INFO ]: Start minimizeSevpa. Operand 2285 states. [2018-06-24 20:20:51,798 INFO ]: Finished minimizeSevpa. Reduced states from 2285 to 1492. [2018-06-24 20:20:51,798 INFO ]: Start removeUnreachable. Operand 1492 states. [2018-06-24 20:20:51,868 INFO ]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 4362 transitions. [2018-06-24 20:20:51,868 INFO ]: Start accepts. Automaton has 1492 states and 4362 transitions. Word has length 10 [2018-06-24 20:20:51,868 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:51,868 INFO ]: Abstraction has 1492 states and 4362 transitions. [2018-06-24 20:20:51,868 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:20:51,868 INFO ]: Start isEmpty. Operand 1492 states and 4362 transitions. [2018-06-24 20:20:51,892 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:51,893 INFO ]: Found error trace [2018-06-24 20:20:51,893 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:51,893 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:51,895 INFO ]: Analyzing trace with hash 83757211, now seen corresponding path program 1 times [2018-06-24 20:20:51,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:51,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:51,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:51,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:51,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:51,928 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:52,118 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:52,118 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:52,118 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:20:52,118 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:20:52,118 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:20:52,118 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:52,118 INFO ]: Start difference. First operand 1492 states and 4362 transitions. Second operand 6 states. [2018-06-24 20:20:54,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:54,640 INFO ]: Finished difference Result 4064 states and 23388 transitions. [2018-06-24 20:20:54,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:20:54,640 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:54,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:20:55,211 INFO ]: With dead ends: 4064 [2018-06-24 20:20:55,211 INFO ]: Without dead ends: 4064 [2018-06-24 20:20:55,211 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:20:55,213 INFO ]: Start minimizeSevpa. Operand 4064 states. [2018-06-24 20:20:56,195 INFO ]: Finished minimizeSevpa. Reduced states from 4064 to 2162. [2018-06-24 20:20:56,195 INFO ]: Start removeUnreachable. Operand 2162 states. [2018-06-24 20:20:56,280 INFO ]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 6438 transitions. [2018-06-24 20:20:56,280 INFO ]: Start accepts. Automaton has 2162 states and 6438 transitions. Word has length 10 [2018-06-24 20:20:56,300 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:20:56,300 INFO ]: Abstraction has 2162 states and 6438 transitions. [2018-06-24 20:20:56,300 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:20:56,300 INFO ]: Start isEmpty. Operand 2162 states and 6438 transitions. [2018-06-24 20:20:56,330 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:20:56,330 INFO ]: Found error trace [2018-06-24 20:20:56,331 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:20:56,331 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:20:56,332 INFO ]: Analyzing trace with hash 88672726, now seen corresponding path program 1 times [2018-06-24 20:20:56,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:20:56,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:20:56,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:56,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:20:56,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:20:56,365 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:20:56,514 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:20:56,514 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:20:56,514 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:20:56,514 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:20:56,514 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:20:56,514 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:20:56,515 INFO ]: Start difference. First operand 2162 states and 6438 transitions. Second operand 6 states. [2018-06-24 20:20:57,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:20:57,554 INFO ]: Finished difference Result 3905 states and 19396 transitions. [2018-06-24 20:20:57,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:20:57,554 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:20:57,554 INFO ]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-06-24 20:20:58,019 INFO ]: With dead ends: 3905 [2018-06-24 20:20:58,019 INFO ]: Without dead ends: 3905 [2018-06-24 20:20:58,019 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:20:58,021 INFO ]: Start minimizeSevpa. Operand 3905 states. [2018-06-24 20:20:58,022 WARN ]: Verification canceled [2018-06-24 20:20:58,024 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:20:58,025 WARN ]: Timeout [2018-06-24 20:20:58,025 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:20:58 BasicIcfg [2018-06-24 20:20:58,025 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:20:58,027 INFO ]: Toolchain (without parser) took 53593.64 ms. Allocated memory was 321.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 287.0 MB in the beginning and 1.0 GB in the end (delta: -735.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-24 20:20:58,028 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:20:58,029 INFO ]: ChcToBoogie took 209.24 ms. Allocated memory is still 321.9 MB. Free memory was 287.0 MB in the beginning and 282.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:58,029 INFO ]: Boogie Preprocessor took 91.72 ms. Allocated memory is still 321.9 MB. Free memory was 282.6 MB in the beginning and 278.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:58,029 INFO ]: RCFGBuilder took 2478.42 ms. Allocated memory was 321.9 MB in the beginning and 358.6 MB in the end (delta: 36.7 MB). Free memory was 278.2 MB in the beginning and 220.7 MB in the end (delta: 57.5 MB). Peak memory consumption was 105.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:58,040 INFO ]: BlockEncodingV2 took 1114.56 ms. Allocated memory was 358.6 MB in the beginning and 393.2 MB in the end (delta: 34.6 MB). Free memory was 220.7 MB in the beginning and 261.1 MB in the end (delta: -40.5 MB). Peak memory consumption was 50.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:20:58,040 INFO ]: TraceAbstraction took 49688.90 ms. Allocated memory was 393.2 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 261.1 MB in the beginning and 1.0 GB in the end (delta: -761.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-24 20:20:58,043 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 282 edges - StatisticsResult: Encoded RCFG 133 locations, 270 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 209.24 ms. Allocated memory is still 321.9 MB. Free memory was 287.0 MB in the beginning and 282.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 91.72 ms. Allocated memory is still 321.9 MB. Free memory was 282.6 MB in the beginning and 278.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2478.42 ms. Allocated memory was 321.9 MB in the beginning and 358.6 MB in the end (delta: 36.7 MB). Free memory was 278.2 MB in the beginning and 220.7 MB in the end (delta: 57.5 MB). Peak memory consumption was 105.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1114.56 ms. Allocated memory was 358.6 MB in the beginning and 393.2 MB in the end (delta: 34.6 MB). Free memory was 220.7 MB in the beginning and 261.1 MB in the end (delta: -40.5 MB). Peak memory consumption was 50.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49688.90 ms. Allocated memory was 393.2 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 261.1 MB in the beginning and 1.0 GB in the end (delta: -761.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. TIMEOUT Result, 49.6s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 39.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9365 SDtfs, 1624 SDslu, 19814 SDs, 0 SdLazy, 20371 SolverSat, 3125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2162occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 5588 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 2232 SizeOfPredicates, 11 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 22/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.10.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-20-58-058.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.10.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-20-58-058.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.10.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-20-58-058.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.10.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-20-58-058.csv Completed graceful shutdown